Infosys interview experience Real time questions & tips from candidates to crack your interview
Specialist Programmer
Infosys
2 rounds | 2 Coding
problems
Selected Interview preparation journey
Preparation
Duration: 2 months
Topics: Data structures, Arrays, DBMS, SQL and Python.
Tip 1 : Know completely about the projects you have worked, Deep dive into those technologies that being used in your projects.
Tip 2 : When you are doubtful to answer any particular question, ask the interviewer a couple of minutes to think. Better to use pen and paper to note down technical questions.
Tip 3 : Don't get nervous while answering the questions, concentrate and look at your cam if the interview is going virtually. If you have no idea about the question! Say it genuinely that you don't remember and have to revise.
Application process
Where: Other
Eligibility: No
Tip 1 : Make it in single sheet if possible. Don't add the skills you aren't aware off. Make sure you add your projects that you are completely aware. There are chances that interviewer ask the projects you mentioned at the bottom first.
Tip 2 : Make sure you add key words related to the role you are applying. No one will personally check your resume to shortlist, mostly it will be done by AI, so keywords must and should.
Interview rounds
01
Round
Hard
Online Coding Test
Duration180 minutes
Interview date19 Mar 2022
Coding problem1
Coding round with 3 problems with different levels
1. Easy coding problem related to arrays,strings
2. Medium range coding related to Linked list, Stacks and Queues.
3. Complex coding related to Trees, Maps
1. Check If Given Words Are Present In A String
Hard
35m average time
60% success
0/120
Asked in companies
Given a string 'S' and a list 'wordList' that consists of 'N' distinct words. Let 'Wi' denote word at index 'i' in 'wordList'. For each word 'Wi' in 'wordList', you need to determine whether it is present in string 'S' or not. Return a boolean array, where a boolean value at index ‘i’ represents whether the word ‘Wi’ is present in the string ‘S’ or not.
Problem approach
I choose recursions to solve the problem.
I passed the string and empty list as my parameters. I check the first letter of the string with words in the array, if it was matched called the function again making the shallow copy of the list along with the matching words.
Like wise I was able to found the possibilities for the string in the array.
02
Round
Medium
Video Call
Duration45 minutes
Interview date11 May 2022
Coding problem1
Given a problem and asked me to solve, later questions related to project. That's it.
1. Word Break II
Hard
15m average time
85% success
0/120
Asked in companies
You are given a non-empty string S containing no spaces’ and a dictionary of non-empty strings (say the list of words). You are supposed to construct and return all possible sentences after adding spaces in the originally given string ‘S’, such that each word in a sentence exists in the given dictionary.
Note :
The same word in the dictionary can be used multiple times to make sentences.
Assume that the dictionary does not contain duplicate words.
Problem approach
As it was easy problem, I choose recursions to solve the problem.
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
Which SQL clause is used to specify the conditions in a query?
Choose another skill to practice
Similar interview experiences
Specialist Programmer
2 rounds | 6 problems
Interviewed by Infosys
Selected 
2813 views
0 comments
0 upvotes
Specialist Programmer
2 rounds | 4 problems
Interviewed by Infosys
Selected 1121 views
0 comments
0 upvotes
Specialist Programmer
2 rounds | 2 problems
Interviewed by Infosys
Selected 906 views
0 comments
0 upvotes
Specialist Programmer
3 rounds | 8 problems
Interviewed by Infosys
Selected 1091 views
0 comments
0 upvotes