LTIMindtree Previous Year Coding Questions and Hiring Process

LTIMindtree is one of the largest IT services companies in India, formed after the merger of Larsen & Toubro Infotech and Mindtree. It regularly hires thousands of freshers every year through campus placements and off campus drives, with FY26 alone targeting around 5,000 new graduate hires.

If you are preparing for LTIMindtree, understanding its online assessment pattern, technical interview expectations, and HR round is the fastest way to convert your application into an offer. This guide covers the complete hiring process along with previous year coding questions asked in LTIMindtree assessments and interviews.

LTIMindtree Hiring Process

Here is the typical flow for LTIMindtree fresher hiring through campus and off campus drives.

StageWhat HappensWhat They Are Looking For
  1. Registration / Application
Apply through your college placement cell or theĀ  LTIMindtree Early Career Hiring portal . Eligible branch, consistent academic record, updated resume.
  1. Online Assessment
A timed test covering aptitude, verbal reasoning, and a technical section with programming fundamentals and computer science basics. Accuracy under time pressure and clarity of fundamentals.
  1. Technical Interview
Discussion on programming concepts, data structures, OOPs, DBMS, and your academic projects. Problem solving approach and depth of core subject knowledge.
  1. HR Interview
Conversation about your background, motivation to join LTIMindtree, and general behavioural questions. Communication skills, attitude, and cultural fit.
  1. Offer Letter
You receive the offer letter with role, package, and joining details. Confirm your joining location and onboarding timeline.

Average timeline: two to four weeks from the assessment to the final offer, depending on the drive.

Online Assessment Pattern

Total Duration: Around 3 hours across all sections.

Sections typically included:

  1. Quantitative Aptitude: Percentages, time and work, profit and loss, number systems, ages and relations.
  2. Logical Reasoning: Series completion, coding decoding, data interpretation, puzzles.
  3. Verbal Ability: Grammar, reading comprehension, sentence correction.
  4. Technical Section: Pseudocode based questions, OOPs concepts, and programming fundamentals in C++, Java, or JavaScript, along with DBMS, Operating Systems, and Networking basics.
  5. Coding Section: In earlier drives this included two to four programming problems of easy to medium difficulty. Recent drives have shifted focus toward computer science MCQs and pseudocode questions, so prepare for both formats.

LTIMindtree Coding Round: What to Expect

When a coding round is included, the problems generally test your grip on arrays, strings, and basic mathematics rather than advanced algorithms. Frequently reported topics include:

  • Pattern printing programs
  • Removing vowels from a string
  • Removing duplicate elements from an array
  • Counting even and odd elements in an array
  • Replacing a substring within a string
  • Finding all prime numbers up to a given limit
  • Reversing a string or array
  • Simple recursion and basic dynamic programming problems

For hands on practice, use:

Technical Interview Focus Areas

  • Programming Languages: C, C++, Java, or Python fundamentals.
  • Object Oriented Programming: Encapsulation, inheritance, polymorphism, abstraction with real examples.
  • Data Structures: Arrays, strings, linked lists, stacks, and queues.
  • Database Concepts: SQL queries, joins, normalization basics.
  • Operating Systems: Processes, threads, scheduling, deadlocks.
  • Computer Networks: OSI model, TCP/IP, basic protocols.
  • Project Discussion: Be ready to explain your final year or major academic project in detail, including your individual contribution.

Interviewers commonly ask about the hardest technical problem you have faced, your favourite subject, and why you chose software engineering over your core branch, so prepare honest, specific answers rather than generic ones.

HR Interview Tips

The HR round checks communication, motivation, and overall fit. Common questions include:

  • Tell me about yourself.
  • Why do you want to join LTIMindtree.
  • What are your strengths and weaknesses.
  • Describe the hardest problem you have faced and how you solved it.
  • What is your favourite subject and why.
  • Are you open to relocation and shift timings.
  • What are your views on AI and how it affects software engineering roles.
  • Do you have any questions for us.

