Ltimindtree Placement Papers 2026

Last Updated: March 2026

🎯 Company Overview

LTIMindtree is one of the world's leading global technology consulting and digital solutions companies, formed in 2022 through the merger of Larsen & Toubro Infotech (LTI) and Mindtree. Headquartered in Mumbai, India, LTIMindtree combines LTI's scale and Mindtree's agility to deliver comprehensive IT services across 30+ countries.

With a workforce exceeding 80,000 professionals, LTIMindtree serves Fortune 500 clients in banking, insurance, manufacturing, retail, and healthcare sectors. The company specializes in digital transformation, cloud services, data analytics, AI/ML solutions, and enterprise application development.

💼 Eligibility Criteria (Freshers 2026)

Parameter	Requirement
Education	B.Tech/B.E. (CS/IT/ECE/EEE/E&I/Instrumentation) or MCA
Academic Score	65% or CGPA 6.5+ throughout (10th, 12th, Graduation)
Backlogs	No active backlogs
Graduation Year	2026 batch
Gap Allowed	Maximum 1 year with valid reason

💰 CTC for Freshers 2026

LTIMindtree offers competitive packages based on performance bands:

Package Category	CTC	Monthly In-Hand
Standard	₹4.5 - 5.5 LPA	₹32,000 - ₹40,000
Digital/Elevate	₹6.5 - 8.5 LPA	₹48,000 - ₹62,000
Specialist	₹9.0 - 11.0 LPA	₹65,000 - ₹80,000

---

📋 Exam Pattern

LTIMindtree follows a rigorous multi-stage selection process:

Stage 1: Online Assessment (Cocubes/Aspiring Minds Platform)

Section	Questions	Duration	Difficulty
English Comprehension	15	15 min	Medium
Quantitative Aptitude	15	20 min	Medium-Hard
Logical Reasoning	15	20 min	Medium
Technical Aptitude	20	20 min	Medium
Coding Challenge	2-3	45 min	Medium-Hard
Essay Writing	1	15 min	-
Total	~69	135 min	-

Stage 2: Technical Interview Round 1 (30-40 min)

• Programming concepts
• Project deep dive
• Problem-solving approach
• Basic DSA questions

Stage 3: Technical Interview Round 2 (20-30 min)

• Advanced technical questions
• Code review/writing
• System design basics

Stage 4: HR Interview (15-20 min)

• Behavioral assessment
• Cultural fit
• Salary discussion

Important Notes

• Negative Marking: None
• Sectional Cutoff: Yes (60-70% per section)
• Overall Cutoff: 65-70%
• Proctoring: Camera and microphone monitoring enabled

---

🧮 Aptitude Questions with Solutions (15 Questions)

Question 1

The average weight of 8 persons increases by 2.5 kg when a new person comes in place of one of them weighing 65 kg. What is the weight of the new person?

Solution: Total weight increase = 8 × 2.5 = 20 kg

Weight of new person = 65 + 20 = 85 kg

---

Question 2

A train running at 54 km/hr crosses a platform in 30 seconds. If the length of the train is 200m, find the length of the platform.

Solution: Speed = 54 × (5/18) = 15 m/s

Total distance covered = Speed × Time = 15 × 30 = 450m

Length of platform = 450 - 200 = 250m

---

Question 3

If the ratio of ages of A and B is 3:4, and the sum of their ages is 63 years, find the age of B after 5 years.

Solution: Let ages be 3x and 4x.

3x + 4x = 63 7x = 63 x = 9

B's present age = 4x = 36 B's age after 5 years = 36 + 5 = 41 years

---

Question 4

A shopkeeper sells an article at a loss of 10%. If he had sold it for ₹120 more, he would have gained 10%. Find the cost price.

Solution: Let CP = x SP at 10% loss = 0.9x SP at 10% profit = 1.1x

Difference: 1.1x - 0.9x = 120 0.2x = 120 x = ₹600

Shortcut: Difference % = 20% = ₹120, so 100% = ₹600

---

Question 5

A can do a piece of work in 20 days and B can do it in 30 days. They work together for 5 days, then A leaves. How many more days will B take to complete the remaining work?

Solution: A's 1 day work = 1/20 B's 1 day work = 1/30

(A+B)'s 1 day work = 1/20 + 1/30 = 5/60 = 1/12

Work done in 5 days = 5 × (1/12) = 5/12

Remaining work = 1 - 5/12 = 7/12

B's time to complete = (7/12) / (1/30) = (7/12) × 30 = 17.5 days

---

Question 6

Find the remainder when 3^50 is divided by 8.

