S.No |
Interview Question |
Number of times candidates experienced this question in interviews |
1 | Concatenation of Array LeetCode Solution | 7694 |
2 | Implementation of Deque using Doubly Linked List | 4011 |
3 | Second Most Repeated Word in a Sequence | 3216 |
4 | Generate all Binary Strings Without Consecutive 1’s | 3108 |
5 | Check whether Strings are K Distance Apart or Not | 2705 |
6 | Implement Stack and Queue using Deque | 2435 |
7 | Smallest Palindrome after Replacement | 2428 |
8 | Maximize sum of consecutive differences in a circular array | 2342 |
9 | Sorting a Queue without Extra Space | 2324 |
10 | Delete a Node from linked list without head pointer | 2301 |
11 | Implementation of Deque using circular array | 2186 |
12 | Compare Two Version Numbers | 2009 |
13 | Maximum path sum in a triangle | 2003 |
14 | Convert BST to Min Heap | 1966 |
15 | Rearrange an array in order – smallest, largest, 2nd smallest, 2nd largest | 1953 |
16 | Smallest Multiple of a Given Number | 1942 |
17 | Sieve of Eratosthenes | 1902 |
18 | Check if String can Become Empty by Recursively Deleting given Substring | 1843 |
19 | Check if Two given Strings are Isomorphic to each other | 1827 |
20 | Merge Two Balanced Binary Search Trees | 1754 |
21 | Caesar Cipher | 1738 |
22 | Find Zeros to be Flipped so that Number of Consecutive 1’s is Maximized | 1668 |
23 | Merge K Sorted Arrays and Print Sorted Output | 1662 |
24 | Count items common to both the lists but with different prices | 1570 |
25 | Count ways to reach the nth stair using step 1, 2 or 3 | 1566 |
26 | Construct BST from its given Level Order Traversal | 1565 |
27 | Depth First Search (DFS) for a Graph | 1543 |
28 | Concatenation of Array LeetCode Solution | 1523 |
29 | Minimum number of subsets with distinct elements | 1514 |
30 | Find all triplets with zero sum | 1458 |