Hard | Notion
1. Pascal’s Triangle
2. Majority Element (⌊n/3⌋ times)
3. Three (3) Sum Problem
4. Four (4) Sum Problem
5. Largest Subarray with 0 Sum
6. Count number of subarrays with given XOR K
7. Merge Overlapping Subintervals
8. Merge two sorted arrays without extra space
9. Find the repeating and missing number
10. Count Inversions
11. Reverse Pairs
12. Maximum Product Subarray