๐Ÿ’ผ LTIMindtree Interview Experience (On-Campus) | Fresher | 2026

ltimindtree logo
ltimindtree
ยท Software Engineer
January 2, 2026 ยท 186 reads

Summary

I experienced the LTIMindtree on-campus hiring process for a fresher role, which included an online assessment, a technical interview focusing on DSA and SQL, and an HR interview. I was fortunate to be one of the 24 selected candidates out of 600 applicants.

Full Experience

๐Ÿ’ผ LTIMindtree Interview Experience (On-Campus)

I recently appeared for the LTIMindtree on-campus hiring process, and below is a detailed overview of my interview experience. The process consisted of three rounds, focusing on aptitude, technical skills, communication, and overall personality.


๐ŸŸข Round 0 โ€“ Registration

The hiring process started with registration through the college portal/POD platform. After completing the registration, shortlisted candidates were informed about the online assessment.


๐ŸŸก Round 1 โ€“ Online Assessment (3 Hours)

This was a 3-hour online test divided into three sections:

  1. Aptitude Section
    • Logical reasoning
    • Quantitative aptitude
    • Ages, relations, analytical questions
  2. Technical Section
    • Pseudocode & guess-the-output questions
    • OOPs concepts
    • Programming fundamentals in C++, Java, JavaScript
    • Basics of DBMS, Operating Systems, and Networking
  3. Voice Assessment
    • Sentence repetition
    • Story-based questions
    • Grammar check
    • Speaking on a random topic

This round tested both technical knowledge and communication clarity.


๐ŸŸ  Round 2 โ€“ Technical Interview

The results of the online assessment were declared after 10 days. I waited in the lobby for about 1 hour. The interviewer was calm and friendly.

Topics Discussed:

  • College background and favorite subjects
  • Interest in coding
  • I mentioned React and C++ as my preferred technologies

DSA & Problem Solving:

  • Removing duplicates from an array
  • Brute-force vs optimized approach
  • Time and space complexity
  • Time complexity of linear vs binary search
  • Detailed discussion on asymptotic notations

SQL (Most Challenging Part):

  • Asked to write a query that returns results in reverse order
  • Required strong understanding of subqueries and joins

๐Ÿ”ต Round 3 โ€“ HR Interview

The HR round was conducted the very next day. I waited around 30 minutes in the lobby.

HR Discussion Included:

  • Self-introduction
  • Why LTIMindtree
  • Strengths and weaknesses
  • Hardest problem faced
  • Favorite subject
  • Why software engineering over core branch
  • Views on AI
  • Any questions from my side

๐ŸŽ‰ Final Result

The final results were announced after 1 month. Out of 600 students, only 24 candidates were selected, and I was fortunate to be one of them.

Interview Questions (10)

1.

Remove Duplicates from Array

Data Structures & Algorithms

Given an array, remove duplicates from it. Discuss brute-force vs optimized approach and analyze time and space complexity. Also discuss time complexity of linear vs binary search and asymptotic notations.

2.

SQL Query: Reverse Order Results

Other

Write a SQL query that returns results in reverse order. This required a strong understanding of subqueries and joins.

3.

Self-introduction

Behavioral

Introduce yourself.

4.

Why LTIMindtree

Behavioral

Why are you interested in LTIMindtree?

5.

Strengths and Weaknesses

Behavioral

Discuss your strengths and weaknesses.

6.

Hardest Problem Faced

Behavioral

Describe the hardest problem you have faced.

7.

Favorite Subject

Behavioral

What is your favorite subject?

8.

Why Software Engineering Over Core Branch

Behavioral

Why did you choose software engineering over a core engineering branch?

9.

Views on AI

Behavioral

What are your views on AI?

10.

Any Questions from Your Side

Behavioral

Do you have any questions for the interviewer?

Preparation Tips

๐Ÿ“Œ Preparation Resources

Discussion (0)

Share your thoughts and ask questions

Join the Discussion

Sign in with Google to share your thoughts and ask questions

No comments yet

Be the first to share your thoughts and start the discussion!