LTIMindtree Placement Papers with Solutions (2026)

LTIMindtree’s online test covers four subject areas, and the section where most candidates lose ground is coding, not the aptitude rounds they spend most of their prep time on.

This article is the worked-examples companion to the LTIMindtree test pattern and syllabus guide. That article covers the full six-section structure with question counts and timing. This one focuses on sample questions with complete solutions and notes on how each question type is typically structured in candidate-reported drives.

A note on sourcing: the questions below are reconstructed from the documented syllabus topics and candidate reports, not from any official LTIMindtree question bank. LTIMindtree does not publish past papers. Use these for topic-level gap identification, not memorisation.

How This Article Relates to the Test Pattern

The online test has three non-coding aptitude sections covering verbal, quantitative ability, and logical reasoning, followed by three coding sections. Each section is timed independently; unused time in one section does not carry forward.

Placement papers map to this structure section by section. The five quantitative examples below cover the high-frequency topics from the quantitative ability section. The logical examples target the five formats that appear most consistently in candidate reports. The verbal examples address the grammar, vocabulary, and sentence-correction question types that account for the majority of the section’s marks.

For the complete section-by-section breakdown of question counts, timing, and difficulty gradation, the LTIMindtree test pattern and syllabus article has the full structure table.

Quantitative Aptitude: Sample Questions and Solutions

The quantitative ability section is 15 questions in 20 minutes, which works out to roughly 80 seconds per question. The five question types below appear in most reported LTIMindtree drives: consecutive-number problems, profit and loss, time and work, speed-distance-time, and basic probability.

For additional practice sets across the full quantitative and logical syllabus, the aptitude and logical reasoning complete guide has structured topic coverage.

Sample Quantitative Questions

• Q1. The sum of three consecutive integers is 72. Find the integers.

  • Solution:
  • Let the integers be x, x+1, and x+2.
  • x + (x+1) + (x+2) = 72
  • 3x + 3 = 72, so 3x = 69, and x = 23.
  • Answer: 23, 24, and 25.

• Q2. A shopkeeper buys an article for ₹600 and sells it at a profit of 20%. Find the selling price.

  • Solution:
  • Selling Price = Cost Price × (1 + Profit/100)
  • SP = 600 × (120/100) = 600 × 1.2 = ₹720.
  • Answer: ₹720.

• Q3. A can complete a task in 10 days; B can complete the same task in 15 days. How many days do they take working together?

  • Solution:
  • A’s daily rate = 1/10. B’s daily rate = 1/15.
  • Combined daily rate = 1/10 + 1/15 = 3/30 + 2/30 = 5/30 = 1/6.
  • Answer: 6 days.

• Q4. A train travels 360 km in 4 hours. What is its speed in km/h?

  • Solution:
  • Speed = Distance / Time = 360 / 4 = 90 km/h.
  • Answer: 90 km/h.

• Q5. A bag contains 4 red balls and 6 green balls. If one ball is picked at random, what is the probability it is red?

  • Solution:
  • Total balls = 4 + 6 = 10.
  • Probability = Favourable outcomes / Total outcomes = 4/10 = 2/5.
  • Answer: 2/5.

Logical Reasoning: Sample Questions and Solutions

The logical reasoning section is 15 questions in 20 minutes. Five formats repeat across virtually every LTIMindtree drive: Venn diagrams, seating arrangements, number or letter series, blood relations, and coding-decoding. All five are covered below.

For deeper practice on puzzles, syllogisms, and direction-sense questions, the logical reasoning practice guide has structured topic-by-topic coverage.

Sample Logical Reasoning Questions

• Q1. Venn Diagram. In a group of 40 people, 25 like tea, 18 like coffee, and 10 like both. How many like neither?

  • Solution:
  • Number who like tea or coffee = 25 + 18 - 10 = 33.
  • Neither = 40 - 33 = 7.
  • Answer: 7 people.

• Q2. Seating Arrangement. A, B, C, D, and E are seated in a row. C is to the right of B but to the left of D. E is at the right end. Who sits in the middle?

  • Solution:
  • E is fixed at position 5. The constraint B…C…D places D at position 4, C at position 3, and B at position 2. A takes position 1.
  • Final order: A B C D E.
  • Answer: C is in the middle.

• Q3. Number Series. What is the next number in the series: 2, 6, 12, 20, 30, ?

  • Solution:
  • Differences between consecutive terms: 4, 6, 8, 10, …
  • The difference increases by 2 each step. Next difference = 12.
  • 30 + 12 = 42.
  • Answer: 42.

• Q4. Coding-Decoding. Each letter in a word is shifted 2 places forward in the alphabet. How is GATE encoded?

  • Solution:
  • G(7) shifted by 2 gives I(9). A(1) gives C(3). T(20) gives V(22). E(5) gives G(7).
  • Answer: ICVG.

• Q5. Blood Relations. A is B’s father. C is B’s sister. D is C’s son. How is A related to D?

  • Solution:
  • A is the parent of both B and C. D is C’s son.
  • A is D’s grandfather.
  • Answer: Grandfather.

Verbal Ability: Sample Questions and Solutions

The verbal ability section is 20 questions in 20 minutes, the tightest question-to-time ratio of the three aptitude sections. Subject-verb agreement, active-passive voice, error spotting, fill-in-the-blank, and vocabulary synonyms or antonyms are the consistently high-weight sub-types.

