| S.No |
Interview Question |
Number of times candidates experienced this question in interviews |
| 1 | Concatenation of Array LeetCode Solution | 3610 |
| 2 | Implementation of Deque using Doubly Linked List | 2049 |
| 3 | Generate all Binary Strings Without Consecutive 1’s | 1872 |
| 4 | Second Most Repeated Word in a Sequence | 1824 |
| 5 | Smallest Palindrome after Replacement | 1542 |
| 6 | Implement Stack and Queue using Deque | 1405 |
| 7 | Check if String can Become Empty by Recursively Deleting given Substring | 1378 |
| 8 | Delete a Node from linked list without head pointer | 1355 |
| 9 | Implementation of Deque using circular array | 1344 |
| 10 | Check whether Strings are K Distance Apart or Not | 1329 |
| 11 | Compare Two Version Numbers | 1259 |
| 12 | Caesar Cipher | 1258 |
| 13 | Sorting a Queue without Extra Space | 1245 |
| 14 | Merge K Sorted Arrays and Print Sorted Output | 1197 |
| 15 | Maximum path sum in a triangle | 1167 |
| 16 | Check if Two given Strings are Isomorphic to each other | 1127 |
| 17 | Smallest Multiple of a Given Number | 1116 |
| 18 | Sieve of Eratosthenes | 1081 |
| 19 | Find Zeros to be Flipped so that Number of Consecutive 1’s is Maximized | 1074 |
| 20 | Rearrange an array in order – smallest, largest, 2nd smallest, 2nd largest | 1014 |
| 21 | Merge Two Balanced Binary Search Trees | 1009 |
| 22 | Count items common to both the lists but with different prices | 1002 |
| 23 | Count ways to reach the nth stair using step 1, 2 or 3 | 981 |
| 24 | Find Number of Employees Under every Employee | 925 |
| 25 | Convert BST to Min Heap | 915 |
| 26 | Construct BST from its given Level Order Traversal | 890 |
| 27 | Depth First Search (DFS) for a Graph | 878 |
| 28 | Maximize sum of consecutive differences in a circular array | 876 |
| 29 | Find all triplets with zero sum | 871 |
| 30 | Find subarray with given sum (Handles Negative Numbers) | 869 |
