LTIMindtree: Graduate Engineer Trainee
LTIMindtree's fresher process is described as an online aptitude test, a coding section, a technical interview and an HR interview. Sources disagree on counts (roughly 107 to 112 questions and 130 minutes in different accounts), and some report AI-assisted coding screens and a premium track for stronger profiles. Confirm the exact format in your invite.
41 questions · 4 rounds · updated Nov 2026
How the interview works
- Online aptitude test: Reported: AMCAT-style verbal, quantitative and logical sections.
- Coding test: Reported as mandatory in at least one account; one to three problems.
- Technical interview: Project, OOP, SQL, OS and basic AI or cloud.
- HR interview: Communication, relocation and fit.
Sample questions
- 01
Walk me through the project on your resume you are most proud of.
MediumProject
Model answer
What the interviewer checks
Depth and ownership. Expect five or six follow-up "why" questions: why that database, what broke, what you would change at ten times the scale.
How to answer
Use this order and keep the first pass to two minutes: 1. Problem and user: "Students missed placement deadlines because updates were spread across WhatsApp groups." 2. What you built and your part: "A web app where the placement cell posts drives and students get reminders. I built the backend in Spring Boot and designed the MySQL schema." 3. One hard technical decision: "Reminders had to go out at exact times for 1,200 students. A cron job polling every minute duplicated messages when the job overran, so I moved to a queue with a unique key per student and drive, which made sending idempotent." 4. Result with a number: "400 active users; missed deadlines reported by the cell fell from about 30 a semester to 4." 5. What you would do differently: "Add tests earlier: a timezone bug reached production because we had none." Prepare answers for: the architecture diagram, the database tables, the hardest bug, how you tested it, how it would handle 100 times the users, and what each teammate did.
Common mistakes
- Describing only features, not decisions.
- Not knowing parts of a group project you list as yours.
- No numbers anywhere.
- 02
In an election between two candidates, the winner got 58% of the valid votes and won by 1,440 votes. How many valid votes were cast?
MediumPercentages
- 03
Find the second largest distinct number in an array without sorting. Return -1 if it doesn't exist. Example: [12, 35, 1, 10, 34, 1] → 34; [7, 7, 7] → -1
EasyArrays
Approach and solution
Approach
One pass with two variables. If a number beats the largest, the old largest becomes second. Otherwise, if it's strictly between them, it becomes second. Skipping equal values handles duplicates.
def second_largest(a): first = second = None for x in a: if first is None or x > first: first, second = x, first elif x != first and (second is None or x > second): second = x return -1 if second is None else second assert second_largest([12, 35, 1, 10, 34, 1]) == 34 assert second_largest([7, 7, 7]) == -1 assert second_largest([5, 9]) == 5Complexity: O(n) time, O(1) space.
38 more questions, members only
- Aptitude test19
- Coding test5
- Technical interview11
- HR interview6
Members also get how to answer each question and a preparation plan for this company.
See plans from ₹399Every question and answer is written by Hirecept and the code is run before it is published. How a company runs its process comes from candidate reports and public pages, and companies change it, so treat that part as a guide, not a promise.