| S.No |
Interview Question |
Number of times candidates experienced this question in interviews |
| 1 | Palindrome using Recursion | 6983 |
| 2 | Reversing a Queue | 2886 |
| 3 | Count Pairs With Given Sum | 2746 |
| 4 | Smallest Positive Number Missing in an Unsorted Array | 2239 |
| 5 | OSI Model | 2029 |
| 6 | Implementation of Deque using Doubly Linked List | 1951 |
| 7 | Pangram Checking | 1928 |
| 8 | Page Replacement Algorithms in Operating Systems | 1755 |
| 9 | Minimum Characters to be Added at Front to Make String Palindrome | 1750 |
| 10 | Total Numbers With no Repeated Digits in a Range | 1744 |
| 11 | Postfix to Infix Conversion | 1657 |
| 12 | Most Frequent Element in an Array | 1595 |
| 13 | Multiplication of Previous and Next | 1528 |
| 14 | Minimum swaps required to bring all elements less than or equal to k together | 1517 |
| 15 | First Circular Tour to Visit all the Petrol Bunks | 1499 |
| 16 | Prefix to Postfix Conversion | 1481 |
| 17 | Find a Fixed Point in a Given Array | 1468 |
| 18 | Maximum Distance Between two Occurrences of Same Element in Array | 1397 |
| 19 | Next Permutation | 1308 |
| 20 | Minimum Moves to Equal Array Elements Leetcode Solution | 1256 |
| 21 | Minimum Operations to convert X to Y | 1235 |
| 22 | Find elements which are present in first array and not in second | 1229 |
| 23 | Find the Subarray of given length with Least Average | 1203 |
| 24 | Delete Last Occurrence | 1200 |
| 25 | Word Wrap Problem | 1194 |
| 26 | How to Create Mergable Stack? | 1148 |
| 27 | Reverse a Stack Using Recursion | 1141 |
| 28 | Design a stack that supports getMin() in O(1) time and O(1) extra space | 1140 |
| 29 | Check if stack elements are pairwise consecutive | 1131 |
| 30 | Tracking current Maximum Element in a Stack | 1100 |
