IT Services

Graduate Engineer Trainee (GET)

AMCAT-based online assessment (Aptitude, English, Programming MCQs, Computer Science, Spoken English) + Interviews

LTIMindtree Interview Questions & Placement Prep (2026)

Q: What is the LTIMindtree GET exam pattern in 2026?

An AMCAT-based online assessment with approximately 111 questions across six or seven sections — English Comprehension, Logical Ability, Basic Analytical Ability, Quantitative Ability, Computer Programming (25 Qs), Computer Science (20 Qs) and Spoken English — typically taking 110–130 minutes, followed by a technical interview and an HR/managerial interview.

Q: Is there a separate coding round at LTIMindtree?

Not always. LTIMindtree frequently tests programming through the large Computer Programming MCQ section, but some hiring drives add a separate coding test or coding-based interview, so prepare hands-on coding regardless.

Q: Which section carries the most weight?

Computer Programming (25 questions, 35 minutes) and Computer Science (20 questions, 20 minutes) together consume about 55 minutes and form the technical core of the assessment.

Q: Why does Spoken English matter if it's not a coding section?

It can eliminate otherwise technically strong candidates. Fluency, pronunciation and complete sentence responses are assessed and are treated as an important filter.

Q: How many minutes should the whole assessment take?

Public patterns report between approximately 110 and 130 minutes across six or seven sections; treat any range as a planning guide and follow your official assessment invitation for the exact structure.

Q: What should I prioritise for the technical interview?

Master your project architecture and individual contribution, and be fluent in one programming language rather than superficially listing many technologies. Also revise DBMS joins, ACID properties, process vs thread, deadlock and TCP vs UDP.

LTIMindtree's Graduate Engineer Trainee (GET) hiring uses a broad AMCAT-based online assessment spanning aptitude, English comprehension, a large Computer Programming MCQ section, core computer science and a spoken-English module, followed by a technical interview and an HR/managerial interview. Because public patterns vary between 110, 120 and 130 minutes with six or seven sections, always confirm the exact structure from your official assessment invitation. This guide covers the full syllabus, previous-year-style questions, formulas, coding templates and a week-by-week plan.

Approximately 111 questions across 6–7 sections in ~110–130 minutes, covering English comprehension, logical ability, basic analytical ability, quantitative ability, computer programming (25 Qs), computer science (20 Qs) and spoken English

Last updated: 12 August 2026

Exam Pattern

Section	Questions	Time	Type	Difficulty
English Comprehension	12	15 min	MCQ	Easy–Medium
Logical Ability	12	15 min	MCQ	Medium
Basic Analytical Ability	10	10 min	MCQ	Medium
Quantitative Ability	12	15 min	MCQ	Medium
Computer Programming	25	35 min	MCQ	Medium–Hard
Computer Science	20	20 min	MCQ	Medium
Spoken English	~20 / multiple modules	20 min	AI speaking & listening	Elimination

Section-Wise Syllabus

Everything that appears in the assessment, grouped by section.

1. Round 1 — Online Assessment (~111 Qs / ~130 min, AMCAT-based)

English Comprehension (12 Qs)

• Reading comprehension
• Main idea, tone and inference
• Vocabulary in context
• Sentence completion
• Para jumbles
• Error spotting

Logical Ability (12 Qs)

• Number & letter series
• Coding-decoding
• Analogy & classification
• Blood relations
• Direction sense
• Seating arrangement
• Syllogisms
• Data sufficiency

Basic Analytical Ability (10 Qs)

• Data interpretation with tables/charts
• Caselets
• Constraint-based arrangements
• Scheduling & selection
• Set-based problems
• Missing-data questions

Quantitative Ability (12 Qs)

• Number system, HCF & LCM
• Percentages, profit/loss/discount
• SI/CI
• Time & work, pipes & cisterns
• Time, speed & distance
• Probability & permutation-combination

Computer Programming (25 Qs, 35 min)

• Variables, operators, conditionals, loops
• Functions, arrays, strings
• Pointers, recursion
• Sorting, searching, complexity
• Output prediction
• C, C++, Java, Python fundamentals

