I applied online. I interviewed at Infosys (Pune) in Jul 2018
Interview
The interview process consisted of 3 rounds. The first round was a all India coding round(consisting 3 questions), the second round was also a coding round(3 questions) and the final round was a face to face interview consisting of 2 rounds(1 technical + 1 HR).
Interview questions [4]
Question 1
The first few questions were regarding my project which I had mentioned in my resume?
I applied through other source. The process took 1 week. I interviewed at Infosys (Hyderabad) in Feb 2017
Interview
One coding test consisting of 3 questions. Easy, medium, Hard.
First two questions will test your logical skills
Last one is based on an algorithm.
You have to complete at least two questions with 100% test passed
Interview round.
I applied through college or university. The process took 2 days. I interviewed at Infosys (Bengaluru) in Oct 2017
Interview
1.First round(1:30 hrs) is online coding on Hackerrank platform with two coding questions.
2.Second round is technical interview(1:45 hrs) with question based on your preferred programming language and projects you have worked upon. And I was asked to solve three coding questions one related to prim's minimum spanning tree Algorithm , another was related to hashing and compression and other was design and implement type.
3.HR round just usual questions.
Interview questions [1]
Question 1
Interviewer: seeing my resume, so you are good at coding!!
Me: yeah!:)
Interviewer: took a question booklet and asked to write code for it in 30 min
Question read: You are given a subset-M of tourist places among N-places in a city along with how these places are connected with distance between them. Now you being a traveller, task is to reduce the total distance travelled to cover all places in M and print minimum total distance.
Me: :-! Started implementing basic class with adjacency matrix and thinking about djikistra!!?? TSP?? answer was no!! And it suddenly flashed me how about minimum spanning tree and then I used prim's concept to write a function for it.:-/
Interviewer: ( without checking code :( ) what's minimum spanning tree??