| S.No |
Interview Question |
Number of times candidates experienced this question in interviews |
| 1 | Three way partitioning of an array around a given range | 2219 |
| 2 | Palindrome Substring Queries | 1833 |
| 3 | Find a sorted subsequence of size 3 in linear time | 1721 |
| 4 | Count minimum steps to get the given desired array | 1612 |
| 5 | Smallest Subarray With all Occurrences of a Most Frequent Element | 1413 |
| 6 | Find Number of Employees Under every Employee | 1265 |
| 7 | Largest area rectangular sub-matrix with equal number of 1’s and 0’s | 1171 |
| 8 | Given a binary tree, how do you remove all the half nodes? | 1150 |
| 9 | Non-overlapping sum of two sets | 1130 |
| 10 | Find missing elements of a range | 1092 |
| 11 | Range sum queries without updates | 1030 |
| 12 | Largest subarray with equal number of 0s and 1s | 970 |
| 13 | Count quadruples from four sorted arrays whose sum is equal to a given value x | 961 |
| 14 | Elements to be added so that all elements of a range are present in array | 804 |
| 15 | Merge Sorted Array | 792 |
| 16 | Check if each internal node of a BST has exactly one child | 782 |
| 17 | Maximum Depth Of Binary Tree | 725 |
