Placement & training teams: 2026–27 campus calendars are being locked now. Request a proposal →

Recruiter guide · IT Services (Mass + Premium)

How LTIMindtree hires freshers.

3 rounds, 4.0-5.5 LPA, and exactly what each round tests. Built from public hiring data and reported interview questions.

Mass + Premium tierHiring in 2025-26Bengaluru · Pune · Mumbai · Chennai
See the 3 rounds
DifficultyEasy
Package, approx4.0-5.5 LPA
on a 0-60 LPA scale
Rounds3
resume to offer
Timeline1-4 weeks1-4 weeks test to offer
Evidence50+interview questions reported

Company snapshot

Who LTIMindtree hires, and how.

How LTIMindtree hiresHiring channels
  • On campus

    On-campus and off-campus mass drives

  • Referrals

    Some referral-based

Fresher hiring in 2025-26What the latest cycle looked like
  1. May 2026

    LTIMindtree resumed campus hiring in 2025 and is hiring approx 5,000 freshers this fiscal (FACE Prep, May 2026)

  2. 2026

    2026 AI-track fresher assessment

Tech stack
Java.NETPythonSAPclouddata
Offices in India
BengaluruPuneMumbaiChennai
Listed (NSE: LTIM)

Routes in

One way in. Here is how it runs.

Each route, the role and package it leads to, and its steps.

On-campus

Campus / off-campus Graduate Engineer Trainee

6.0-6.75 LPAGET-premium

Campus Aug-Feb

  1. 1Online assessment
  2. 2Technical interview
  3. 3HR interview
Official page ↗
CTC breakup, approxFixed base + allowancesSmall variableNo stocks

The hiring process

3 rounds, one hiring committee.

Every round in order: what happens, what was asked, and how to clear it.

1
Online AssessmentOnline · proctored · WeCP
Eliminates
Sections
Quant 12 Qs/15 minLogical 12 Qs/15 minEnglish comprehension 2-3Spoken English 20 Qs/20 minCS MCQ-1 (programming, OOP, DS)30CS MCQ-2 (OS, CN, DBMS, Web)30Problem solving 6-8
  • No negative marking
  • 2026 AI track adds coding evaluated by AI on readability/structure
  • Premium track has higher cut-offs
Quant; Logical reasoning; Spoken English; OOP; DS; OS; CN; DBMS; HTML/JS basics

Tip CS MCQ sections are the most important per candidates - revise OS/CN/DBMS one-liners

Asked in this round
  1. Which traversal of BST gives sorted order?
  2. OSI layer responsible for routing
  3. Output of Java code with static/instance variable
2
Technical InterviewVirtual · 20-30 min · Panel
Eliminates

Intro → resume projects → OOP/DBMS/OS questions → possibly one simple coding/SQL query

Projects; OOP; DBMS/SQL; OS; DSA basics

Tip Prepare a 2-minute project story with tech stack and your role

Asked in this round
  1. Explain polymorphism with an example
  2. What is normalization? Explain 1NF-3NF
  3. Write SQL to find employees earning more than their manager
3
HR InterviewVirtual · 5-15 min
Eliminates

Self-intro, strengths/weaknesses, why LTIMindtree, relocation and shifts, career goals

Communication; Flexibility

Tip Short, positive answers

Asked in this round
  1. Why LTIMindtree?
  2. Are you ready to relocate / work in shifts?
  3. Strengths and weaknesses

What gets tested

Where LTIMindtree spends its interview time.

Coding topics by shareShare of reported LTIMindtree DSA questions
  • Arrays & Hashing25%
  • Strings17%
  • Tries / Bit / Math17%
  • Dynamic Programming8%
  • Two Pointers & Sliding Window6%
  • Trees & BST5%
  • Greedy & Intervals5%
  • Stack & Queue4%
Focus areasHow often each area comes up
Asked a lot
OSDBMSOOP / Design PatternsSQLAptitude TestCommunication TestLanguage / SystemsProjects / ResumeBehavioral / HM
Sometimes
Computer Networks
Rarely
DSA depthLLD / Machine CodingHLD / System DesignPuzzles / Probability
What got students the offer
  • Treat the CS MCQ sections as the real filter
  • Premium track needs a strong, explainable AI/coding project
