| S.No |
Interview Question |
Number of times candidates experienced this question in interviews |
| 1 | Pair of Positive Negative Values in an Array | 1270 |
| 2 | Distance of nearest cell having 1 in a binary matrix | 1144 |
| 3 | Count subarrays having total distinct elements same as original array | 1025 |
| 4 | Count pairs from two sorted arrays whose sum is equal to a given value x | 1008 |
| 5 | Count items common to both the lists but with different prices | 1002 |
| 6 | Convert BST to Min Heap | 915 |
| 7 | Find whether a subarray is in form of a mountain or not | 888 |
| 8 | Longest Common Subsequence with Permutations | 878 |
| 9 | Split Four Distinct Strings | 808 |
| 10 | Queries on Probability of Even or Odd Number in given Ranges | 734 |
| 11 | Collect maximum points in a grid using two traversals | 676 |
| 12 | Newman-Conway Sequence | 673 |
| 13 | Find number of pairs in an array such that their XOR is 0 | 620 |
| 14 | Friends Pairing Problem | 612 |
