Infosys SP/DSE Off-Campus Interview Experience (Fresher, 2026 Batch)

I interviewed with Infosys for the Specialist Programmer (SP) and Digital Specialist Engineer (DSE) roles on 16 October 2026.

For freshers, Infosys runs one combined process for both roles instead of separate interviews. You clear an online test and an offline proctored round before you ever sit in front of an interviewer, so this post covers all three stages.

Status: SP / DSE, Fresher (2026 Batch)

Location: India

Difficulty: Medium

Online Assessment

The first stage was an online test with three coding questions. Clearing it got me an invite to the offline round.

Technical Round 1 (Offline Proctored DSA Round)

A group of us were called to a college and solved around four DSA questions in a proctored lab. Clearing this round led to the interview.

Technical Round 2 (Interview)

Coding task: 25 minutes

The platform listed two questions with a 45 minute limit, but the interviewer asked me to solve just one, in 25 minutes. The problem gives you an array and an input number K. For every pair of numbers whose XOR is less than K, you add the two numbers and check whether the sum is prime. You count the pairs that pass.

After the coding discussion, the interview moved on to my introduction and then these topics:

• OS basics and scheduling algorithms

• ACID properties and SOLID principles

• JavaScript output order: synchronous code, a promise .then, and setTimeout with 0 delay (he asked whether the order changes if you rearrange them inside the function)

• How dynamic variables are implemented internally in Python, C++, Rust and JavaScript

• Networking, SQL and DBMS

No AI or applied AI questions came up.

Approach

For the coding problem I went with brute force. I used two nested loops over the array, checked the XOR against K, added the pair, and tested the sum for primality with a plain divisibility loop. It hit TLE. The nested iteration was already expensive, and I was re-checking primality from scratch for every pair because I never used a sieve.

If you get this one, build a Sieve of Eratosthenes up to the largest possible sum so each primality check is a lookup, and read the constraints before you write any code.

On the JavaScript question, the order never changes: synchronous code runs first, then the promise callback (microtask queue), then the timeout (macrotask queue), whatever order you write them in.

For the ticketing system, the interviewer said only about 50 users would use it, so I kept the design simple and skipped a caching layer and a queue. I used webhooks to trigger a change whenever something happens in the system, plus polling every five seconds so the dashboard refreshes its values only when something has actually changed. Updating constantly is pointless if the system isn't changing fast.

I'm still waiting on the result. My advice is to brush up on JS event loop ordering, OS scheduling, ACID and SOLID, and to have a simple system design answer ready that matches the scale the interviewer gives you. For coding, practice number theory staples like sieves, because a brute force that passes the samples gets cut by TLE.