Solution: Pattern of 3^n mod 8: 3^1 = 3 (mod 8 = 3) 3^2 = 9 (mod 8 = 1) 3^3 = 27 (mod 8 = 3) 3^4 = 81 (mod 8 = 1)

Pattern: 3, 1, 3, 1... (period 2)

50 is even, so remainder = 1

---

Question 7

The sum of three numbers is 98. If the ratio of the first to second is 2:3 and that of second to third is 5:8, find the second number.

Solution: First:Second = 2:3 = 10:15 Second:Third = 5:8 = 15:24

Combined: 10:15:24

Sum of ratios = 10 + 15 + 24 = 49

Second number = (15/49) × 98 = 30

---

Question 8

A mixture of 60 liters has milk and water in the ratio 2:1. How much water must be added to make the ratio 1:2?

Solution: Milk in mixture = (2/3) × 60 = 40 liters Water = 20 liters

Let x liters of water be added.

40 / (20 + x) = 1/2 80 = 20 + x x = 60 liters

---

Question 9

The difference between compound interest and simple interest on a sum for 2 years at 10% per annum is ₹50. Find the principal.

Solution: CI - SI = P(R/100)² 50 = P × (10/100)² 50 = P × 0.01 P = ₹5000

---

Question 10

How many 3-digit even numbers can be formed using digits 1, 2, 3, 4, 5 without repetition?

Solution: For even numbers, last digit must be 2 or 4 (2 choices)

First digit: 4 remaining choices (can't be 0, one used) Second digit: 3 remaining choices Third digit: 2 choices (even)

Total = 4 × 3 × 2 = 24

---

Question 11

A and B invest in a business in the ratio 3:5. If 10% of the total profit goes to charity and A's share is ₹2700, find the total profit.

Solution: Let total profit = P Profit after charity = 0.9P

A's share = (3/8) × 0.9P = 2700 0.9P = 2700 × 8/3 = 7200 P = 7200 / 0.9 = ₹8000

---

Question 12

Find the least number which when divided by 12, 15, 18, and 27 leaves remainder 4 in each case.

Solution: LCM(12, 15, 18, 27): 12 = 2² × 3 15 = 3 × 5 18 = 2 × 3² 27 = 3³

LCM = 2² × 3³ × 5 = 540

Required number = 540 + 4 = 544

---

Question 13

A boat can travel 18 km upstream in 3 hours and the same distance downstream in 2 hours. Find the speed of the stream.

Solution: Upstream speed = 18/3 = 6 km/hr = B - S Downstream speed = 18/2 = 9 km/hr = B + S

Subtracting: 2S = 3 S = 1.5 km/hr

---

Question 14

The HCF of two numbers is 13 and their LCM is 455. If one number is 65, find the other.

Solution: HCF × LCM = Product of numbers 13 × 455 = 65 × x x = (13 × 455) / 65 = 91

---

Question 15

A pipe can fill a tank in 6 hours. After half the tank is filled, three more similar pipes are opened. What is the total time taken to fill the tank completely?

Solution: Time to fill half tank = 3 hours

4 pipes together fill remaining half: Rate of 4 pipes = 4 × (1/6) = 4/6 = 2/3 per hour

Time to fill half = (1/2) / (2/3) = 3/4 hour = 45 minutes

Total time = 3 hours + 45 minutes = 3 hours 45 minutes

---

💻 Technical Questions with Solutions (10 Questions)

Question 1

What is the difference between ArrayList and LinkedList in Java?

ArrayList	LinkedList
Dynamic array implementation	Doubly-linked list implementation
Fast random access O(1)	Slow random access O(n)
Slow insert/delete at middle O(n)	Fast insert/delete O(1) at ends
Better for retrieval-heavy operations	Better for frequent modifications

---

Question 2

Explain ACID properties in DBMS.

• Atomicity: All operations in a transaction complete successfully or none do (all-or-nothing)
• Consistency: Database remains in consistent state before and after transaction
• Isolation: Concurrent transactions don't interfere with each other
• Durability: Committed transactions persist even after system failure

---

Question 3

What is the difference between REST and SOAP?

REST	SOAP
Architectural style	Protocol
Uses HTTP/HTTPS	Can use HTTP, SMTP, TCP
Lightweight, JSON/XML	Heavy, XML only
Faster	Slower due to parsing
Flexible	Strict standards

---

Question 4

Explain the difference between Abstract Class and Interface in Java.

Abstract Class	Interface
Can have constructors	No constructors
Can have concrete methods	Java 8+: default/static methods
Single inheritance	Multiple inheritance supported
Variables can be any type	Variables are public static final
Used for "is-a" relationship	Used for "can-do" relationship

---

Question 5

What is Dependency Injection?

• Constructor Injection: Dependencies via constructor
• Setter Injection: Dependencies via setter methods
• Field Injection: Dependencies via annotations

Benefits: Loose coupling, easier testing, better maintainability

---

Question 6

Explain the CAP Theorem.

• Consistency: All nodes see the same data simultaneously
• Availability: Every request receives a response
• Partition Tolerance: System continues despite message loss

Systems choose: CP (Consistency + Partition tolerance) or AP (Availability + Partition tolerance)

---

Question 7

What is the difference between HashMap and Hashtable?

HashMap	Hashtable
Not synchronized	Synchronized
Not thread-safe	Thread-safe
Allows one null key, many null values	No null keys or values
Faster	Slower due to synchronization
Iterator is fail-fast	Enumerator is not fail-fast

---

Question 8

Explain Normalization and its types.

• 1NF: Atomic values, no repeating groups
• 2NF: 1NF + no partial dependency (non-prime attributes depend on full candidate key)
• 3NF: 2NF + no transitive dependency
• BCNF: 3NF + for every dependency X→Y, X is a superkey

---

Question 9

What is the difference between Process and Thread?

Process	Thread
Independent execution unit	Lightweight sub-process
Separate address space	Shares address space
Heavy context switching	Light context switching
Inter-process communication complex	Direct memory sharing
One process can have multiple threads	Thread is part of a process

---

Question 10

Explain JWT (JSON Web Token) and its structure.

• Header: Algorithm and token type (Base64Url encoded)
• Payload: Claims/data (Base64Url encoded)
• Signature: HMACSHA256(base64Url(header) + "." + base64Url(payload), secret)

Used for authentication and information exchange

---

📝 Verbal/English Questions with Solutions (10 Questions)

Question 1

Choose the correct synonym for ELOQUENT:

a) Silent b) Inarticulate c) Fluent d) Quiet

