1 |
Maximum circular subarray sum |
Kadane's Algorithm |
2 |
Find subarray with given sum |
Hashing |
3 |
Equilibrium index of an array |
None |
4 |
Maximum Sum Increasing Subsequence |
Simple DP |
5 |
K-Concatenation |
Kadane's Algorithm |
6 |
Convert array into Zig-Zag fashion |
None |
7 |
Find a pair with the given difference |
Hashing |
8 |
Chocolate Distribution Problem |
None |
9 |
Minimum Number of Platforms Required for a Railway/Bus Station |
None |
10 |
Trapping Rain Water |
None |
11 |
Stock Buy Sell to Maximize Profit |
None |
12 |
Rotate by 90 degree |
None |
13 |
Find k pairs with smallest sums in two arrays |
None |
14 |
Search in a Rotated Array |
None |
15 |
Given a sorted and rotated array, find if there is a pair with a given sum |
None |
16 |
Max sum in the configuration |
None |
17 |
Array of alternate +ve and -ve no.s |
Caution: When submitting the solution WA as they have not given clarity on how the array has to be change although the code changes the array as specified in the question |
18 |
Three way partitioning |
Dutch National Flag Quick Sort |
19 |
Sort an array of 0s, 1s and 2s |
Dutch National Flag Quick Sort |
20 |
Maximum length Bitonic Subarray |
In O(n) space |
21 |
Maximum length Bitonic Subarray |
In O(1) space |
22 |
Count Square Submatrices with All Ones |
None |