| S.No |
Interview Question |
Number of times candidates experienced this question in interviews |
| 1 | Reverse String Without Temporary Variable | 5928 |
| 2 | Find Triplet in Array With a Given Sum | 3219 |
| 3 | BFS for Disconnected Graph | 2625 |
| 4 | Count of Triplets With Sum Less than Given Value | 2541 |
| 5 | Priority Queue Using Singly Linked List | 2431 |
| 6 | Pair of Positive Negative Values in an Array | 2427 |
| 7 | Distance of nearest cell having 1 in a binary matrix | 1938 |
| 8 | Decode String | 1848 |
| 9 | Removing Spaces from a String using stringstream | 1613 |
| 10 | Longest Common Subsequence with Permutations | 1154 |
| 11 | Check given array of size n can represent BST of n levels or not | 784 |