Explanation: Eloquent means fluent or persuasive in speaking or writing.

---

Question 2

Choose the correct antonym for TRANSIENT:

a) Temporary b) Fleeting c) Permanent d) Brief

Explanation: Transient means lasting only for a short time; permanent means lasting forever.

---

Question 3

Fill in the blank: The team _______ working on the project since Monday.

a) is b) are c) has been d) have been

Explanation: "Since Monday" indicates present perfect continuous tense. "Team" as a unit takes singular verb.

---

Question 4

Error spotting: "Neither the manager nor the employees was informed about the change."

Explanation: With "neither...nor", verb agrees with nearest subject (employees = plural).

---

Question 5

Rearrange: P: digital transformation Q: essential R: has become S: for business survival

---

Question 6

Choose the correct preposition: She takes pride ______ her achievements.

a) in b) on c) at d) with

Explanation: "Pride in" is the correct collocation.

---

Question 7

One word substitution: One who hates mankind.

a) Philanthropist b) Misanthrope c) Optimist d) Pessimist

---

Question 8

Idiom meaning: "To add fuel to the fire"

a) To help someone b) To worsen a situation c) To start a fire d) To solve a problem

Explanation: To make a bad situation worse by saying or doing something.

---

Question 9

Active to Passive: "The company will launch the product next month."

---

Question 10

Reading Comprehension:

Passage about cloud computing adoption in enterprises...

Question: What is the author's primary argument?

a) Cloud computing is too expensive b) Cloud migration requires careful planning and security consideration c) On-premise solutions are always better d) Cloud computing is a passing trend

---

🚀 Coding Questions with Solutions (5 Questions)

Question 1: Armstrong Number

Problem: Check if a number is an Armstrong number (sum of cubes of digits equals the number).

Python Solution:

def is_armstrong(n):
    original = n
    result = 0
    num_digits = len(str(n))
    
    while n > 0:
        digit = n % 10
        result += digit ** num_digits
        n //= 10
    
    return result == original

# Alternative: For 3-digit numbers specifically
def is_armstrong_3digit(n):
    if n < 100 or n > 999:
        return False
    
    digit_sum = sum(int(d) ** 3 for d in str(n))
    return digit_sum == n

# Test
print(is_armstrong(153))   # True (1³ + 5³ + 3³ = 153)
print(is_armstrong(9474))  # True (4-digit)
print(is_armstrong(123))   # False

---

Question 2: Remove Duplicates from Sorted Array

Problem: Remove duplicates from a sorted array in-place and return the new length.

