| S.No |
Interview Question |
Number of times candidates experienced this question in interviews |
| 1 | Valid Anagram Leetcode Solution | 4820 |
| 2 | String Compression LeetCode Solution | 4234 |
| 3 | Decode String Leetcode Solution | 3916 |
| 4 | Group Anagrams LeetCode Solution | 3600 |
| 5 | Insert Delete GetRandom O(1) Leetcode Solution | 3069 |
| 6 | Top K Frequent Elements LeetCode Solution | 3037 |
| 7 | Pair of Positive Negative Values in an Array | 2427 |
| 8 | Destination City Leetcode Solution | 1997 |
| 9 | Minimum Index Sum of Two Lists | 1876 |
| 10 | Sliding Window Maximum LeetCode Solution | 1677 |
| 11 | Construct BST from its given Level Order Traversal | 1559 |
| 12 | Check If a Word Occurs As a Prefix of Any Word in a Sentence Leetcode Solution | 1529 |
| 13 | Filter Restaurants by Vegan-Friendly, Price and Distance Leetcode Solution | 1199 |
| 14 | Insert Delete GetRandom O(1) – Duplicates allowed LeetCode Solution | 850 |
| 15 | Check given array of size n can represent BST of n levels or not | 784 |
