Mindtree Placement Papers 2026

Last Updated: March 2026

🎯 Company Overview

Mindtree (now part of LTIMindtree) is one of India's leading global technology consulting and services companies. Founded in 1999 and headquartered in Bangalore, Mindtree has established itself as a trusted partner for digital transformation initiatives across industries including banking, insurance, travel, hospitality, and retail.

With a workforce of over 30,000 professionals and operations spanning 15+ countries, Mindtree offers a comprehensive range of services including application development, infrastructure management, testing, and emerging technologies like AI, cloud, and IoT.

💼 Eligibility Criteria (Freshers 2026)

💰 CTC for Freshers 2026

Mindtree offers competitive compensation packages for fresh graduates:

Note: Exact figures may vary based on college tier and performance in assessments.

---

📋 Exam Pattern

Mindtree follows a multi-stage selection process. Here's the detailed exam pattern:

Stage 1: Online Assessment

Stage 2: Technical Interview

• Duration: 30-45 minutes
• Topics: Data Structures, Algorithms, Projects, OOPs, DBMS
• Coding questions on paper or shared screen

Stage 3: HR Interview

• Duration: 15-20 minutes
• Focus: Communication skills, cultural fit, career goals

Marking Scheme

• No negative marking
• Sectional cutoffs apply
• Overall cutoff: 60-65%

---

🧮 Aptitude Questions with Solutions (15 Questions)

Question 1

The average of 5 consecutive even numbers is 36. Find the largest number.

Solution: Let the five consecutive even numbers be: x, x+2, x+4, x+6, x+8

Average = (x + x+2 + x+4 + x+6 + x+8) / 5 = 36 (5x + 20) / 5 = 36 x + 4 = 36 x = 32

Largest number = x + 8 = 32 + 8 = 40

Shortcut: For consecutive numbers, average = middle term. So middle term = 36. Numbers are 32, 34, 36, 38, 40. Largest = 40.

---

Question 2

A train 150m long crosses a platform 250m long in 20 seconds. Find the speed of the train in km/hr.

Solution: Total distance = Length of train + Length of platform = 150 + 250 = 400m Time = 20 seconds

Speed = Distance / Time = 400 / 20 = 20 m/s

Convert to km/hr: 20 × (18/5) = 72 km/hr

---

Question 3

If the compound interest on a sum for 2 years at 10% per annum is ₹420, find the simple interest for the same period.

Solution: Let Principal = P Compound Interest = P[(1 + 10/100)² - 1] = 420 P[(1.1)² - 1] = 420 P[1.21 - 1] = 420 P × 0.21 = 420 P = 2000

Simple Interest = (P × R × T) / 100 = (2000 × 10 × 2) / 100 = ₹400

Shortcut: SI = (CI × 200) / (200 + R) = (420 × 200) / 220 = 381.82... Wait, this formula applies differently. Better to calculate directly.

---

Question 4

In what ratio should tea at ₹60/kg be mixed with tea at ₹80/kg to get a mixture worth ₹68/kg?

Solution: Using allegation method:

Tea 1: ₹60        Tea 2: ₹80
        \      /
         ₹68
        /      \
   (80-68)=12   (68-60)=8

Ratio = 12 : 8 = 3 : 2

---

Question 5

A can complete a work in 12 days. B can complete the same work in 18 days. If they work together for 3 days, what fraction of work is completed?

Solution: A's 1 day work = 1/12 B's 1 day work = 1/18

(A + B)'s 1 day work = 1/12 + 1/18 = (3 + 2)/36 = 5/36

Work done in 3 days = 3 × (5/36) = 15/36 = 5/12

---

Question 6

Find the remainder when 2^100 is divided by 3.

Solution: 2 ≡ -1 (mod 3) 2^100 ≡ (-1)^100 (mod 3) 2^100 ≡ 1 (mod 3)

Remainder = 1

Pattern method: 2^1 = 2 (remainder 2), 2^2 = 4 (remainder 1), 2^3 = 8 (remainder 2)... Pattern is 2, 1, 2, 1... For even powers, remainder is 1.

---

Question 7

The marked price of an article is ₹800. After giving a discount of 20%, the seller still makes a profit of 25%. Find the cost price.

Solution: Selling Price = 800 × (100-20)/100 = 800 × 0.8 = ₹640

If profit = 25%, then SP = 125% of CP 640 = 1.25 × CP CP = 640 / 1.25 = ₹512

