Infosys interview experience Real time questions & tips from candidates to crack your interview
Software Engineer
Infosys
3 rounds | 3 Coding
problems
Rejected
Interview preparation journey
Journey
I started my preparation with the basics of programming and gradually moved on to data structures and algorithms. Initially, I found it difficult to solve coding problems, but with consistent practice on platforms like Coding Ninjas and others, I improved my problem-solving skills.
Along with DSA, I also focused on core subjects such as OOPs, DBMS, and OS. I made sure to revise concepts regularly and learn from my mistakes.
Although I couldn’t crack the interview this time, the experience helped me identify my weak areas, especially in optimization and communication. This journey has motivated me to work harder and improve further for upcoming opportunities.
Application story
I applied for Infosys through my college campus placement process. The company visited our campus, and we were required to register through the placement portal. After the initial screening, I received an invitation for the online assessment. Students who cleared the assessment were shortlisted for further interview rounds. The entire process was well-structured and conducted in an organized manner, with updates shared through the college placement cell and email. Overall, the experience was smooth and systematic.
Why selected/rejected for the role?
I believe I was rejected mainly due to incomplete optimization of my coding solution and not being able to clearly explain my approach in some parts of the interview. While I had a basic understanding of the concepts, I need to improve my problem-solving speed and communication skills.
Preparation
Duration: 3.5 months
Topics: Data Structures, Algorithms, OOPs, DBMS, Operating Systems, Computer Networks, SQL, Aptitude
Tip 1: Practice DSA regularly and focus on understanding concepts instead of just memorizing solutions.
Tip 2: Revise core subjects like OOPs, DBMS, and OS as they are frequently asked in interviews.
Application process
Where: Campus
Eligibility: NA, (Salary package: 6.5 LPA)
Tip 1:Keep your resume concise (1 page) and highlight relevant projects, skills, and achievements clearly.
Tip 2:Be honest and only include skills or technologies you are confident about, as interviewers may ask questions on them.
Interview rounds
01
Round
Medium
Online Coding Interview
Duration90 minutes
Interview date22 Jul 2022
Coding problem1
There were 20 MCQs based on Aptitude and Core Fundamentals, along with 1 coding problem.
1. Maximum Subarray Sum
Moderate
35m average time
81% success
0/80
Asked in companies
You are given an array 'arr' of length 'n', consisting of integers.
A subarray is a contiguous segment of an array. In other words, a subarray can be formed by removing 0 or more integers from the beginning and 0 or more integers from the end of an array.
Find the sum of the subarray (including empty subarray) having maximum sum among all subarrays.
The sum of an empty subarray is 0.
Example :
Input: 'arr' = [1, 2, 7, -4, 3, 2, -10, 9, 1]
Output: 11
Explanation: The subarray yielding the maximum sum is [1, 2, 7, -4, 3, 2].
Problem approach
Step 1: Understand the Problem
I needed to find a subarray (continuous elements) with the maximum possible sum.
Step 2: Initialize Variables
I initialized two variables:
current_sum = 0 (to track ongoing subarray sum)
max_sum = -∞ (to store the maximum sum found so far)
Step 3: Traverse the Array
I iterated through each element of the array and:
Added the current element to current_sum
Updated max_sum = max(max_sum, current_sum)
Step 4: Reset When Needed
If current_sum becomes negative, I reset it to 0
Because a negative sum will reduce future subarray sums
Step 5: Final Answer
After completing the traversal, max_sum contains the maximum subarray sum.
02
Round
Medium
Video Call
Duration40 minutes
Interview date29 Jul 2022
Coding problem1
1. Reverse the String
Easy
15m average time
85% success
0/40
Asked in companies
You are given a string 'STR'. The string contains [a-z] [A-Z] [0-9] [special characters]. You have to find the reverse of the string.
For example:
If the given string is: STR = "abcde". You have to print the string "edcba".
follow up:
Try to solve the problem in O(1) space complexity.
Problem approach
Step 1:I used a two-pointer approach where one pointer starts from the beginning and the other from the end of the string.
step 2: I swapped the characters at both positions and moved the pointers towards the center until they met.
03
Round
Easy
HR Round
Duration25 minutes
Interview date9 Aug 2022
Coding problem1
1. HR Questions
- Introduce yourself.
- What are your strengths and weaknesses?
- Why do you want to join Infosys?
- Are you comfortable with relocation?
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
What does the SQL function NOW() return?
Choose another skill to practice
Similar interview experiences
SDE - 1
4 rounds | 8 problems
Interviewed by Amazon
Selected 
9566 views
0 comments
0 upvotes
SDE - Intern
1 rounds | 3 problems
Interviewed by Amazon
Selected 3744 views
0 comments
0 upvotes
SDE - 2
4 rounds | 6 problems
Interviewed by Expedia Group
Selected 2963 views
0 comments
0 upvotes
Software Engineer
3 rounds | 7 problems
Interviewed by Infosys
Rejected
69 views
0 comments
0 upvotes
Companies with similar interview experiences
Software Engineer
3 rounds | 7 problems
Interviewed by Optum
Selected 8089 views
1 comments
0 upvotes
Software Engineer
5 rounds | 5 problems
Interviewed by Microsoft
Selected 10394 views
1 comments
0 upvotes
Software Engineer
2 rounds | 4 problems
Interviewed by Amazon
Selected 4595 views
1 comments
0 upvotes