Why students were rejected

    How to prepare

    What to study, area by area.

    Coding and DSA
    • Easy programs
    • For AI track write clean, well-named, commented code
    Practise
    1. Count vowels in a string
    2. Reverse a string / palindrome
    3. Second largest element
    4. BST inorder traversal (LC 94)
    CS fundamentals
    • OOP, OS, CN, DBMS, basic web (HTML/CSS/JS) MCQ-level
    Practise
    1. Which BST traversal gives sorted order?
    2. OSI layer responsible for routing
    3. Java static vs instance variables
    4. Explain polymorphism
    Behavioural and language
    • Spoken English (Versant-like), aptitude speed

    Interview questions

    Questions LTIMindtree actually asked.

    From candidate reports, 2024-26. Filter by type.

    1. 01

      Which traversal of BST gives sorted order?

      DSA / CodingOnline Assessment
    2. 02

      Which normal form removes transitive dependency?

      DSA / CodingOnline Assessment
    3. 03

      Write a function to count vowels in a string (AI-graded for readability)

      DSA / CodingOnline Assessment
    4. 04

      OSI layer responsible for routing

      CS FundamentalsOnline Assessment
    5. 05

      Seating-arrangement puzzle

      Puzzle / ProbabilityOnline Assessment
    6. 06

      Output of Java code with static/instance variable

      Aptitude / MCQOnline Assessment
    7. 07

      Remove duplicates from an array (brute force vs optimized)

      HR / BehavioralRound 1 – Online...Source ↗
    8. 08

      Time complexity of linear vs binary search

      HR / BehavioralRound 1 – Online...Source ↗
    9. 09

      Hardest problem you faced

      HR / BehavioralRound 1 – Online...Source ↗
    10. 10

      Why software engineering over core branch

      HR / BehavioralRound 1 – Online...Source ↗
    11. 11

      Your views on AI

      HR / BehavioralRound 1 – Online...Source ↗
    12. 12

      Any questions for us

      HR / BehavioralRound 1 – Online...Source ↗
    13. 13

      Write a program to find the factorial of a given number

      DSA / CodingRound 2 – CodingSource ↗
    14. 14

      Check whether a number is prime and optimize it

      DSA / CodingRound 2 – CodingSource ↗
    15. 15

      Asymptotic notations

      DSA / CodingRound 2 – Technical...Source ↗
    16. 16

      React hooks

      DSA / CodingRound 2 – Technical...Source ↗
    17. 17

      Lifting state up

      DSA / CodingRound 2 – Technical...Source ↗
    18. 18

      React Fiber and reconciliation

      DSA / CodingRound 2 – Technical...Source ↗
    19. 19

      Write a query that returns results in reverse order

      SQLRound 2 – Technical...Source ↗
    20. 20

      Virtual DOM

      CS FundamentalsRound 2 – Technical...Source ↗
    21. 21

      Count vowels in a string

      DSA / CodingTechnical Interview
    22. 22

      Reverse a string / palindrome

      DSA / CodingTechnical Interview
    23. 23

      Second largest element

      DSA / CodingTechnical Interview
    24. 24

      BST inorder traversal (LC 94)

      DSA / CodingTechnical Interview
    25. 25

      Two Sum (LC 1)

      DSA / CodingTechnical Interview
    26. 26

      Factorial / prime numbers

      DSA / CodingTechnical Interview
    27. 27

      Which BST traversal gives sorted order?

      DSA / CodingTechnical Interview
    28. 28

      Employees earning more than their manager (self-join)

      DSA / CodingTechnical Interview
    29. 29

      Write SQL to find employees earning more than their manager

      SQLTechnical Interview
    30. 30

      Second highest salary

      SQLTechnical Interview
    31. 31

      GROUP BY with HAVING

      SQLTechnical Interview
    32. 32

      Explain polymorphism with an example

      CS FundamentalsTechnical Interview
    33. 33

      What is normalization? Explain 1NF-3NF

      CS FundamentalsTechnical Interview
    34. 34

      Difference between process and thread

      CS FundamentalsTechnical Interview
    35. 35

      Java static vs instance variables

      CS FundamentalsTechnical Interview
    36. 36

      Explain polymorphism

      CS FundamentalsTechnical Interview
    37. 37

      Normalization 1NF-3NF

      CS FundamentalsTechnical Interview
    38. 38

      Process vs thread

      CS FundamentalsTechnical Interview
    39. 39

      Reverse a linked list (verbal approach)

      Aptitude / MCQTechnical Interview
    40. 40

      Explain your project architecture

      Project / ResumeTechnical Interview
    41. 41

      Why LTIMindtree?

      HR / BehavioralHR Interview
    42. 42

      Are you ready to relocate / work in shifts?

      HR / BehavioralHR Interview
    43. 43

      Strengths and weaknesses

      HR / BehavioralHR Interview
    44. 44

      Where do you see yourself in 3 years?

      HR / BehavioralHR Interview
    45. 45

      Difference between primary key and foreign key

      DSA / CodingRound 3 – Technical...Source ↗
    46. 46

      Difference between DROP and TRUNCATE and when to use each

      DSA / CodingRound 3 – Technical...Source ↗
    47. 47

      Syntax for inserting a new row into an existing table

      DSA / CodingRound 3 – Technical...Source ↗
    48. 48

      Where do you live and nearest LTI office city

      CS FundamentalsRound 4 – HRSource ↗
    49. 49

      Introduce yourself

      HR / BehavioralRound 4 – HRSource ↗
    50. 50

      Will you relocate

      HR / BehavioralRound 4 – HRSource ↗
    51. 51

      What are your hobbies

      HR / BehavioralRound 4 – HRSource ↗
    52. 52

      Where do you see yourself in 10 years

      HR / BehavioralRound 4 – HRSource ↗
    53. 53

      Are you into entrepreneurship

      HR / BehavioralRound 4 – HRSource ↗
    54. 54

      OOP concepts

      CS FundamentalsRound 4 – Technical...Source ↗
    55. 55

      Java

      CS FundamentalsRound 4 – Technical...Source ↗
    56. 56

      JavaScript

      CS FundamentalsRound 4 – Technical...Source ↗
    57. 57

      Where do you see yourself in 5 years

      HR / BehavioralRound 5 – HRSource ↗

    Want these as a timed test for your batch?

    12-week preparation plan

    Twelve weeks to LTIMindtree-ready.

    12-15 h a week. Topics are ordered by how often LTIMindtree asks them; the bar shows each topic's share of LTIMindtree questions.

    W1 W2 W3W4 W5 W6W7 W8 W9W10W11W12
    1
    Weeks 1-3Foundations
    • W1
      Arrays & Hashing25%
    • W2
      Two Pointers & Sliding Window6%Strings17%
    • W3
      Binary Search3%Linked List3%
    2
    Weeks 4-6Core data structures
    • W4
      Stack & Queue4%Heaps1%
    • W5
      Trees & BST5%
    • W6
      Graphs3%
    3
    Weeks 7-9DP, Greedy & Backtracking
    • W7
      Dynamic Programming8%
    • W8
      Dynamic Programming8%Greedy & Intervals5%
    • W9
      Backtracking2%Tries / Bit / Math17%
    4
    Week 10Company weak-spots
    • W10
      Top-weighted patterns25%
    5
    Week 11LTIMindtree sprint
    • W11
      All DSA questions
    6
    Week 12Interview mode
    • W12
      Mock interviews
    Want the week-by-week plan with problem lists? We send it to placement teams with the LTIMindtree test.

    How Board Infinity helps

    Prepare your batch for LTIMindtree, round by round.

    Step 01LTIMindtree-pattern test

    Proctored, in the format of its rounds.

    Step 02Batch gap report

    Topic by topic, weighted to LTIMindtree.

    Step 03Preparation track

    Mapped to these rounds.

    Step 04Re-test before the drive

    See who is ready, by name.

    Free for colleges to start. One LTIMindtree sample test per student email.
    Next step

    Prepare your students for LTIMindtree.

    A named member of our academic team replies within one working day.

    1. 1Tell us what you need
    2. 2We run a pre-assessment
    3. 3You get a gap analysis
    4. 4Then your proposal

    Or write to connect@boardinfinity.com

    Sources for this pageSummarised in our own words from public sources. LTIMindtree is a trademark of its owner; Board Infinity is not affiliated with it. Confirm details on the official careers page.
    1. placementpreparation.io/ltimindtree/recruitment-process/
    2. faceprep.in/article/ltimindtree-ai-track-2026-fresher-assessment/
    3. leetcode.com/discuss/interview-experience/7459349/
    4. geeksforgeeks.org/?p=1033555
    5. geeksforgeeks.org/?p=1047224
    Placement Intelligence

    Request a proposal

    Recruiter tests Request a proposal