---

Question 8

A boat can travel 20 km downstream in 2 hours and 12 km upstream in 3 hours. Find the speed of the boat in still water.

Solution: Downstream speed = 20/2 = 10 km/hr = B + S (Boat speed + Stream speed) Upstream speed = 12/3 = 4 km/hr = B - S

Adding: 2B = 14, so B = 7 km/hr

---

Question 9

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

Solution: We need to form 4-digit numbers from 5 available digits.

Number of ways = 5P4 = 5! / (5-4)! = 5! / 1! = 120

---

Question 10

If x + 1/x = 5, find x² + 1/x².

Solution: Squaring both sides: (x + 1/x)² = 25 x² + 2(x)(1/x) + 1/x² = 25 x² + 2 + 1/x² = 25 x² + 1/x² = 25 - 2 = 23

---

Question 11

The ratio of ages of A and B is 4:5. After 6 years, the ratio becomes 5:6. Find B's present age.

Solution: Let present ages be 4x and 5x.

(4x + 6) / (5x + 6) = 5/6 6(4x + 6) = 5(5x + 6) 24x + 36 = 25x + 30 x = 6

B's present age = 5x = 30 years

---

Question 12

Find the HCF of 72, 108, and 144.

Solution: 72 = 2³ × 3² 108 = 2² × 3³ 144 = 2⁴ × 3²

HCF = 2² × 3² = 4 × 9 = 36

---

Question 13

A shopkeeper sells an article for ₹720 and gains 20%. If he wants to gain 30%, what should be the selling price?

Solution: CP = 720 / 1.20 = ₹600

For 30% profit: SP = 600 × 1.30 = ₹780

---

Question 14

Find the sum of first 20 odd natural numbers.

Solution: Sum of first n odd numbers = n² Sum of first 20 odd numbers = 20² = 400

---

Question 15

A pipe can fill a tank in 8 hours. Due to a leak, it takes 10 hours to fill. How long will the leak take to empty the full tank?

Solution: Filling rate = 1/8 per hour Net rate with leak = 1/10 per hour

Leak rate = 1/8 - 1/10 = (5-4)/40 = 1/40 per hour

Time to empty = 40 hours

---

💻 Technical Questions with Solutions (10 Questions)

Question 1

What is the time complexity of binary search?

Explanation: Binary search divides the search interval in half each time. In the worst case, it takes log₂(n) comparisons to find the target element, where n is the number of elements.

---

Question 2

Explain the difference between stack and queue.

---

Question 3

What is a deadlock in operating systems?

---

Question 4

Differentiate between primary key and unique key.

---

Question 5

What is normalization in DBMS?

---

Question 6

Explain the concept of virtual memory.

---

Question 7

What is the difference between TCP and UDP?

---

Question 8

What is polymorphism in OOP?

• Compile-time: Method overloading
• Runtime: Method overriding

---

Question 9

What is a foreign key?

---

Question 10

Explain the working of quicksort algorithm.

1. Choose a 'pivot' element
2. Partition: rearrange array so elements < pivot are left, elements > pivot are right
3. Recursively apply steps 1-2 to sub-arrays

Average time complexity: O(n log n), Worst case: O(n²)

---

📝 Verbal/English Questions with Solutions (10 Questions)

Question 1

Choose the correct synonym for EPITOME:

a) Extension b) Expansion c) Embodiment d) Elongation

Explanation: Epitome means a perfect example of something, or embodiment of a quality.

---

Question 2

Choose the correct antonym for ABUNDANT:

a) Plentiful b) Scarce c) Copious d) Profuse

Explanation: Abundant means existing in large quantities; scarce means insufficient or rare.

---

Question 3

Fill in the blank: The CEO's speech _______ the employees to work harder.

a) motivated b) motivation c) motive d) motivator

Explanation: We need a past tense verb here. "Motivated" is the correct verb form.

---

Question 4

Error spotting: "Neither the teacher nor the students was present."

Explanation: With "neither...nor", the verb agrees with the nearest subject. Here "students" is plural, so use "were".

---

Question 5

Rearrange: P: the company Q: announced R: yesterday S: record profits

---

Question 6

Choose the correct preposition: He is good ______ mathematics.

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

Explanation: The phrase "good at" is used to indicate proficiency in a subject or skill.

---

Question 7

One word substitution: A person who knows many languages.

