| S.No |
Interview Question |
Number of times candidates experienced this question in interviews |
| 1 | Minimum number of distinct elements after removing m items | 1727 |
| 2 | Word Wrap Problem | 1194 |
| 3 | Sort 0s 1s and 2s in an Array | 1131 |
| 4 | Maximum difference between two elements such as larger element comes after smaller | 1129 |
| 5 | Largest Sum Contiguous Subarray | 960 |
| 6 | String comparison containing wildcards | 880 |
| 7 | Maximum difference between first and last indexes of an element in array | 806 |
| 8 | A Space Optimized DP solution for 0-1 Knapsack Problem | 805 |
| 9 | Compute nCr % p | 778 |
| 10 | Maximum weight transformation of a given string | 599 |
| 11 | Print modified array after multiple array range increment operations | 589 |
| 12 | Count Pairs Whose Products Exist in Array | 529 |
