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