| S.No |
Interview Question |
Number of times candidates experienced this question in interviews |
| 1 | Sort a stack using a temporary stack | 1500 |
| 2 | Sorting array using Stacks | 1269 |
| 3 | Distinct adjacent elements in an array | 1195 |
| 4 | Design a stack that supports getMin() in O(1) time and O(1) extra space | 1171 |
| 5 | Sort a stack using recursion | 1037 |
| 6 | Longest Span with same Sum in two Binary Arrays II | 1032 |
| 7 | Non-overlapping sum of two sets | 889 |
| 8 | How to check if two given sets are disjoint? | 876 |
| 9 | Count number of triplets with product equal to given number | 804 |
| 10 | Count Primes in Ranges | 751 |
| 11 | Rearrange an array such that ‘arr[j]’ becomes ‘i’ if ‘arr[i]’ is ‘j’ | 701 |
| 12 | Elements to be added so that all elements of a range are present in array | 649 |
| 13 | Longest Span with same Sum in two Binary arrays | 594 |
