| S.No |
Interview Question |
Number of times candidates experienced this question in interviews |
| 1 | Prefix to Infix Conversion | 3003 |
| 2 | Printing brackets in Matrix Chain Multiplication Problem | 2699 |
| 3 | Check if a given array contains duplicate elements within k distance from each other | 1919 |
| 4 | Longest subsequence such that difference between adjacents is one | 1880 |
| 5 | Find a sorted subsequence of size 3 in linear time | 1721 |
| 6 | Longest Repeated Subsequence | 1692 |
| 7 | Rearrange array such that even index elements are smaller and odd index elements are greater | 1532 |
| 8 | Pair with given product | 1392 |
| 9 | Iterative Depth First Traversal of Graph | 1162 |
| 10 | Count pairs from two linked lists whose sum is equal to a given value | 1156 |
| 11 | Priority Queue | 827 |
