| S.No |
Interview Question |
Number of times candidates experienced this question in interviews |
| 1 | Sort a stack using a temporary stack | 2300 |
| 2 | Design a stack that supports getMin() in O(1) time and O(1) extra space | 2219 |
| 3 | Sorting array using Stacks | 2175 |
| 4 | Distinct adjacent elements in an array | 2084 |
| 5 | Sort a stack using recursion | 1686 |
| 6 | Longest Span with same Sum in two Binary Arrays II | 1388 |
| 7 | Non-overlapping sum of two sets | 1303 |
| 8 | How to check if two given sets are disjoint? | 1262 |
| 9 | Count number of triplets with product equal to given number | 1174 |
| 10 | Count Primes in Ranges | 1098 |
| 11 | Rearrange an array such that ‘arr[j]’ becomes ‘i’ if ‘arr[i]’ is ‘j’ | 1008 |
| 12 | Longest Span with same Sum in two Binary arrays | 972 |
| 13 | Elements to be added so that all elements of a range are present in array | 885 |
