| S.No |
Interview Question |
Number of times candidates experienced this question in interviews |
| 1 | Roman to Integer Leetcode Solution | 3839 |
| 2 | Unique Paths Leetcode Solution | 2307 |
| 3 | Find Triplet in Array With a Given Sum | 2280 |
| 4 | A Product Array Puzzle | 2199 |
| 5 | Bellman Ford Algorithm | 2140 |
| 6 | Stock Buy Sell to Maximize Profit | 1807 |
| 7 | Count of Triplets With Sum Less than Given Value | 1757 |
| 8 | Trapping Rain Water Leetcode Solution | 1484 |
| 9 | Decode String Leetcode Solution | 1482 |
| 10 | Word Ladder LeetCode Solution | 1459 |
| 11 | Unique Paths II Leetcode Solution | 1382 |
| 12 | Letter Combinations of a Phone Number | 1371 |
| 13 | Unique Paths | 1265 |
| 14 | Longest Increasing Path in a Matrix LeetCode Solution | 1187 |
| 15 | Clone Graph LeetCode Solution | 1149 |
| 16 | Merge Overlapping Intervals II | 1132 |
| 17 | Interval Tree | 1123 |
| 18 | Best Time to Buy and Sell Stock | 1118 |
| 19 | Rearrange an array in order – smallest, largest, 2nd smallest, 2nd largest | 996 |
| 20 | Container With Most Water LeetCode Solution | 929 |
| 21 | Graph Valid Tree LeetCode Solution | 929 |
| 22 | Binary Tree zigzag level order Traversal | 927 |
| 23 | Trapping Rain Water LeetCode Solution | 916 |
| 24 | Next Permutation LeetCode Solution | 899 |
| 25 | Smallest Subarray With all Occurrences of a Most Frequent Element | 888 |
| 26 | 3 Sum | 865 |
| 27 | My Calendar I LeetCode Solution | 853 |
| 28 | Maximum length subsequence with difference between adjacent elements as either 0 or 1 | 848 |
| 29 | Validate Binary Search Tree | 845 |
| 30 | Word Break | 813 |
