Infosys interview experience Real time questions & tips from candidates to crack your interview
Specialist Programmer
Infosys
2 rounds | 11 Coding
problems
Selected Interview preparation journey
Journey
My journey began in the first year by focusing on the basics—learning programming fundamentals, improving logical thinking, and building a strong foundation. I didn’t rush into advanced topics; instead, I made sure I clearly understood the core concepts.
In the second year, I dedicated most of my time to Data Structures and Algorithms. This phase was challenging, but consistent practice helped me improve my problem-solving skills and confidence. Gradually, I started enjoying solving complex problems.
During the third year, I shifted towards development. I built projects, explored different technologies, and learned how to apply my knowledge to real-world scenarios. This helped me strengthen my resume and gain practical experience.
In the final year, I focused on AI concepts and interview preparation. I revised DSA, practiced mock interviews, and worked on my communication skills. I also ensured that I could clearly explain my projects and thought process.
Overall, consistency and patience played a key role in my journey. Instead of trying to do everything at once, I focused on gradual improvement, which ultimately helped me crack the interview.
Application story
I am currently pursuing my studies at IIIT Bhubaneswar, which has provided me with a strong academic environment and valuable learning opportunities. The institute has played a significant role in shaping my technical foundation and problem-solving skills. Through consistent guidance from faculty, peer learning, and exposure to coding culture, I have been able to grow steadily over the years.
This opportunity came through my college, which actively supports students by connecting them with companies and placement drives. Being part of such an ecosystem helped me stay motivated, prepared, and confident throughout the process, ultimately contributing to my success.
Why selected/rejected for the role?
I met all the eligibility criteria and performed well in the online assessment, which helped me move forward confidently in the selection process and secure this opportunity.
Preparation
Duration: 6 Months
Topics: Data Structures and Algorithms, Object-Oriented Programming Systems, Operating Systems, Database Management Systems, Artificial Intelligence
Tip 1: Be consistent, not perfect.
Tip 2: Revise core subjects (OS, DBMS, OOPs).
Tip 3: Stay patient and confident.
Application process
Where: Campus
Eligibility: Eligible Programs: BE, BTech, ME, MTech, MCA, MSc (5-year Integrated), MSc (Mathematics). Eligible Specializations include: CSE, ISE, IT, Data Science/AI & ML, Cybersecurity, Software Engineering, ECE, EEE, and other allied CS/IT domains. Graduating Batch: 2026, CGPA above 7. (Salary Package: 11 LPA)
Tip 1: Keep it simple with all the necessary details.
Tip 2: Add numerical values to show the impact.
Interview rounds
01
Round
Hard
Online Coding Interview
Duration180 minutes
Interview date20 Nov 2025
Coding problem4
Infosys invigilators were present, ensuring strict monitoring throughout the process. The questions were challenging, and everyone felt both excited and nervous. The assessment was conducted smoothly within the given time under strict invigilation.
1. Sum Of LCM
Moderate
15m average time
90% success
0/80
Asked in companies
You are given an integer ‘N’ , calculate and print the sum of :
LCM(1,N) + LCM(2,N) + .. + LCM(N,N)
where LCM(i,n) denotes the Least Common Multiple of the integers ‘i’ and ‘N’.
2. All Root to Leaf Paths In Binary Tree.
Moderate
25m average time
70% success
0/80
Asked in companies
You are given an arbitrary binary tree consisting of 'N' nodes numbered from 1 to 'N'. Your task is to print all the root to leaf paths of the binary tree.
A leaf of a binary tree is the node which does not have a left child and a right child.
For Example :
Given a binary tree :
All the root to leaf paths are :
1 2 4
1 2 5
1 3
Note :
1. Two nodes may have the same value associated with it.
2. The root node will be fixed and will be provided in the function.
3. Note that the nodes in a path will appear in a fixed order. For example, 1 2 3 is not the same as 2 1 3.
4. Each path should be returned as a string consisting of nodes in order and separated by a space.
5. The path length may be as small as ‘1’.
3. Create Sequence
Easy
10m average time
90% success
0/40
Asked in company
Ninja is good at numbers. So today his friend gave him a task that required him to find out numbers made of 2 and 5 only less than a given limit.
Given an integer N, you need to print all numbers less than N which are having digits only 2 or 5 or both.
For example :
All numbers less than 30 with digits 2 and 5 are 2, 5, 22, 25.
4. Sum root to leaf
Easy
10m average time
90% success
0/40
Asked in companies
You are given an arbitrary binary tree consisting of N nodes where each node is associated with a certain integer value from 1 to 9. Consider each root to leaf path as a number.
For example:
1
/ \
2 3
The root to leaf path 1->2 represents the number 12.
The root to leaf path 1->3 represents the number 13.
Your task is to find the total sum of all the possible root to leaf paths.
In the above example,
The total sum of all the possible root to leaf paths is 12+13 = 25
Note:
The output may be very large, return the answer after taking modulus with (10^9+7).
02
Round
Medium
Face to Face
Duration60 minutes
Interview date27 Mar 2026
Coding problem7
MODE: OFFLINE(1 hour)
FOCUS: DSA + CS Fundamentals
DSA Questions:
- Merge Sort and its time complexity
- Two Sum problem:
* Solved using HashMap approach
* Follow-up: why not use Two-pointer approach (I replied only if array is sorted)
* Follow-up: why you are giving more importance to time than space complexity
* Explained time complexity trade-off: O(n log n) time, O(1) space if not sorted
* Explained why time complexity is more important than space complexity
- Number of nodes in a tree
- Finding distance between source and node in a graph
- Finding unique elements in an array
- Heap insertion, properties, and time complexity
CS Fundamentals:
- OOPs: Encapsulation, Inheritance, Polymorphism, Abstraction
- OS: Process scheduling and context switching
Projects:
Not asked in my case due to time constraints but some of my friends were been asked
HR Discussion:
- Where do you see yourself in 5 years?
I answered that I want to be in a position where my skills and continuous learning
make me hard to replace in the fast-changing tech industry, take ownership,
grow into leadership roles, and share my knowledge.(I just remember the same ans for every interview)
- Any question you want to ask?
I Asked why Infosys invests heavily in training freshers and how is the experience there.
1. Merge Sort
Easy
15m average time
80% success
0/40
Asked in companies
Ninja is playing with numbers but hates when he gets duplicate numbers. Ninja is provided an array, and he wants to remove all duplicate elements and return the array, but he has to maintain the order in which the elements were supplied to him.
2. Two Sum
3. Dijkstra's shortest path
4. Remove Duplicates
5. CS Fundamentals
- OOPs: Encapsulation, Inheritance, Polymorphism, Abstraction (Learn)
- OS: Process scheduling and context switching
6. HR Questions
- Where do you see yourself in 5 years?
- Do you have any questions for us?
Problem approach
- I answered that I want to be in a position where my skills and continuous learning
make me hard to replace in the fast-changing tech industry, take ownership,
grow into leadership roles, and share my knowledge.(I just remember the same ans for every interview)
- I asked why Infosys invests heavily in training freshers and how is the experience there.
7. Count Complete Binary Tree Nodes
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
Which data structure is used to implement a DFS?
Choose another skill to practice
Similar interview experiences
SDE - 1
3 rounds | 7 problems
Interviewed by OYO
Selected 
5027 views
0 comments
0 upvotes
SDE - 1
2 rounds | 5 problems
Interviewed by Meesho
Rejected
6697 views
0 comments
0 upvotes
SDE - 1
3 rounds | 9 problems
Interviewed by Salesforce
Selected 3720 views
0 comments
0 upvotes
Specialist Programmer
2 rounds | 5 problems
Interviewed by Infosys
Selected 1 views
0 comments
0 upvotes