I got my interview through hackwithinfy. My interview was offline.
Started with DSA : merge two sorted Linked list
SQL query: retrieve name of employees working in department having more than 5 employees.
Oops: very basic question
Ece core
DBMS : what are relational database , types of realation,
Give example for some non relational databases
I recently participated in the Infosys interview process through HackWithInfy and got selected for the next round in Category 1. The onsite interview took place at the Infosys office in Sector-62, Noida.
Round Structure:
Online Coding Round (HackWithInfy):
I received three coding questions and performed well enough to qualify for Category 1.
Onsite Coding Round (45 minutes):
At the Noida campus, I was given one coding problem to solve on their platform.
One of the problems was related to Binary Trees, and another involved Graphs.
I tried the graph problem, but only a few test cases passed.
Technical Interview:
After the coding round, the interviewer asked several DSA questions, including topics from trees, graphs, DP, and problem-solving.
SQL questions were fairly straightforward.
They also asked about my projects and resume.
I struggled a bit with the DSA part — while my intuition was correct, I couldn’t articulate the exact solutions clearly under pressure.
Overall Impression:
The interview was fair, and the questions were a good mix of coding, theoretical concepts, and project discussion. However, it was challenging, especially the DSA part, and requires strong clarity in algorithms.
Advice for Future Candidates:
Prepare well for core DSA topics, especially graphs, trees, and DP. Practice writing clean, efficient solutions under time constraints.
Interview questions [1]
Question 1
Graph Problem (Asked in Infosys Interview)
Problem: Chair Game – Minimum Jumps
You are given N chairs arranged in a circle, numbered from 0 to N-1.
Each chair i has an associated value A[i], which represents the exact number of positions a person can jump from that chair — either to the left or to the right.
Because the chairs form a circle:
Jumping right from chair (i) goes to (i + A[i]) % N
Jumping left from chair (i) goes to (i - A[i] + N) % N
Bob starts at chair number X, and wants to reach chair number Y.
Your task is to determine the minimum number of jumps Bob needs to reach from chair X to chair Y.
If it is not possible, return -1.
1.Online Assignment.
Need to solve atleast 2 full questions to get selected to interview
2.Technical Interview (1.5 hour]
Asked DSA, Operating systems, DBMS, Java , Oops , Multithreading , My sql questions and about the project related questions