Complete HR Interview Questions

Stay honest, specific, and confident. Align your answers with long term growth and willingness to learn.

Resources to Prepare for LTIMindtree


LTIMindtree Previous Year Coding Questions

Below is a list of LTIMindtree previous year coding questions commonly reported by candidates in online assessments and interviews. Each question includes a problem statement, input and output format, and a sample explanation.

1. Print Right Triangle Number Pattern

Problem Statement: Print a right angled triangle pattern of numbers up to a given number of rows n.

Input Format:

  • An integer n

Output Format:

  • The number pattern printed row by row

Example: Input: 4 Output:

1
1 2
1 2 3
1 2 3 4

2. Remove Vowels from a String

Problem Statement: Given a string, remove all vowels (a, e, i, o, u) from it and print the result.

Input Format:

  • A single string s

Output Format:

  • The string with all vowels removed

Example: Input: mindtree Output: mndtr

3. Remove Duplicate Elements from an Array

Problem Statement: Given an array of integers, remove duplicate elements while keeping the first occurrence of each value.

Input Format:

  • An integer array arr

Output Format:

  • The array with duplicates removed

Example: Input: [4, 5, 4, 6, 5, 7] Output: [4, 5, 6, 7]

4. Count Even and Odd Elements in an Array

Problem Statement: Given an array of integers, count how many elements are even and how many are odd.

Input Format:

  • An integer array arr

Output Format:

  • Two integers representing the count of even and odd elements

Example: Input: [1, 2, 3, 4, 5, 6] Output: Even = 3, Odd = 3

5. Replace a Substring Within a String

Problem Statement: Given a string and two substrings, replace every occurrence of the first substring with the second substring.

Input Format:

  • A string s
  • Substring to find find
  • Substring to replace with replace

Output Format:

  • The modified string

Example: Input: s = "L&T Infotech", find = "L&T", replace = "LTIMindtree" Output: LTIMindtree Infotech

6. Print All Prime Numbers Up to N

Problem Statement: Given an integer n, print all prime numbers less than or equal to n.

Input Format:

  • An integer n

Output Format:

  • All prime numbers up to n, separated by space

Example: Input: 20 Output: 2 3 5 7 11 13 17 19

7. Reverse a String Without Built In Functions

Problem Statement: Reverse a given string without using any built in reverse function.

Input Format:

  • A single string s

Output Format:

  • The reversed string

Example: Input: hiring Output: gnirih

8. Check for Palindrome String

Problem Statement: Determine whether a given string reads the same forward and backward, ignoring case.

Input Format:

  • A single string s

Output Format:

  • "Palindrome" or "Not Palindrome"

Example: Input: Madam Output: Palindrome

9. Find the Second Largest Element in an Array

Problem Statement: Given an array of integers, find the second largest distinct element.

Input Format:

  • An integer array arr

Output Format:

  • The second largest element

Example: Input: [10, 5, 20, 20, 15] Output: 15

10. Check Armstrong Number

Problem Statement: A number is an Armstrong number if the sum of its digits, each raised to the power of the number of digits, equals the number itself. Check whether a given number is an Armstrong number.

Input Format:

  • An integer n

Output Format:

  • "Yes" or "No"

Example: Input: 153 Output: Yes

11. Count Frequency of Each Character in a String

Problem Statement: Given a string, print the frequency of each character present in it.

Input Format:

  • A single string s

Output Format:

  • Each character followed by its count

Example: Input: banana Output:

b: 1
a: 3
n: 2

12. Find the Missing Number in a Sequence

Problem Statement: Given an array containing n - 1 distinct integers from 1 to n, find the missing number.

Input Format:

  • An integer array arr of size n - 1

Output Format:

  • The missing integer

Example: Input: [1, 2, 4, 5] Output: 3

13. Check Whether Two Strings Are Anagrams

