S.No |
Interview Question |
Number of times candidates experienced this question in interviews |
1 | String Compression LeetCode Solution | 2106 |
2 | Valid Anagram Leetcode Solution | 1921 |
3 | Decode String Leetcode Solution | 1498 |
4 | Group Anagrams LeetCode Solution | 1443 |
5 | Top K Frequent Elements LeetCode Solution | 1321 |
6 | Pair of Positive Negative Values in an Array | 1262 |
7 | Destination City Leetcode Solution | 1136 |
8 | Insert Delete GetRandom O(1) Leetcode Solution | 1080 |
9 | Minimum Index Sum of Two Lists | 905 |
10 | Check If a Word Occurs As a Prefix of Any Word in a Sentence Leetcode Solution | 875 |
11 | Construct BST from its given Level Order Traversal | 872 |
12 | Sliding Window Maximum LeetCode Solution | 802 |
13 | Filter Restaurants by Vegan-Friendly, Price and Distance Leetcode Solution | 673 |
14 | Check given array of size n can represent BST of n levels or not | 518 |
15 | Insert Delete GetRandom O(1) – Duplicates allowed LeetCode Solution | 393 |