Computer Science (20 Qs, 20 min)

• Data structures & algorithms
• OOP
• DBMS
• Operating systems
• Computer networks

Spoken English (20 min)

• Read aloud
• Listen and repeat
• Sentence arrangement
• Grammar & vocabulary
• Listening comprehension
• Speaking response

2. Recruitment Process

Stages

• Application and eligibility screening
• Pre-placement talk or company briefing
• Online assessment
• Spoken-English or communication assessment
• Technical interview
• HR or managerial interview
• Document verification and joining formalities

3. Computer Programming — Output Prediction Areas

Common traps

• Pre-increment vs post-increment
• Integer division and modulus
• Nested loops and scope of variables
• Function calls and recursion
• Array indexing
• Operator precedence
• Pass-by-value vs pass-by-reference
• Static variables
• Pointer arithmetic

4. Computer Science Core Subjects

Data Structures & Algorithms

• Arrays, strings, linked lists
• Stacks, queues, hash tables
• Trees, BSTs, heaps, graphs
• Searching, sorting, recursion
• Greedy algorithms, dynamic programming
• BFS and DFS
• Time and space complexity

OOP

• Class & object
• Encapsulation & abstraction
• Inheritance & polymorphism
• Constructors/destructors
• Function overloading & overriding
• Virtual functions
• Access modifiers, static members
• Abstract classes & interfaces

DBMS

• Keys, functional dependency
• Normalisation
• SQL joins, aggregate functions
• GROUP BY / HAVING
• Subqueries, indexing
• Transactions, ACID, serialisability
• Deadlocks, views, stored procedures

Operating Systems

• Process & thread, context switching
• Scheduling algorithms
• Synchronisation, mutexes & semaphores
• Deadlock
• Paging, segmentation, virtual memory
• Page replacement, file systems
• User mode vs kernel mode

Computer Networks

• OSI & TCP/IP model
• TCP vs UDP
• IP addressing, DNS, DHCP, ARP
• HTTP/HTTPS, routing
• Three-way handshake
• Congestion control, basic network security

Most Asked Topics

Highest-frequency areas across recent test papers.

Computer Programming output tracing

25 questions in 35 minutes — the single highest-value section; pre/post increment, integer division and nested loop tracing dominate.

Computer Science fundamentals

20 questions covering DSA, OOP, DBMS, OS and networks together consume ~55 minutes with programming — the technical core of the exam.

Quantitative core

Percentages, time-work, speed-distance and permutation-combination repeat across drives.

Basic analytical ability

Puzzle-oriented data interpretation, caselets and constraint-based arrangements distinct from ordinary logical reasoning.

DSA recognition patterns

Hashing/two pointers, Kadane's algorithm, sliding window, binary search, BFS/DFS, topological sort and DP show up as MCQ wording cues.

DBMS joins & normalisation

INNER JOIN behaviour and Second Normal Form are asked repeatedly in both MCQs and interviews.

Spoken English

Can eliminate technically strong candidates; fluency, pronunciation and complete sentences matter.

Project + language depth

Interviewers focus on your project architecture, individual contribution and the one language you claim to know best.

Free Resources

Curated practice links per section.

Aptitude & Reasoning

Computer Programming & CS

Coding practice

Spoken English

Interview experiences

50+ DSA Practice Problems

Solve in order — arrays and strings first, then sorting and recursion.

Easy — must-solve (14)

Reverse a number
Check palindrome
Check prime
Armstrong number
Factorial and Fibonacci
GCD and LCM
Sum of digits
Count vowels
Find maximum and minimum
Find second-largest distinct element
Reverse a string
Count character frequency
Remove duplicate characters
Rotate an array

Medium — must-solve (14)

Two-sum
Maximum subarray sum
Longest substring without repetition
Merge intervals
Valid parentheses
Binary search
First and last occurrence in sorted array
Linked-list reversal
Cycle detection in a linked list
Level-order tree traversal
Number of islands
Coin change
Longest increasing subsequence
Subarray sum equal to K

DSA recognition sheet (10)