Python Solution:

def remove_duplicates(nums):
    if not nums:
        return 0
    
    # Two pointer approach
    write_index = 1
    
    for read_index in range(1, len(nums)):
        if nums[read_index] != nums[read_index - 1]:
            nums[write_index] = nums[read_index]
            write_index += 1
    
    return write_index

# Alternative: Using set (not in-place)
def remove_duplicates_set(nums):
    return len(set(nums))

# Test
arr = [1, 1, 2, 2, 3, 4, 4, 5]
new_length = remove_duplicates(arr)
print(new_length)  # 5
print(arr[:new_length])  # [1, 2, 3, 4, 5]

---

Question 3: Longest Common Prefix

Problem: Find the longest common prefix string amongst an array of strings.

Python Solution:

def longest_common_prefix(strs):
    if not strs:
        return ""
    
    # Start with first string as prefix
    prefix = strs[0]
    
    for string in strs[1:]:
        # Reduce prefix until it matches
        while not string.startswith(prefix):
            prefix = prefix[:-1]
            if not prefix:
                return ""
    
    return prefix

# Alternative: Character by character
def lcp_vertical(strs):
    if not strs:
        return ""
    
    for i, char in enumerate(strs[0]):
        for string in strs[1:]:
            if i >= len(string) or string[i] != char:
                return strs[0][:i]
    
    return strs[0]

# Test
print(longest_common_prefix(["flower", "flow", "flight"]))  # "fl"
print(lcp_vertical(["dog", "racecar", "car"]))  # ""

---

