S.No |
Interview Question |
Number of times candidates experienced this question in interviews |
1 | Check length of a String is Equal to the Number Appended at its Last | 5089 |
2 | Backspace String Compare | 2035 |
3 | Count all subsequences having product less than K | 1939 |
4 | Maximum Sum Increasing Subsequence | 1484 |
5 | Painting Fence Algorithm | 1230 |
6 | Maximum path sum in a triangle | 1168 |
7 | LCS (Longest Common Subsequence) of three strings | 1124 |
8 | Sequences of given length where every element is more than or equal to twice of previous | 1056 |
9 | Count ways to reach the nth stair using step 1, 2 or 3 | 981 |
10 | Difference Array | Range update query in O(1) | 907 |
11 | Largest rectangular sub-matrix whose sum is 0 | 902 |
12 | Matrix Chain Multiplication | 859 |
13 | Find maximum length Snake sequence | 842 |
14 | A Space Optimized DP solution for 0-1 Knapsack Problem | 834 |
15 | K maximum sums of overlapping contiguous sub-arrays | 822 |
16 | Number of palindromic paths in a matrix | 813 |
17 | Longest Increasing Subsequence | 801 |
18 | The Painter’s Partition Problem | 756 |
19 | Number of siblings of a given Node in n-ary Tree | 744 |
20 | Red-Black Tree Introduction | 697 |
21 | Longest Bitonic Subsequence | 650 |
22 | Minimum insertions to form a palindrome with permutations allowed | 642 |
23 | Priority Queue | 606 |
24 | Maximum weight transformation of a given string | 601 |
25 | Range Queries for Longest Correct Bracket Subsequence | 568 |
26 | Segment Tree | 560 |
27 | Constant time range add operation on an array | 546 |
28 | Number of elements less than or equal to a given number in a given subarray | 528 |
29 | Maximum Subarray Sum Excluding Certain Elements | 513 |