Problem Statement: Given two strings, determine whether they are anagrams of each other.

Input Format:

  • Two strings s1 and s2

Output Format:

  • "Yes" or "No"

Example: Input: listen, silent Output: Yes

14. Sum of Digits of a Number

Problem Statement: Given a number, find the sum of its digits.

Input Format:

  • A positive integer n

Output Format:

  • The sum of its digits

Example: Input: 4523 Output: 14

15. Find GCD and LCM of Two Numbers

Problem Statement: Given two positive integers, find their greatest common divisor and least common multiple.

Input Format:

  • Two integers a and b

Output Format:

  • The GCD and the LCM

Example: Input: 12, 18 Output: GCD = 6, LCM = 36

16. Sort an Array Using Bubble Sort

Problem Statement: Sort an array of integers in ascending order using the bubble sort technique.

Input Format:

  • An integer array arr

Output Format:

  • The sorted array

Example: Input: [5, 2, 9, 1, 5] Output: [1, 2, 5, 5, 9]

17. Find the First Non Repeating Character

Problem Statement: Given a string, find the first character that does not repeat anywhere else in the string.

Input Format:

  • A single string s

Output Format:

  • The first non repeating character, or -1 if none exists

Example: Input: aabbcddc Output: -1

18. Matrix Row and Column Sum

Problem Statement: Given a matrix, print the sum of each row and the sum of each column.

Input Format:

  • An m x n matrix

Output Format:

  • Row sums and column sums

Example: Input:

1 2 3
4 5 6

Output: Row sums = [6, 15], Column sums = [5, 7, 9]

19. Check Whether a Number Is a Perfect Square

Problem Statement: Given an integer, determine whether it is a perfect square without using a built in square root function.

Input Format:

  • An integer n

Output Format:

  • "Yes" or "No"

Example: Input: 49 Output: Yes

20. Find All Pairs With a Given Sum

Problem Statement: Given an array of integers and a target value, find all pairs whose sum equals the target.

Input Format:

  • An integer array arr
  • An integer target

Output Format:

  • All valid pairs

Example: Input: arr = [2, 4, 3, 5, 6], target = 8 Output: (2, 6), (3, 5)

21. Basic Dynamic Programming: Fibonacci Series

Problem Statement: Print the first n numbers of the Fibonacci series using dynamic programming so the same value is never recomputed.

Input Format:

  • An integer n

Output Format:

  • The first n Fibonacci numbers

Example: Input: 7 Output: 0 1 1 2 3 5 8

22. Longest Common Prefix

Problem Statement: Given a list of strings, find the longest common prefix shared by all of them.

Input Format:

  • An array of strings

Output Format:

  • The longest common prefix, or an empty string if none exists

Example: Input: ["flower", "flow", "flight"] Output: fl

23. Rotate an Array by K Positions

Problem Statement: Rotate an array to the right by k positions.

Input Format:

  • An integer array arr
  • An integer k

Output Format:

  • The rotated array

Example: Input: [1, 2, 3, 4, 5], k = 2 Output: [4, 5, 1, 2, 3]

24. Check Balanced Parentheses

Problem Statement: Given a string containing only brackets, determine whether every opening bracket has a matching closing bracket in the correct order.

Input Format:

  • A string of brackets

Output Format:

  • "Balanced" or "Not Balanced"

Example: Input: {[()]} Output: Balanced

25. Find the Largest Element in Each Row of a Matrix

Problem Statement: Given a matrix, print the largest element present in each row.

Input Format:

  • An m x n matrix

Output Format:

  • The largest element of every row

Example: Input:

3 7 2
9 4 1

Output: 7 9

At Last

Cracking LTIMindtree comes down to consistent fundamentals rather than memorising every possible question. Focus on your aptitude speed, revise core OOPs, DBMS, and OS concepts, and be ready to speak confidently about your projects.

Join the Telegram group for more resources and discussions.

Useful Resources for Your Placement Prep