| S.No |
Interview Question |
Number of times candidates experienced this question in interviews |
| 1 | Integer to Roman Leetcode Solution | 2766 |
| 2 | A Product Array Puzzle | 2223 |
| 3 | Valid Anagram Leetcode Solution | 1952 |
| 4 | Minimum number of distinct elements after removing m items | 1763 |
| 5 | Best Time to Buy and Sell Stock LeetCode Solution | 1723 |
| 6 | Group Words With Same Set of Characters | 1507 |
| 7 | Group Anagrams LeetCode Solution | 1453 |
| 8 | Reversing the First K elements of a Queue | 1403 |
| 9 | Minimum operation to make all elements equal in array | 1383 |
| 10 | Three way partitioning of an array around a given range | 1302 |
| 11 | Pairs of Songs With Total Durations Divisible by 60 LeetCode Solution | 1101 |
| 12 | Swap Kth Node from beginning with Kth Node from End | 1073 |
| 13 | Find distinct elements common to all rows of a matrix | 1042 |
| 14 | Coin Change Problem | 985 |
| 15 | Convert BST to Min Heap | 903 |
| 16 | Find whether a subarray is in form of a mountain or not | 874 |
| 17 | A Space Optimized DP solution for 0-1 Knapsack Problem | 813 |
| 18 | Range sum queries without updates | 775 |
| 19 | Minimum sum of multiplications of n numbers | 668 |
| 20 | Maximum number of segments of lengths a, b and c | 604 |
| 21 | Maximum weight transformation of a given string | 601 |
| 22 | Count Pairs Whose Products Exist in Array | 530 |
