All company sheets
HCL Technologies DSA interview questions
20 problems to practise before your HCL Technologies online test or coding round. Most widely asked first.
20
Questions
7
Easy
13
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.
20 questions
- 1
Invert a Binary Tree (Mirror Tree)
EasyRecursionTagged at 7 companies - 2
Find the Pivot Index (Equilibrium Point)
EasyArrayTagged at 7 companies - 3
Reverse Log Viewer
EasyTwo PointersTagged at 7 companies - 4
Mutual Friends Finder
EasyTwo PointersTagged at 7 companies - 5
Reverse Vowels of a String
EasyTwo PointersTagged at 7 companies - 6
Find Minimum in Rotated Sorted Array
MediumArrayTagged at 7 companies - 7
Find Peak Element
MediumArrayTagged at 7 companies - 8
Count the Number of Matching Subsequences
MediumBinary SearchTagged at 7 companies - 9
Determine if You Can Jump to the End of an Array
MediumArrayTagged at 7 companies - 10
Sort Colors
MediumTwo PointersTagged at 7 companies - 11
Detect if a Linked List Has a Cycle
EasyLinkedListTagged at 6 companies - 12
Find Intersection Point of Two Sorted Linked Lists
EasyLinkedListTagged at 6 companies - 13
Find All Anagrams in a String
MediumStringTagged at 6 companies - 14
Find the Next Greater Element II in Circular Array
MediumStack and QueueTagged at 6 companies - 15
Add Two Numbers Represented as Linked Lists
MediumLinkedListTagged at 6 companies - 16
Swap Two Nodes in a Linked List (by value or pointers)
MediumLinkedListTagged at 6 companies - 17
Implement a Trie (Prefix Tree) - Insert
MediumTreeTagged at 6 companies - 18
Implement a Binary Heap (Min-Heap) - Insert
MediumTreeTagged at 6 companies - 19
Find the Diameter of an N-ary Tree (Google/Facebook)
MediumTreeTagged at 6 companies - 20
Validate a Binary Search Tree (In-order Traversal)
MediumTreeTagged at 6 companies