| S.No |
Interview Question |
Number of times candidates experienced this question in interviews |
| 1 | Palindrome using Recursion | 10987 |
| 2 | Count Pairs With Given Sum | 5383 |
| 3 | Reversing a Queue | 5126 |
| 4 | Total Numbers With no Repeated Digits in a Range | 4405 |
| 5 | Implementation of Deque using Doubly Linked List | 3979 |
| 6 | Postfix to Infix Conversion | 3840 |
| 7 | Page Replacement Algorithms in Operating Systems | 3711 |
| 8 | OSI Model | 3593 |
| 9 | Smallest Positive Number Missing in an Unsorted Array | 3212 |
| 10 | Minimum Operations to convert X to Y | 3089 |
| 11 | Minimum swaps required to bring all elements less than or equal to k together | 3011 |
| 12 | Pangram Checking | 3005 |
| 13 | Prefix to Postfix Conversion | 2919 |
| 14 | Minimum Characters to be Added at Front to Make String Palindrome | 2911 |
| 15 | Most Frequent Element in an Array | 2871 |
| 16 | Next Permutation | 2748 |
| 17 | Maximum Distance Between two Occurrences of Same Element in Array | 2606 |
| 18 | Word Wrap Problem | 2568 |
| 19 | Multiplication of Previous and Next | 2338 |
| 20 | First Circular Tour to Visit all the Petrol Bunks | 2316 |
| 21 | Next Permutation LeetCode Solution | 2277 |
| 22 | Minimum Moves to Equal Array Elements Leetcode Solution | 2275 |
| 23 | Find duplicates in a given array when elements are not limited to a range | 2225 |
| 24 | Longest subsequence such that difference between adjacents is one | 2222 |
| 25 | Design a stack that supports getMin() in O(1) time and O(1) extra space | 2209 |
| 26 | Find a Fixed Point in a Given Array | 2187 |
| 27 | Find elements which are present in first array and not in second | 2069 |
| 28 | Tracking current Maximum Element in a Stack | 1983 |
| 29 | Reverse a Stack Using Recursion | 1983 |
| 30 | Shortest Palindrome | 1911 |
