S.No |
Interview Question |
Number of times candidates experienced this question in interviews |
1 | Print all Possible Combinations of R Elements in a given Array of size N | 3343 |
2 | Reversing a Queue | 2886 |
3 | Compare Two Version Numbers | 1239 |
4 | Word Wrap Problem | 1194 |
5 | Design a stack that supports getMin() in O(1) time and O(1) extra space | 1134 |
6 | Check if String Follows Order of Characters by a Pattern or not | 1031 |
7 | Size of The Subarray With Maximum Sum | 1016 |
8 | Path with maximum average value | 945 |
9 | Find missing elements of a range | 780 |
10 | Largest subarray with equal number of 0s and 1s | 710 |
11 | Find the Only Repetitive Element Between 1 to N-1 | 697 |
12 | Numbers with prime frequencies greater than or equal to k | 684 |
13 | Binary array after M range toggle operations | 680 |
14 | Find pairs with given sum such that elements of pair are in different rows | 676 |
15 | Mean of range in array | 674 |
16 | Find Sum of all unique sub-array sum for a given array | 665 |
17 | A program to check if a binary tree is BST or not | 651 |
18 | Elements to be added so that all elements of a range are present in array | 641 |
19 | Check if all levels of two Binary Tree are anagrams or not | 593 |
20 | Number of indexes with equal elements in given range | 538 |