S.No |
Interview Question |
Number of times candidates experienced this question in interviews |
1 | Check length of a String is Equal to the Number Appended at its Last | 4956 |
2 | Reverse a String using Stack | 2736 |
3 | Implementation of Deque using Doubly Linked List | 1951 |
4 | Convert array into Zig-Zag fashion | 1621 |
5 | Most Frequent Element in an Array | 1595 |
6 | Minimum swaps required to bring all elements less than or equal to k together | 1510 |
7 | Implement a stack using single queue | 1507 |
8 | Maximum Distance Between two Occurrences of Same Element in Array | 1397 |
9 | Difference between highest and least frequencies in an array | 1294 |
10 | How to Implement Stack Using Priority Queue or Heap? | 1238 |
11 | Minimum Operations to convert X to Y | 1235 |
12 | Find the Subarray of given length with Least Average | 1203 |
13 | Iterative Method to find Height of Binary Tree | 1179 |
14 | Reverse a Stack Using Recursion | 1141 |
15 | Check if stack elements are pairwise consecutive | 1131 |
16 | Top K Frequent Words | 1131 |
17 | Tracking current Maximum Element in a Stack | 1100 |
18 | Maximum Consecutive Numbers Present in an Array | 1055 |
19 | Tower Of Hanoi | 1055 |
20 | Stack Permutations (Check if an array is stack permutation of other) | 1050 |
21 | Priority Queue in C++ | 966 |
22 | Morris Traversal | 945 |
23 | Minimum Characters to be Removed to Make a Binary String Alternate | 934 |
24 | Print Fibonacci sequence using 2 variables | 912 |
25 | Remove brackets from an algebraic string containing + and – operators | 907 |
26 | Longest subsequence such that difference between adjacents is one | 905 |
27 | How to Efficiently Implement k Stacks in a Single Array? | 892 |
28 | Maximum Number of Chocolates to be Distributed Equally Among k Students | 874 |
29 | Change the Array into Permutation of Numbers From 1 to N | 872 |
30 | Rearrange array such that even index elements are smaller and odd index elements are greater | 869 |