| S.No |
Interview Question |
Number of times candidates experienced this question in interviews |
| 1 | Subarray with 0 sum | 1747 |
| 2 | Maximum Sum of Non Consecutive Elements | 1380 |
| 3 | Even Substring Count | 1264 |
| 4 | Find Index of Closing Bracket for a Given Opening Bracket in an Expression | 1223 |
| 5 | Distinct adjacent elements in an array | 1194 |
| 6 | Count Substrings with equal number of 0s, 1s and 2s | 1005 |
| 7 | Largest Sum Contiguous Subarray | 968 |
| 8 | Rearrange array such that even positioned are greater than odd | 950 |
| 9 | Print all subarrays with 0 sum | 946 |
| 10 | Minimum number of jumps to reach end | 935 |
| 11 | Smallest Subarray With all Occurrences of a Most Frequent Element | 905 |
| 12 | Inorder Successor of a node in Binary Tree | 853 |
| 13 | Count the Pairs at Same Distance as in English Alphabets | 829 |
| 14 | Check if the given array can represent Level Order Traversal of Binary Search Tree | 799 |
| 15 | Topological Sorting | 725 |
| 16 | A program to check if a binary tree is BST or not | 661 |
| 17 | Maximum Array from Two given Arrays Keeping Order Same | 597 |
| 18 | Binary Tree to Binary Search Tree Conversion using STL set | 479 |
