Divide and Conquer
11 problems
Divide and conquer splits a problem into independent sub-problems, solves each recursively, and combines the results. Classic examples: merge sort, quick sort, binary search, and closest pair of points. Master Theorem helps analyze time complexity: T(n) = aT(n/b) + f(n).
- 4.Median of Two Sorted ArraysHard
- 106.Construct Binary Tree from Inorder and Postorder TraversalMedium
- 108.Convert Sorted Array to Binary Search TreeEasy
- 190.Reverse BitsEasy
- 218.The Skyline ProblemHard
- 324.Wiggle Sort IIMedium
- 558.Logical OR of Two Binary Grids Represented as Quad-TreesUnknown
- 889.Construct Binary Tree from Preorder and Postorder TraversalMedium
- 912.Sort an ArrayMedium
- 973.K Closest Points to OriginMedium
- 1382.Balance a Binary Search TreeMedium