S.No |
Interview Question |
Number of times candidates experienced this question in interviews |
1 | Integer to Roman Leetcode Solution | 5324 |
2 | Valid Anagram Leetcode Solution | 4843 |
3 | A Product Array Puzzle | 4092 |
4 | Best Time to Buy and Sell Stock LeetCode Solution | 4000 |
5 | Group Anagrams LeetCode Solution | 3624 |
6 | Minimum number of distinct elements after removing m items | 3197 |
7 | Reversing the First K elements of a Queue | 2863 |
8 | Pairs of Songs With Total Durations Divisible by 60 LeetCode Solution | 2652 |
9 | Group Words With Same Set of Characters | 2641 |
10 | Three way partitioning of an array around a given range | 2540 |
11 | Minimum operation to make all elements equal in array | 2421 |
12 | Convert BST to Min Heap | 1966 |
13 | Coin Change Problem | 1850 |
14 | Find distinct elements common to all rows of a matrix | 1838 |
15 | A Space Optimized DP solution for 0-1 Knapsack Problem | 1660 |
16 | Find whether a subarray is in form of a mountain or not | 1561 |
17 | Swap Kth Node from beginning with Kth Node from End | 1559 |
18 | Minimum sum of multiplications of n numbers | 1240 |
19 | Maximum number of segments of lengths a, b and c | 1156 |
20 | Range sum queries without updates | 1149 |
21 | Maximum weight transformation of a given string | 862 |
22 | Count Pairs Whose Products Exist in Array | 843 |