Microsoft SDE Intern Interview Experience
💼 LTIMindtree Interview Experience (On-Campus) | Fresher | 2026
Salesforce SMTS | Interview Experience | Rejected
JPMC | SDE2 (Associate) - Java Backend - Interview Experience + Compensation
Microsoft - SDE2 - Coding Round
My Infosys Specialist Programmer Interview Experience – March 2025
Summary
I had an engaging interview experience for the Specialist Programmer role at Infosys, Noida, which included two coding assessments and a detailed technical discussion covering AI, Java fundamentals, project work, and a specific coding task, leaving me with positive final thoughts.
Full Experience
Step 1: Online Coding Test – 3 Hours
My journey began with an online coding assessment featuring three DSA problems of increasing difficulty. The problems covered areas like Queue + Greedy, DP + GCD, and DP + HashMap + Prime Factorization.
Step 2: The Technical Interview – With a Live Coding Twist!
Unlike previous years, this time, the process included a live online coding assessment conducted at the Infosys Noida campus, directly in front of the interviewer. I was given 40 minutes to choose and implement one solution out of two coding problems presented (one involving DP/BFS and another on Binary Trees). Following this assessment, my interview commenced immediately.
Interview Breakdown:
- Self-Introduction & PPT Presentation: The interviewer started by asking me to introduce myself and present my prepared PowerPoint presentation.
- AI Specialization Discussion: Given my specialization, the interviewer was curious about why I chose AI, how I've utilized AI technology in my projects, and my understanding of core AI concepts with real-world applications.
- Java Deep Dive: Since Java is my primary programming language, the discussion naturally progressed to OOPs concepts with real-world examples (I used a Banking System analogy), Interfaces in Java, Call by Value/Call by Reference, Memory Management, and a specific question about why Java doesn’t support Multiple Inheritance.
- Internship & Projects Discussion: I engaged in an in-depth discussion about the projects I worked on during my internships and the technologies I used. Interestingly, for my personal projects, the interviewer was primarily interested in the problem statement and its real-world impact, rather than deep technical details.
- Coding Discussion: This part focused on my problem-solving approach. I explained my solution and its time/space complexity for the problem I solved in the pre-interview assessment. I was also asked to write a recursive Fibonacci function and analyze its time and space complexity.
- My Turn to Ask: I took the opportunity to inquire about technologies I should focus on before potentially joining, and the interviewer provided insights into current industry trends.
Overall, the interview process was structured, engaging, and highly insightful. The interviewer fostered a discussion-like atmosphere, which I appreciated. I am very grateful to Infosys for this opportunity!
Interview Questions (13)
I was asked to introduce myself and present my prepared PowerPoint presentation.
The interviewer asked why I chose AI as my specialization.
I was asked how I have used AI technology in my projects.
The discussion involved core AI concepts and their real-world applications.
Since I mentioned Java as my primary language, I was asked about OOPs concepts with real-world examples. I used a Banking System analogy for my explanation.
The interviewer asked about Interfaces in Java.
I was questioned about Call by Value and Call by Reference in Java.
The interviewer asked about Memory Management in Java.
A specific question was posed: Why doesn’t Java support Multiple Inheritance?
I was asked in-depth questions about the projects I worked on during my internships.
The interviewer inquired about the technologies I used during my internships.
I was asked to explain my approach to the problem I solved in the pre-interview assessment, including discussing its time and space complexity.
I had to write a recursive Fibonacci function and then analyze its time and space complexity.