S.No |
Interview Question |
Number of times candidates experienced this question in interviews |
1 | Printing brackets in Matrix Chain Multiplication Problem | 1714 |
2 | Minimum operation to make all elements equal in array | 1375 |
3 | Maximum possible difference of two subsets of an array | 1147 |
4 | Check if Array Contains Contiguous Integers With Duplicates Allowed | 1086 |
5 | Generate all possible sorted arrays from alternate elements of two given sorted arrays | 978 |
6 | Find all pairs (a, b) in an array such that a % b = k | 946 |
7 | Find Maximum of Minimum for Every Window Size in a Given Array | 921 |
8 | Difference Array | Range update query in O(1) | 898 |
9 | Largest rectangular sub-matrix whose sum is 0 | 896 |
10 | Check if any two intervals overlap among a given set of intervals | 895 |
11 | Subset with sum divisible by m | 875 |
12 | Find Three Element From Different Three Arrays Such That a + b + c = sum | 785 |
13 | Binomial Coefficient | 730 |
14 | Range LCM Queries | 729 |
15 | Find pairs with given sum such that elements of pair are in different rows | 677 |
16 | Maximum sum of a path in a Right Number Triangle | 653 |
17 | Minimum insertions to form a palindrome with permutations allowed | 638 |
18 | Queries on XOR of greatest odd divisor of the range | 610 |
19 | Largest Submatrix With Rearrangements LeetCode Solution | 585 |
20 | Cutting a Rod | 542 |
21 | Constant time range add operation on an array | 535 |
22 | Maximum Subarray Sum Excluding Certain Elements | 511 |