LTIMindtree
Global technology consulting and digital solutions company.
4 Rounds
~21 Days
Medium
The Interview Loop
Recruiter Screen (30 min)
Standard fit check, behavioral questions, and resume overview.
Technical Loop (3-4 Rounds)
Deep dive into domain knowledge, coding, and system design.
Interview Question Bank
Backend Engineer
•
Coding
•
easy
Given an array of integers and an integer target, return indices of the two numbers such that they add up to target. You may assume that each input would have exactly one solution.
#Arrays
#HashMaps
Backend Engineer
•
Coding
•
easy
Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target. You may assume that each input would have exactly one solution.
#Arrays
#Hash Table
Backend Engineer
•
Coding
•
medium
Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cover all the intervals in the input.
#Arrays
#Sorting
Backend Engineer
•
Coding
•
medium
Find the top K frequent elements in an integer array. Your algorithm's time complexity must be better than O(n log n).
#Heaps
#HashMaps
#Bucket Sort
Backend Engineer
•
Coding
•
easy
Write a program to detect if a linked list has a cycle in it. Can you do it using O(1) memory?
#Linked Lists
#Two Pointers
Backend Engineer
•
Coding
•
medium
Find the first non-repeating character in a stream of characters.
#Queues
#HashMaps
#Data Streams
Backend Engineer
•
Coding
•
medium
Given a string, reverse the words in the string while maintaining the original punctuation marks and spaces.
#Strings
#Two Pointers
Backend Engineer
•
Coding
•
medium
Design and implement a data structure for Least Recently Used (LRU) cache.
#Design
#Hash Table
#Doubly Linked List
Backend Engineer
•
Coding
•
medium
Given an integer array nums and an integer k, return the k most frequent elements. You may return the answer in any order.
#Arrays
#Hash Table
#Heap
#Bucket Sort
Backend Engineer
•
Coding
•
easy
Write a program to find the node at which the intersection of two singly linked lists begins.
#Linked List
#Two Pointers
Backend Engineer
•
Coding
•
easy
Write a function to reverse a singly linked list.
#Linked List
#Pointers
Backend Engineer
•
Coding
•
medium
Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals.
#Arrays
#Sorting
Backend Engineer
•
Coding
•
medium
Given a string s, find the length of the longest substring without repeating characters.
#Strings
#Sliding Window
#Hash Set
Backend Engineer
•
Coding
•
easy
Given a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.
#Strings
#Stack
Backend Engineer
•
Coding
•
medium
Write a function to find the longest substring without repeating characters in a given string.
#Strings
#Sliding Window
Cloud Engineer
•
Coding
•
medium
Write a Python function to validate if a given string is a valid IPv4 address.
#Python
#String Manipulation
#Networking
Cloud Engineer
•
Coding
•
easy
Given an array of integers and an integer target, return indices of the two numbers such that they add up to target. (Two Sum)
#Arrays
#Hash Maps
#Data Structures
Data Engineer
•
Coding
•
medium
Write a Python program to find the longest common prefix string amongst an array of strings.
#Strings
#Arrays
#Loops
Data Scientist
•
Coding
•
easy
Given a dictionary of employee names and their salaries, write a Python script to find the second highest salary efficiently.
#Python
#Data Structures
#Sorting
Data Scientist
•
Coding
•
medium
Given a string, write a Python program to find the length of the longest substring without repeating characters.
#Python
#Sliding Window
#Strings
Frontend Engineer
•
Coding
•
easy
Write a function to check if two strings are anagrams of each other.
#Strings
#Hash Map
Frontend Engineer
•
Coding
•
medium
Write a JavaScript function to find the length of the longest substring without repeating characters.
#Sliding Window
#Strings
#Hash Map
Full Stack Engineer
•
Coding
•
easy
Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.
#Strings
#Stack
Full Stack Engineer
•
Coding
•
medium
Write a function to flatten a deeply nested array in JavaScript without using the built-in `Array.prototype.flat()`.
#JavaScript
#Recursion
#Arrays
Full Stack Engineer
•
Coding
•
medium
Given an array of strings, group the anagrams together. You can return the answer in any order.
#Strings
#Hash Map
#Sorting
Full Stack Engineer
•
Coding
•
hard
Write a program to merge two sorted arrays into a single sorted array without using extra space (O(1) auxiliary space).
#Arrays
#Two Pointers
#Sorting
Full Stack Engineer
•
Coding
•
easy
Given an array of integers and a target sum, return the indices of the two numbers that add up to the target. Can you do this in O(n) time complexity?
#Arrays
#Hash Map
Full Stack Engineer
•
Coding
•
easy
Find the first non-repeating character in a given string. Return its index. If it doesn't exist, return -1.
#Strings
#Hash Map
Machine Learning Engineer
•
Coding
•
medium
Given a string, find the length of the longest substring without repeating characters. Optimize your solution for O(N) time complexity.
#Strings
#Sliding Window
#Hash Map
Machine Learning Engineer
•
Coding
•
easy
Implement a binary search algorithm to find the optimal threshold for a classification model given a sorted array of predicted probabilities.
#Binary Search
#Arrays
Machine Learning Engineer
•
Coding
•
medium
Write a Python script to calculate the cosine similarity between two text documents from scratch, without using scikit-learn.
#NLP
#Math
#Python
Difficulty Radar
Based on recent AI-sourced data.
Meet Your Interviewers
The "Standard" Interviewer
Senior EngineerFocuses on core competencies, system constraints, and clear communication.
SimulateUnwritten Rules
Think Out Loud
Always explain your thought process before writing code or drawing architecture.