| S.No |
Interview Question |
Number of times candidates experienced this question in interviews |
| 1 | Move all negative elements to one side of array | 4974 |
| 2 | Count Pairs With Given Sum | 2816 |
| 3 | First element occurring k times in an array | 2683 |
| 4 | Find a Fixed Point in a Given Array | 1484 |
| 5 | Iterative Method to find Height of Binary Tree | 1199 |
| 6 | Distinct adjacent elements in an array | 1185 |
| 7 | Sort 0s 1s and 2s in an Array | 1146 |
| 8 | Maximum difference between two elements such as larger element comes after smaller | 1131 |
| 9 | Check for Balanced Parentheses in an Expression | 1002 |
| 10 | Balanced Expression with Replacement | 967 |
| 11 | Largest Sum Contiguous Subarray | 965 |
| 12 | Minimum Characters to be Removed to Make a Binary String Alternate | 941 |
| 13 | Count pair with Given Sum | 928 |
| 14 | Find Nth Node | 927 |
| 15 | Print Fibonacci sequence using 2 variables | 925 |
| 16 | Check if Two Expressions With Brackets are Same | 904 |
| 17 | Non-overlapping sum of two sets | 885 |
| 18 | How to check if two given sets are disjoint? | 872 |
| 19 | Find all triplets with zero sum | 870 |
| 20 | Maximum difference between first and last indexes of an element in array | 811 |
| 21 | Level order traversal using two Queues | 805 |
| 22 | Rearrange a binary string as alternate x and y occurrences | 764 |
| 23 | Boundary Traversal of binary tree | 759 |
| 24 | Count Primes in Ranges | 742 |
| 25 | Sum of f(a[i], a[j]) over all pairs in an array of n integers | 727 |
