| S.No |
Interview Question |
Number of times candidates experienced this question in interviews |
| 1 | Minimum number of distinct elements after removing m items | 3188 |
| 2 | Word Wrap Problem | 2568 |
| 3 | A Space Optimized DP solution for 0-1 Knapsack Problem | 1639 |
| 4 | Sort 0s 1s and 2s in an Array | 1592 |
| 5 | Maximum difference between two elements such as larger element comes after smaller | 1590 |
| 6 | Largest Sum Contiguous Subarray | 1527 |
| 7 | String comparison containing wildcards | 1378 |
| 8 | Compute nCr % p | 1259 |
| 9 | Maximum difference between first and last indexes of an element in array | 1141 |
| 10 | Print modified array after multiple array range increment operations | 967 |
| 11 | Maximum weight transformation of a given string | 857 |
| 12 | Count Pairs Whose Products Exist in Array | 839 |
