S.No |
Interview Question |
Number of times candidates experienced this question in interviews |
1 | Number Of 1 bits | 3249 |
2 | String to Integer (atoi) LeetCode Solution | 2532 |
3 | Quick Sort | 2309 |
4 | Implementation of Deque using Doubly Linked List | 1986 |
5 | Valid Anagram Leetcode Solution | 1921 |
6 | Find the Duplicate Number LeetCode Solution | 1805 |
7 | Delete Node in a Linked List Leetcode Solution | 1548 |
8 | Find Duplicates in an Array in Most Efficient Way | 1479 |
9 | Move All the Zeros to the End of the Given Array | 1422 |
10 | Remove Duplicates from Sorted List LeetCode Solution | 1421 |
11 | Implement Stack and Queue using Deque | 1381 |
12 | Reverse a linked list | 1338 |
13 | Sorting a Queue without Extra Space | 1226 |
14 | Sort 0s 1s and 2s in an Array | 1139 |
15 | Smallest Multiple of a Given Number | 1108 |
16 | Sieve of Eratosthenes | 1076 |
17 | Sequences of given length where every element is more than or equal to twice of previous | 1052 |
18 | Intersection of Two Linked Lists LeetCode Solution | 1046 |
19 | Find distinct elements common to all rows of a matrix | 1035 |
20 | Rearrange an array in order – smallest, largest, 2nd smallest, 2nd largest | 1000 |
21 | Find Nth Node | 925 |
22 | Find Number of Employees Under every Employee | 915 |
23 | Difference Array | Range update query in O(1) | 898 |
24 | Check if any two intervals overlap among a given set of intervals | 895 |
25 | K maximum sums of overlapping contiguous sub-arrays | 811 |
26 | A Space Optimized DP solution for 0-1 Knapsack Problem | 807 |
27 | Find whether an array is subset of another array | 788 |
28 | Rectangle Overlap LeetCode Solution | 768 |
29 | Advantages of BST over Hash Table | 752 |
30 | Binary Search Tree Delete Operation | 716 |