S.No |
Interview Question |
Number of times candidates experienced this question in interviews |
1 | Reversing a Queue | 2936 |
2 | Reverse a String using Stack | 2804 |
3 | OSI Model | 2067 |
4 | Longest Palindrome can be Formed by Removing or Rearranging Characters | 1572 |
5 | Maximum Distance Between two Occurrences of Same Element in Array | 1429 |
6 | Check if String can Become Empty by Recursively Deleting given Substring | 1369 |
7 | Find elements which are present in first array and not in second | 1281 |
8 | Compare Two Version Numbers | 1248 |
9 | Longest subarray not having more than K distinct elements | 1176 |
10 | Check if stack elements are pairwise consecutive | 1148 |
11 | The Stock Span Problem | 1136 |
12 | Tiling Problem | 1009 |
13 | Shortest Palindrome | 992 |
14 | Bubble sort using two Stacks | 976 |
15 | Types of Binary Tree | 941 |
16 | Print Fibonacci sequence using 2 variables | 925 |
17 | Change the Array into Permutation of Numbers From 1 to N | 883 |
18 | Find subarray with given sum (Handles Negative Numbers) | 867 |
19 | Insertion in a Binary Tree | 857 |
20 | Group Multiple Occurrence of Array Elements Ordered by first Occurrence | 814 |
21 | Find missing elements of a range | 784 |
22 | Maximum subsequence sum such that no three are consecutive | 745 |
23 | Find Largest d in Array such that a + b + c = d | 738 |
24 | Ugly Numbers | 718 |
25 | Find the minimum distance between two numbers | 716 |
26 | Rearrange an array such that ‘arr[j]’ becomes ‘i’ if ‘arr[i]’ is ‘j’ | 701 |
27 | Find the Only Repetitive Element Between 1 to N-1 | 699 |
28 | Graph and its representation | 665 |
29 | Maximum sum of pairs with specific difference | 625 |
30 | Maximum Array from Two given Arrays Keeping Order Same | 595 |