Good easy to follow everything
order (most current experience first). Describe your responsibilities in concise statements led by strong verbs. Focus on those skills and strengths that you possess and that you have identified as being important to your field. Try to incorporate industry-specific
I applied online. The process took 2 months. I interviewed at Infosys (Madurai) in Jun 2024
Interview
. Online Assessment (Written Test)
Conducted via Infosys' own platform or through partners like HackerRank, AMCAT, or SHL.
Sections:
Logical Reasoning (15–20 questions)
Quantitative Aptitude (10–15 questions)
Verbal Ability (20–25 questions)
Pseudo Code or Programming (for technical roles)
Automated Coding (2 problems) – only for Specialist roles
Duration: ~100 minutes (varies by role)
---
2. Technical Interview
Focus Areas:
Programming concepts (C, C++, Java, Python)
DSA (basic) – arrays, strings, sorting, recursion
SQL queries and DBMS basics
OOPs Concepts
Project discussion – explain your project(s) well
For AI/ML: ML algorithms, Python, Numpy, Pandas, Mini-projects
---
3. HR Interview
Topics:
Tell me about yourself
Why Infosys?
Strengths/Weaknesses
Relocation/Work from office/Notice period
Basic behavioral questions
Very simple and often just a formality if you’ve cleared the technical round.
Interview questions [1]
Question 1
Tell me about yourself."
This is almost always the first question in both the Technical and HR rounds. It sets the tone for the rest of your interview.
I applied through college or university. The process took 4 weeks. I interviewed at Infosys in Oct 2022
Interview
The OA before interview was quite tough and was unfair keeping in mind the package company was offering.
The interviewer came 30-40 mins late and was uninterested in taking interview. He asked some DSA questions
Interview questions [1]
Question 1
In the interview, I was asked to explain and implement Merge Sort. I briefly walked them through the divide-and-conquer approach, where the array is recursively divided into halves, sorted individually, and then merged. I discussed its consistent time complexity of O(n log n), its stable nature, and the trade-off of additional space usage. They seemed interested in how I approached edge cases and recursion handling.