Question 4: Maximum Subarray Sum (Kadane's Algorithm)

Problem: Find the contiguous subarray with the largest sum.

Python Solution:

def max_subarray_sum(nums):
    if not nums:
        return 0
    
    current_sum = max_sum = nums[0]
    
    for num in nums[1:]:
        # Either extend previous subarray or start new
        current_sum = max(num, current_sum + num)
        max_sum = max(max_sum, current_sum)
    
    return max_sum

# With subarray indices
def max_subarray_with_indices(nums):
    if not nums:
        return 0, -1, -1
    
    current_sum = max_sum = nums[0]
    start = end = temp_start = 0
    
    for i in range(1, len(nums)):
        if current_sum + nums[i] < nums[i]:
            current_sum = nums[i]
            temp_start = i
        else:
            current_sum += nums[i]
        
        if current_sum > max_sum:
            max_sum = current_sum
            start = temp_start
            end = i
    
    return max_sum, start, end

# Test
nums = [-2, 1, -3, 4, -1, 2, 1, -5, 4]
print(max_subarray_sum(nums))  # 6 (subarray [4, -1, 2, 1])
print(max_subarray_with_indices(nums))

---

Question 5: Implement Stack using Queues

Problem: Implement a stack using only queue operations.

Python Solution:

from collections import deque

class StackUsingQueue:
    def __init__(self):
        self.queue = deque()
    
    def push(self, x):
        # Add element and rotate to make it front
        self.queue.append(x)
        # Rotate queue so new element is at front
        for _ in range(len(self.queue) - 1):
            self.queue.append(self.queue.popleft())
    
    def pop(self):
        if self.empty():
            return None
        return self.queue.popleft()
    
    def top(self):
        if self.empty():
            return None
        return self.queue[0]
    
    def empty(self):
        return len(self.queue) == 0
    
    def size(self):
        return len(self.queue)

# Alternative: Using two queues
class StackUsingTwoQueues:
    def __init__(self):
        self.q1 = deque()
        self.q2 = deque()
    
    def push(self, x):
        self.q2.append(x)
        # Move all from q1 to q2
        while self.q1:
            self.q2.append(self.q1.popleft())
        # Swap queues
        self.q1, self.q2 = self.q2, self.q1
    
    def pop(self):
        return self.q1.popleft() if not self.empty() else None
    
    def top(self):
        return self.q1[0] if not self.empty() else None
    
    def empty(self):
        return len(self.q1) == 0

# Test
stack = StackUsingQueue()
stack.push(1)
stack.push(2)
stack.push(3)
print(stack.pop())  # 3
print(stack.top())  # 2

---

🎯 Interview Tips

1. Research the Merger: Understand LTI + Mindtree = LTIMindtree. Show awareness of both companies' strengths during interviews.

2. Strong Java Fundamentals: LTIMindtree heavily uses Java. Be thorough with collections, multithreading, and design patterns.

3. Cloud Knowledge is a Plus: Familiarity with AWS, Azure, or GCP basics can differentiate you from other candidates.

4. Practice System Design Basics: Even for freshers, understanding scalability concepts (load balancing, caching, databases) is beneficial.

5. Coding Test Strategy: Focus on clean, working code first, then optimize. Edge cases matter in evaluation.

6. STAR Method for HR: Use Situation-Task-Action-Result format for behavioral questions.

7. Ask Intelligent Questions: Inquire about the merger integration, technologies used, or growth opportunities.

---

❓ Frequently Asked Questions (FAQ)

Q1: Does LTIMindtree conduct off-campus drives?

A: Yes, they conduct off-campus drives and also hire through their Elevate program. Check their careers portal regularly.

Q2: What is the difference between standard and digital packages?

A: Digital/Elevate packages are for candidates who clear additional assessments and interviews. They offer higher CTC and work on advanced technologies.

Q3: Is there a bond period?

A: Yes, typically there is a service agreement of 1-2 years depending on the package. Details are shared during onboarding.

Q4: Which programming languages are preferred for coding rounds?

A: Java, Python, and C++ are all accepted. Java is most commonly used in their projects.

Q5: How important are academic scores in the selection?

A: LTIMindtree has strict academic criteria (65%+). Scores are checked at multiple stages, so ensure you meet requirements before applying.

---

📚 Additional Resources

• Coding Practice: LeetCode (Easy-Medium), HackerRank
• Java Preparation: Head First Java, Java: The Complete Reference
• System Design: Designing Data-Intensive Applications (Martin Kleppmann)
• Aptitude: RS Aggarwal Quantitative Aptitude
• Company Updates: Follow LTIMindtree on LinkedIn

Best wishes for your LTIMindtree placement journey! 🎉

Frequently Asked Questions

What is the expected salary for LTIMindtree placements in 2026?

LTIMindtree salary for 2026 placements typically depends on your role (software engineer, analyst, etc.), campus batch, and your interview performance. In many campus drives, offers often fall in the mid-to-high range for IT services companies, with compensation structured as a base salary plus variable components. Always verify the latest salary range from your specific campus notification or previous-year batch reports.

What are the eligibility criteria for LTIMindtree placement papers 2026?

Eligibility usually includes a minimum percentage/CGPA in academics, a specific graduation year (2026 batch), and a relevant engineering/CS background. Many drives also set criteria for backlogs (often zero or within a limit) and may require basic proficiency in coding and fundamentals. Check the official campus/drive eligibility sheet for exact CGPA and backlog rules.

How difficult are LTIMindtree placement rounds and papers?

The difficulty is generally considered moderate to high because the process tests both coding accuracy and problem-solving fundamentals. Expect a mix of DSA-style questions, logical reasoning, and sometimes aptitude sections that require speed and clarity. Candidates who prepare consistently for 4–8 weeks with mock tests usually perform better than those who only study theory.

What preparation tips should I follow for LTIMindtree placement papers 2026?

Focus on core DSA topics first (arrays, strings, hashing, stacks/queues, trees, graphs, dynamic programming basics) and practice coding under time constraints. Create a daily routine: 1–2 coding problems, 1 aptitude set, and 1 revision session for concepts and common patterns. Also, take multiple mock tests to improve speed and reduce silly mistakes.

What are the interview rounds in LTIMindtree placements 2026?

A typical LTIMindtree process includes an online coding/assessment round followed by technical interviews (and sometimes a second technical round). Many campuses also include HR/communication rounds to evaluate clarity, teamwork, and basic career fit. The exact number of rounds can vary by campus and role, so follow your specific placement schedule.

What common topics appear in LTIMindtree placement papers?

Common topics include arrays and strings, hashing, linked lists, stacks/queues, binary search, recursion, and tree traversals. You may also see graph basics (BFS/DFS), greedy problems, and dynamic programming questions at an introductory level. For aptitude, expect reasoning, time-speed-distance, percentage, probability, and basic quantitative logic.

How can I apply for LTIMindtree placements 2026?

Most candidates apply through the college placement portal and the company’s campus recruitment link shared by the Training & Placement (T&P) cell. Ensure your resume is updated, upload required documents (marksheets, ID proofs), and register within the deadline. If you’re eligible, you’ll receive assessment/interview instructions via email or the campus portal.

What is the selection rate for LTIMindtree placements 2026?

The selection rate varies significantly by campus, number of applicants, and the difficulty of the assessment set. While exact percentages aren’t publicly consistent, competition is usually high, and performance in the coding round is a key differentiator. To improve your odds, aim to clear the online test with strong accuracy and then prepare thoroughly for technical Q&A and problem explanations.