a) Polyglot b) Monolingual c) Bilingual d) Linguist

---

Question 8

Idiom meaning: "To burn the midnight oil"

a) To waste time b) To study/work late into the night c) To set fire d) To sleep early

---

Question 9

Active to Passive: "The chef cooked the meal."

---

Question 10

Reading Comprehension (Passage summary):

Passage about digital transformation in businesses...

Question: What is the main idea of the passage?

a) Technology is expensive b) Companies must adapt to digital changes to remain competitive c) Traditional methods are better d) Digital transformation is optional

---

🚀 Coding Questions with Solutions (5 Questions)

Question 1: Reverse a String

Problem: Write a function to reverse a given string.

Python Solution:

def reverse_string(s):
    return s[::-1]

# Alternative approach
def reverse_string_manual(s):
    result = ""
    for char in s:
        result = char + result
    return result

# Test
print(reverse_string("hello"))  # Output: olleh

---

Question 2: Check Prime Number

Problem: Write a function to check if a number is prime.

Python Solution:

import math

def is_prime(n):
    if n <= 1:
        return False
    if n <= 3:
        return True
    if n % 2 == 0 or n % 3 == 0:
        return False
    
    # Check only up to square root
    for i in range(5, int(math.sqrt(n)) + 1, 6):
        if n % i == 0 or n % (i + 2) == 0:
            return False
    return True

# Test
print(is_prime(17))  # Output: True
print(is_prime(18))  # Output: False

---

Question 3: Fibonacci Series

Problem: Print first n Fibonacci numbers.

Python Solution:

def fibonacci(n):
    if n <= 0:
        return []
    elif n == 1:
        return [0]
    
    fib_series = [0, 1]
    for i in range(2, n):
        fib_series.append(fib_series[i-1] + fib_series[i-2])
    return fib_series

# Alternative: Using recursion with memoization
def fib_memo(n, memo={}):
    if n in memo:
        return memo[n]
    if n <= 1:
        return n
    memo[n] = fib_memo(n-1, memo) + fib_memo(n-2, memo)
    return memo[n]

# Test
print(fibonacci(10))

---

Question 4: Find Duplicate in Array

Problem: Find the duplicate element in an array of n+1 integers where each integer is between 1 and n (inclusive).

Python Solution:

def find_duplicate(nums):
    # Floyd's Cycle Detection (Tortoise and Hare)
    slow = nums[0]
    fast = nums[0]
    
    # Find meeting point
    while True:
        slow = nums[slow]
        fast = nums[nums[fast]]
        if slow == fast:
            break
    
    # Find entrance to cycle
    slow = nums[0]
    while slow != fast:
        slow = nums[slow]
        fast = nums[fast]
    
    return slow

# Alternative: Using set
def find_duplicate_set(nums):
    seen = set()
    for num in nums:
        if num in seen:
            return num
        seen.add(num)
    return -1

# Test
print(find_duplicate([1, 3, 4, 2, 2]))  # Output: 2

---

Question 5: Merge Two Sorted Arrays

Problem: Merge two sorted arrays into a single sorted array.

Python Solution:

def merge_sorted(arr1, arr2):
    result = []
    i = j = 0
    
    # Compare and merge
    while i < len(arr1) and j < len(arr2):
        if arr1[i] <= arr2[j]:
            result.append(arr1[i])
            i += 1
        else:
            result.append(arr2[j])
            j += 1
    
    # Add remaining elements
    result.extend(arr1[i:])
    result.extend(arr2[j:])
    
    return result

# Pythonic way
def merge_sorted_pythonic(arr1, arr2):
    return sorted(arr1 + arr2)

# Test
print(merge_sorted([1, 3, 5], [2, 4, 6]))
# Output: [1, 2, 3, 4, 5, 6]

---

🎯 Interview Tips

1. Know Your Projects Inside Out: Be prepared to explain every line of code in your projects. Interviewers dig deep into project details.

2. Practice Coding on Paper: Mindtree often asks candidates to write code on paper or whiteboard. Practice without IDE assistance.

3. Focus on Data Structures: Arrays, strings, linked lists, and trees are frequently asked. Know time and space complexities.

4. Be Ready for SQL Queries: Basic joins, group by, and subqueries are commonly tested. Practice on platforms like HackerRank.

5. Understand OOPs Concepts: Be clear with encapsulation, inheritance, polymorphism, and abstraction with real-world examples.

