All company sheets
LTIMindtree DSA interview questions
25 problems to practise before your LTIMindtree online test or coding round. Most widely asked first.
25
Questions
8
Easy
17
Medium
0
Hard
Good practice. Problems at the level of this company’s online test and coding round. Treat it as a practice set, not a leak. These are Astra’s own tags, not an official question list.
25 questions
- 1
Contains Duplicate
EasyArrayTagged at 7 companies - 2
Implement Standard Binary Search Recursively
EasyBinary SearchTagged at 7 companies - 3
High-Frequency Trading Bot Limit Orders
EasyArrayTagged at 7 companies - 4
Assign Cookies
EasyTwo PointersTagged at 7 companies - 5
Find Length of Longest Common Subsequence
MediumRecursionTagged at 7 companies - 6
Find the H-Index of a Researcher's Citations
MediumBinary SearchTagged at 7 companies - 7
Find the Kth Missing Positive Number
MediumBinary SearchTagged at 7 companies - 8
Find the Container with the Most Water
MediumArrayTagged at 7 companies - 9
Traverse a Matrix in Spiral Order
MediumArrayTagged at 7 companies - 10
Merge Overlapping Intervals in an Array
MediumArrayTagged at 7 companies - 11
Picking Optimal Server Nodes
MediumSliding WindowTagged at 7 companies - 12
Complex Financial Transaction Reconciliation
MediumTwo PointersTagged at 7 companies - 13
Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold
MediumSliding WindowTagged at 7 companies - 14
Merge Two Binary Trees
EasyTreeTagged at 6 companies - 15
Find all Root-to-Leaf Paths in an N-ary Tree
EasyTreeTagged at 6 companies - 16
Find Kth Largest Element in a Data Stream
EasyTreeTagged at 6 companies - 17
Check if Two Binary Trees are the Same
EasyTreeTagged at 6 companies - 18
Partition a Linked List Around a Value X
MediumLinkedListTagged at 6 companies - 19
Design a Doubly Linked List Implementation
MediumLinkedListTagged at 6 companies - 20
Split a Circular Linked List into Two Halves
MediumLinkedListTagged at 6 companies - 21
Find the Duplicate Number in an Array (Cycle Detection Method)
MediumLinkedListTagged at 6 companies - 22
Merge Two Sorted Lists in Reverse Order
MediumLinkedListTagged at 6 companies - 23
Implement a Trie (Prefix Tree) - StartsWith
MediumTreeTagged at 6 companies - 24
Populate Next Right Pointers in Each Node II (Any Tree)
MediumTreeTagged at 6 companies - 25
Find Minimum Deletions to Make Character Frequencies Unique
MediumStringTagged at 6 companies