For a larger practice set on vocabulary, reading comprehension, and para jumbles, the LTIMindtree verbal ability practice article covers all sub-types in detail.

Sample Verbal Ability Questions

• Q1. Subject-Verb Agreement. Identify the grammatical error: “Each of the students have submitted their assignments.”

  • Error: “Each” is singular and requires a singular verb. “Have” should be “has.”
  • Corrected: “Each of the students has submitted their assignment.”

• Q2. Active to Passive Voice. Convert to passive voice: “The chef prepared a delicious meal.”

  • Answer: “A delicious meal was prepared by the chef.”

• Q3. Error Spotting. Find the error: “Neither of the boys were interested in the game.”

  • Error: “Neither” is singular. “Were” should be “was.”
  • Corrected: “Neither of the boys was interested in the game.”

• Q4. Fill in the Blank. “The manager was not _____ with the team’s performance.” (A) Satisfied (B) Satisfy (C) Satisfaction (D) Satisfying.

  • Answer: (A) Satisfied.

• Q5. Synonym. Choose the synonym of “Obsolete”: (A) Modern (B) Outdated (C) Relevant (D) New.

  • Answer: (B) Outdated.

Coding Round: Sample Problems and Approaches

The three coding sections together account for 4 problems and 120 minutes. The first two problems test basic implementation. The third tests data structures and algorithms. The fourth tests advanced algorithms, typically dynamic programming or graph traversal.

The solutions below are written in Python for readability. The actual test accepts C, Java, and Python; use whichever you are fastest in.

Problem 1: Find the Maximum in a List (Implementation Level)

Problem: Given a list of integers, return the largest value without using a built-in max function.

def find_max(arr):
    max_val = arr[0]
    for i in range(1, len(arr)):
        if arr[i] > max_val:
            max_val = arr[i]
    return max_val

# Example
print(find_max([3, 1, 8, 2, 5]))  # Output: 8

• Approach: Initialise max_val to the first element. Iterate once through the rest. Update when a larger value is found.
• Time complexity: O(n). Single pass, no extra space.
• Common mistake: Starting the loop at index 0 instead of 1 wastes one comparison but does not break correctness. Starting at 1 is cleaner.

Problem 2: Palindrome Check (DSA Level)

Problem: Given a string, return True if it reads the same forwards and backwards, False otherwise. Ignore case.

def is_palindrome(s):
    s = s.lower()
    left, right = 0, len(s) - 1
    while left < right:
        if s[left] != s[right]:
            return False
        left += 1
        right -= 1
    return True

# Examples
print(is_palindrome("Racecar"))  # True
print(is_palindrome("hello"))    # False

• Approach: Two-pointer technique. Compare characters from both ends, moving inward.
• Time complexity: O(n). Space: O(1) after the lowercase conversion.
• Note on alternatives: Slicing (s == s[::-1]) is equally correct but uses O(n) extra space. The two-pointer version shows awareness of space efficiency, which is often the follow-up question in a DSA evaluation.

Problem 3: Longest Common Subsequence (Advanced Algorithms Level)

Problem: Given two strings, find the length of their longest common subsequence.

def lcs(s1, s2):
    m, n = len(s1), len(s2)
    dp = [[0] * (n + 1) for _ in range(m + 1)]
    for i in range(1, m + 1):
        for j in range(1, n + 1):
            if s1[i-1] == s2[j-1]:
                dp[i][j] = dp[i-1][j-1] + 1
            else:
                dp[i][j] = max(dp[i-1][j], dp[i][j-1])
    return dp[m][n]

# Example
print(lcs("ABCBDAB", "BDCAB"))  # Output: 4

• Approach: Classic 2D dynamic programming table. dp[i][j] stores the LCS length for the first i characters of s1 and the first j characters of s2.
• Time complexity: O(m x n). Space: O(m x n).
• Partial credit note: In the advanced round, a working brute-force that passes basic test cases earns more than an incomplete DP solution. If stuck on the table formulation, submit a recursive solution first, then refine.

What the Question Mix Reveals for 2026 Preparation

Three patterns emerge from the question set above. Aptitude questions reward topic coverage more than any special aptitude; most are solvable in under 90 seconds with the right formula and basic arithmetic. Logical reasoning rewards format familiarity; solving 20 seating-arrangement problems makes the 21st routine. Coding is where gaps become unmistakable fast, especially in the advanced algorithms round.

The advanced algorithms round is also where the standard and premium tracks separate most clearly. LTIMindtree resumed campus hiring in 2025 and is targeting around 5,000 fresher onboardings this fiscal, using AI-assisted coding evaluation as part of the screen (Times of India, 2025). On the strategic side, LTIMindtree launched BlueVerse in 2026, a dedicated AI platform unit focused on enterprise AI adoption, per CEO Venugopal Lambu (Economic Times, 2026). The company also started a global AI upskilling partnership with MIT and upGrad (SightsIn Plus, 2026).

For a fresher applying in 2026: code quality and efficiency carry more weight in evaluation than before, and candidates who have built at least one AI-adjacent project carry measurable differentiation in the technical review. The 2026 AI roadmap for Indian engineering students covers a semester-scale curriculum for building that foundation.

The advanced algorithms round and the real-world AI problem LTIMindtree is solving with BlueVerse share the same core requirement: shipping working code. TinkerLLM (₹499) is a set of short, guided LLM challenges that produce a working project, the kind of demo that holds up in a premium-track technical review.