| S.No |
Interview Question |
Number of times candidates experienced this question in interviews |
| 1 | Print all Possible Combinations of R Elements in a given Array of size N | 5473 |
| 2 | Reversing a Queue | 5126 |
| 3 | Word Wrap Problem | 2567 |
| 4 | Design a stack that supports getMin() in O(1) time and O(1) extra space | 2209 |
| 5 | Compare Two Version Numbers | 1998 |
| 6 | Path with maximum average value | 1848 |
| 7 | Check if String Follows Order of Characters by a Pattern or not | 1645 |
| 8 | Find pairs with given sum such that elements of pair are in different rows | 1331 |
| 9 | Size of The Subarray With Maximum Sum | 1312 |
| 10 | Find Sum of all unique sub-array sum for a given array | 1289 |
| 11 | Find missing elements of a range | 1252 |
| 12 | Binary array after M range toggle operations | 1189 |
| 13 | Mean of range in array | 1114 |
| 14 | Largest subarray with equal number of 0s and 1s | 1096 |
| 15 | Find the Only Repetitive Element Between 1 to N-1 | 1082 |
| 16 | A program to check if a binary tree is BST or not | 1034 |
| 17 | Check if all levels of two Binary Tree are anagrams or not | 1026 |
| 18 | Numbers with prime frequencies greater than or equal to k | 922 |
| 19 | Elements to be added so that all elements of a range are present in array | 881 |
| 20 | Number of indexes with equal elements in given range | 790 |