Pair with target sum → hashing or two pointers
Maximum contiguous sum → Kadane's algorithm
Longest substring condition → sliding window
Search in sorted data → binary search
Balanced symbols → stack
Shortest unweighted path → BFS
Connected components → DFS/BFS
Dependencies → topological sort
Choose or reject elements → dynamic programming
Repeated range sum → prefix sum

Core templates to memorise (4)

Frequency counting with a hash map
Prefix sum array construction
Maximum subarray (Kadane's) template
BFS with a distance array

Previous Year Questions & Patterns

Repeat coding questions with the expected approach.

English PYQs

Choose the correct sentence: 'Neither of the candidates is ready' is correct
Choose the closest meaning of 'prudent' → Wise and careful
Arrange logically: Requirements analysed → code written → code tested → application deployed
In a reading passage, the author gives an example mainly to → Support or explain the central argument

Logical & analytical PYQs

Find the next number: 3, 8, 15, 24, 35, ? → 48
A person walks 5 km north, turns right and walks 3 km, then turns right and walks 5 km. Where from start? → 3 km east
If CODE is coded as DPEF, how is JAVA coded? → KBWB
All developers are programmers. Some programmers are testers. Can we conclude some developers are testers? → No, it does not necessarily follow

Quantitative PYQs

A train 180 m long crosses a pole in 9 seconds. Find its speed → 72 km/h
An article is marked 30% above cost and sold at a 10% discount. Find the profit % → 17%
A and B complete a job in 12 and 18 days. Find their combined time → 7.2 days
Average of five numbers is 28; removing one number makes the average 25. Find the removed number → 40
Distinct arrangements of the word LEVEL → 30
Bag has 5 red and 3 blue balls; probability both drawn (without replacement) are red → 5/14

Computer Programming PYQs

int x=3; for(i=1;i<=3;i++) x*=i; cout<<x; → Output: 18
int a=5; cout<<a++<<' '<<++a; → Output: 5 7
Nested loop for(i=0;i<n;i++) for(j=i;j<n;j++) cout<<i+j; complexity → O(n²)
Which data structure is used to implement recursion? → Stack
Which sorting algorithm has average complexity O(n log n)? → Merge sort or average-case quicksort

Computer Science PYQs

Which normal form removes partial dependency? → Second Normal Form
Which protocol is connection-oriented? → TCP
Difference between a process and a thread? → A process has its own address space; threads share it
What is a deadlock? → Processes waiting indefinitely for resources held by one another
What is polymorphism? → Same interface exhibiting different behaviour depending on the object
What does an SQL INNER JOIN return? → Rows with matching values in both tables

20+ SQL Query Bank

Write these out by hand — joins and subqueries are asked in both the test and the interview.

Basics & aggregation

Filter and sort

SELECT name, department
FROM employees
WHERE salary > 50000
ORDER BY salary DESC;

Aggregates

SELECT COUNT(*) AS total,
       AVG(salary) AS avg_salary,
       MAX(salary) AS max_salary
FROM employees;

GROUP BY with HAVING

SELECT department, AVG(salary) AS avg_salary
FROM employees
GROUP BY department
HAVING AVG(salary) > 60000;

Joins

INNER JOIN

SELECT e.name, d.department_name
FROM employees e
INNER JOIN departments d
  ON e.dept_id = d.dept_id;

LEFT JOIN

SELECT e.name, d.department_name
FROM employees e
LEFT JOIN departments d
  ON e.dept_id = d.dept_id;

SELF JOIN — employee and manager

SELECT e1.name AS employee, e2.name AS manager
FROM employees e1
JOIN employees e2
  ON e1.manager_id = e2.emp_id;

Subqueries

Second-highest salary

SELECT MAX(salary) AS second_highest
FROM employees
WHERE salary < (SELECT MAX(salary) FROM employees);

Employees above the overall average

SELECT name, salary
FROM employees
WHERE salary > (SELECT AVG(salary) FROM employees);

DBMS & Core Interview Q&A

Short answers you should be able to say out loud.

What does an SQL INNER JOIN return?

Only the rows that have matching values in both joined tables.

Which normal form removes partial dependency?

Second Normal Form (2NF).

What is a deadlock?

A state in which two or more processes wait indefinitely for resources held by one another.

Process vs thread?

A process has its own address space; threads within a process share its address space and resources.

What are ACID properties?

Atomicity, Consistency, Isolation and Durability — the guarantees of a reliable database transaction.

What is indexing?

A structure that speeds up data retrieval at the cost of extra storage and slower writes.

What is a stored procedure?

A precompiled set of SQL statements stored in the database and invoked by name, improving reuse and performance.

What is serialisability?

A guarantee that concurrent transaction execution produces the same result as some serial order of those transactions.

OOPs Concepts + 10 Code Snippets

Theory plus the exact snippets asked in the technical round.

Encapsulation

Bundle data and methods together and restrict direct access to internal state.

Abstraction

Expose only essential features through interfaces or abstract classes.

Inheritance

Derive a subclass from a superclass to reuse and extend behaviour.

Polymorphism

The same interface or operation exhibits different behaviour depending on the object or context.

Constructors & destructors

Constructors initialise objects; destructors release resources when objects go out of scope.

Function overloading vs overriding

Overloading varies the parameter list within a class; overriding redefines a parent method with the same signature in a subclass.

Virtual functions

Enable dynamic dispatch at runtime; essential for achieving polymorphism in C++.

Abstract classes vs interfaces

Abstract classes may include partial implementation; interfaces declare only method signatures.

1. Frequency counting (C++)

cpp

unordered_map<char, int> freq;
for (char c : s) freq[c]++;

2. Prefix sum (C++)

cpp

vector<long long> pref(n + 1);
for (int i = 0; i < n; i++)
    pref[i + 1] = pref[i] + a[i];

3. Maximum subarray — Kadane's algorithm (C++)

cpp

long long current = a[0], best = a[0];
for (int i = 1; i < n; i++) {
    current = max(1LL * a[i], current + a[i]);
    best = max(best, current);
}

4. BFS with distance array (C++)

cpp

queue<int> q;
vector<int> dist(n, -1);
q.push(source);
dist[source] = 0;
while (!q.empty()) {
    int u = q.front();
    q.pop();
    for (int v : graph[u]) {
        if (dist[v] == -1) {
            dist[v] = dist[u] + 1;
            q.push(v);
        }
    }
}

5. Two-sum with hashing (C++)

cpp

vector<int> twoSum(vector<int>& arr, int target) {
    unordered_map<int, int> seen;
    for (int i = 0; i < (int)arr.size(); i++) {
        int complement = target - arr[i];
        if (seen.count(complement)) return {seen[complement], i};
        seen[arr[i]] = i;
    }
    return {};
}

6. Reverse a linked list (C++)

cpp

struct Node { int val; Node* next; };

Node* reverseList(Node* head) {
    Node* prev = nullptr;
    while (head) {
        Node* next = head->next;
        head->next = prev;
        prev = head;
        head = next;
    }
    return prev;
}

7. Coin change — minimum coins (Python)

cpp

def min_coins(coins, amount):
    dp = [float('inf')] * (amount + 1)
    dp[0] = 0
    for i in range(1, amount + 1):
        for c in coins:
            if c <= i:
                dp[i] = min(dp[i], dp[i - c] + 1)
    return dp[amount] if dp[amount] != float('inf') else -1

8. OOP — encapsulation and polymorphism (Python)

cpp

class Shape:
    def area(self):
        raise NotImplementedError

class Circle(Shape):
    def __init__(self, r):
        self.__radius = r        # private

    def area(self):
        return 3.14159 * self.__radius ** 2

class Square(Shape):
    def __init__(self, side):
        self.__side = side

    def area(self):
        return self.__side ** 2

Operating System Basics

Scheduling, deadlock and memory management essentials.

Operating Systems

• Process versus thread, context switching costs.
• CPU scheduling algorithms.
• Synchronisation with mutexes and semaphores.
• Deadlock and its conditions.
• Paging, segmentation, virtual memory, page replacement.
• File systems and user mode versus kernel mode.

Computer Networks

• OSI model and TCP/IP model layers.
• TCP versus UDP.
• IP addressing, DNS, DHCP and ARP.
• HTTP/HTTPS, routing and the three-way handshake.
• Congestion control and basic network security.

Basic Analytical Ability

• More puzzle-oriented than ordinary reasoning — data interpretation with tables and charts.
• Caselets, constraint-based arrangements and scheduling problems.
• Selection, grouping and ranking questions.
• Pattern recognition and figure/visual analysis.
• Logical deduction and missing-data questions.

Spoken English preparation

• Read an English article aloud for 10 minutes daily and record your voice.
• Avoid speaking too quickly; use complete sentences.
• Practise describing a picture or situation for 45–60 seconds.
• Listen to English news or technical explanations regularly.
• Do not try to imitate a foreign accent.

4-Week Preparation Roadmap

From zero to test-ready in 28 days.

Week 1

Aptitude & Verbal Foundation

Percentages, ratios, averages
Grammar and vocabulary revision
10 RC passages

Goal: Build fluency in percentages, ratios, averages and core grammar/vocabulary.

Week 2

Aptitude & Reasoning Depth

Profit-loss, time-work, speed-distance
Number/letter series drills
Seating arrangements & syllogisms

Goal: Master profit-loss, time-work, speed-distance and series/arrangement reasoning patterns.

Week 3

Programming Basics

C/C++/Java/Python syntax revision
Loop and conditional output tracing
Arrays and strings coding

Goal: Trace any loop or conditional confidently and solve basic array/string problems.

Week 4

Core CS Subjects

OOP concepts with examples
DBMS normalisation and SQL joins
OS scheduling and deadlock
Networking OSI/TCP-UDP revision

Goal: Be interview-ready on OOP, DBMS, OS and networks with 20 MCQs solved daily.

Week 5

DSA, Coding & Communication

2 coding problems (1 easy + 1 medium)
Output tracing practice
10 minutes spoken English practice

Goal: Solve 30+ coding problems total and complete daily spoken-English practice.

Week 6

Full Mocks & Interview Prep

Full 120–130 minute timed mock
Mock technical interview on project + one language
Mock HR interview

Goal: Complete at least four full-length timed mocks and two mock interviews.

Exam Day Strategy

Score targets and time allocation.

Section targets

English Comprehension (12 Qs): 15 min — read questions before the passage.
Logical Ability (12 Qs): 15 min — solve series and coding-decoding first.
Basic Analytical Ability (10 Qs): 10 min — skip lengthy caselets on the first pass.
Quantitative Ability (12 Qs): 15 min — bank direct percentage/SI-CI questions first.
Computer Programming (25 Qs): 35 min — prioritise output-prediction questions, they are fast points.
Computer Science (20 Qs): 20 min — answer DBMS/OS/networking definition questions immediately.
Spoken English: 20 min — speak clearly, complete every module without restarting.

Coding time split (50 min)

Read the problem statement fully — ~2 min
Plan the approach using the DSA recognition sheet — ~5 min
Implement the solution — ~15–20 min
Test with edge cases (empty input, single element, duplicates) — ~5 min
If a separate coding round exists, prioritise correctness over optimisation first

Interview Process

What follows the online test.

Technical Interview

• Explain your project architecture and your individual contribution.
• Which programming language do you prefer, and why — be ready to write code in it.
• Difference between overloading and overriding; explain inheritance and polymorphism.
• Reverse a linked list; find the first non-repeating character.
• Explain indexing in DBMS; write a query using JOIN and GROUP BY.
• What are ACID properties; difference between process and thread; explain deadlock.
• TCP versus UDP; what happens when a URL is entered in a browser.

HR / Managerial Interview

• Tell me about yourself; why LTIMindtree?
• Are you willing to relocate?
• What are your strengths and weaknesses?
• How do you handle conflicting priorities in a team?
• Where do you see yourself in the next few years?

Mock Test Plan

Four simulations to run before the real test.

Mock 1 — Full Online Assessment

• ~111 MCQs across 6–7 sections in 110–130 minutes
• Target strong accuracy on Computer Programming and Computer Science first

Mock 2 — Programming MCQ Sprint

• 25 output-prediction/programming MCQs in 35 minutes
• Log every incorrect trace in an error notebook

Mock 3 — Computer Science Sprint

• 20 DSA/OOP/DBMS/OS/networking MCQs in 20 minutes
• Review any topic scoring below 70%

Mock 4 — Coding Practice Set

• 4 problems (2 easy, 2 medium) with a 60-minute timer
• Test against edge cases before submitting

Mock 5 — Spoken English + Interview Simulation

• 20-minute spoken English module recorded and reviewed
• Mock technical + HR interview covering project and language depth

Final Checklist

Tick all of these before test day.

Must-do: percentages, SI/CI, time-work, speed-distance formulas memorised

Must-do: 25+ programming output-prediction questions solved correctly under time

Must-do: OOP pillars, DBMS normalisation, OS scheduling and TCP/UDP concepts revised

Must-do: DSA recognition sheet — hashing, Kadane's, sliding window, BFS/DFS, DP — internalised

Must-do: daily spoken-English practice for fluency and pronunciation

Should-do: basic analytical ability puzzles and caselets practised separately from logical reasoning

Should-do: project architecture and individual contribution story prepared for the interview

Confirm: exact section count, timing and navigation rules from the official assessment invitation before the exam

Recent Interview Experiences

First-hand write-ups from students who actually sat the LTIMindtree process.

Be the first to share a LTIMindtree interview experience.

Frequently Asked Questions

What is the LTIMindtree GET exam pattern in 2026?

An AMCAT-based online assessment with approximately 111 questions across six or seven sections — English Comprehension, Logical Ability, Basic Analytical Ability, Quantitative Ability, Computer Programming (25 Qs), Computer Science (20 Qs) and Spoken English — typically taking 110–130 minutes, followed by a technical interview and an HR/managerial interview.

Is there a separate coding round at LTIMindtree?

Not always. LTIMindtree frequently tests programming through the large Computer Programming MCQ section, but some hiring drives add a separate coding test or coding-based interview, so prepare hands-on coding regardless.

Which section carries the most weight?

Computer Programming (25 questions, 35 minutes) and Computer Science (20 questions, 20 minutes) together consume about 55 minutes and form the technical core of the assessment.

Why does Spoken English matter if it's not a coding section?

It can eliminate otherwise technically strong candidates. Fluency, pronunciation and complete sentence responses are assessed and are treated as an important filter.

How many minutes should the whole assessment take?

Public patterns report between approximately 110 and 130 minutes across six or seven sections; treat any range as a planning guide and follow your official assessment invitation for the exact structure.

What should I prioritise for the technical interview?

Master your project architecture and individual contribution, and be fluent in one programming language rather than superficially listing many technologies. Also revise DBMS joins, ACID properties, process vs thread, deadlock and TCP vs UDP.

Want the full structured prep for LTIMindtree?

The Premium Vault covers Aptitude, Core CS, DSA, SQL and HR rounds with module-wise courses and drill sheets.

Explore Premium Vault LTIMindtree Company Sheet

Next steps chosen from the LTIMindtree pattern and other IT Services (Mass Hiring) recruiters.

Other IT Services (Mass Hiring) companies

Virtusa Interview Prep Guide

Virtusa exam pattern, syllabus and previous year questions · ₹3.5–7 LPA.

Cognizant Technology Solutions Interview Prep Guide

Cognizant Technology Solutions exam pattern, syllabus and previous year questions · ₹4–9 LPA.

Accenture Interview Prep Guide

Accenture exam pattern, syllabus and previous year questions · ₹4.5–11 LPA.

Core CS subjects for this pattern

DBMS & SQL Essentials

Normalisation, keys, transactions and the SQL queries asked in written rounds.

OOPs Essentials for Interviews

The four pillars with the exact code snippets interviewers ask you to explain.

Operating System Essentials

Processes, scheduling, deadlock and memory management in interview-ready form.

Recommended practice path

DSA 101 Practice Sheet

Beginner-friendly problem set that matches the LTIMindtree coding section.