6. Communication is Key: Even if you know the answer, explain your thought process clearly. Structured thinking impresses interviewers.

7. Ask Smart Questions: At the end, ask about the team structure, tech stack, or growth opportunities. It shows genuine interest.

---

You May Also Like

• Mindtree Interview Questions 2026 - Round-by-Round Guide

❓ Frequently Asked Questions (FAQ)

Q1: What is the difficulty level of Mindtree's placement exam?

A: The exam is rated as moderate. Focus on time management and accuracy. Aptitude and logical reasoning sections are generally easier than technical sections.

Q2: Is there negative marking in the online test?

A: No, there is no negative marking. Attempt all questions.

Q3: What programming languages are allowed in the coding round?

A: Mindtree typically allows C, C++, Java, and Python. Python is recommended for its simplicity in coding tests.

Q4: How many rounds are there in the interview process?

A: Generally 3 rounds: Online Assessment → Technical Interview → HR Interview. Sometimes a second technical round may be added.

Q5: Does Mindtree consider academic backlogs?

A: No active backlogs are allowed at the time of joining. Some backlogs cleared before joining may be acceptable depending on company policy.

---

📚 Additional Resources

• Practice Platforms: HackerRank, LeetCode (Easy), GeeksforGeeks
• Aptitude: IndiaBIX, FacePrep
• Mock Tests: Mock tests available on Mindtree's career portal

Best of luck with your Mindtree placement! 🎉

Frequently Asked Questions

What is the expected salary range for Mindtree (LTIMindtree) placements in 2026?

For 2026 drives, Mindtree/LTIMindtree typically offers a fixed CTC band for eligible freshers, with variations based on role, location, and candidate profile. In many past campus drives, the range has commonly fallen in the mid-to-high single digits (CTC), while top performers may see higher offers through role-based grading and interview performance.

What are the eligibility criteria for Mindtree placement papers 2026?

Eligibility usually includes being in the final year of an eligible degree (typically B.E./B.Tech/MCA or equivalent), maintaining a minimum aggregate percentage (often around 60% and above, depending on the drive), and having no active backlogs at the time of assessment. Some drives may also specify a minimum percentage in core subjects or restrict to certain branches.

How difficult are Mindtree placement papers and the overall selection process?

The difficulty is generally considered moderate to high because it combines aptitude/quant reasoning with strong coding fundamentals and problem-solving under time constraints. Many candidates find the coding round and the technical depth (DSA + basic CS concepts) to be the most challenging, especially when they haven’t practiced similar patterns of questions.

What preparation tips work best for Mindtree placement papers 2026?

Start with a structured DSA plan covering arrays, strings, hashing, stacks/queues, linked lists, trees, graphs basics, and dynamic programming fundamentals. Practice Mindtree-style aptitude (speed + accuracy) and do timed coding tests daily; also revise common HR/communication points and project explanations so you can answer confidently.

What are the typical interview rounds for Mindtree placements in 2026?

A common pattern is an online assessment (aptitude + coding) followed by technical interviews and then HR rounds. Technical interviews often focus on coding walkthroughs, DSA concepts, and sometimes basic system/DB fundamentals, while HR evaluates communication, problem ownership, and motivation.

Which topics are most commonly asked in Mindtree placement papers?

Expect a mix of quantitative aptitude (percentages, time-speed-distance, probability, simplification), logical reasoning, and coding questions based on common DSA patterns. For technical rounds, frequently covered topics include complexity analysis, arrays/strings, hashing, recursion, trees, graphs basics, and SQL/DB fundamentals (depending on the role).

How can I apply for Mindtree placements 2026?

You typically apply through your college’s placement cell or the company’s official campus recruitment process, which may also involve registering on the relevant careers portal when a drive is announced. Keep an eye on eligibility requirements, test dates, and document checks (resume, ID, academic records) shared by your institute.

What is the approximate selection rate for Mindtree placements 2026?

Selection rates vary significantly by campus, number of applicants, and the difficulty of the assessment that year, so there isn’t a single fixed percentage. Historically, the process is competitive, only a fraction of test-takers clear the coding/technical cutoff, so candidates should aim for strong aptitude accuracy and consistent DSA practice to improve their odds.

Quick disclosure: candidates report the patterns summarised above, and details differ by role and year. Cross-check the official notification and your own invite email for the version that actually applies to you before you prepare around any figure.