divide-and-conquer.md

Divide And Conquer

Solution template for the divide and conquer problems:

• Define the base case(s).
• Split the problem into subproblems and solve them recursively.
• Merge the solutions for the subproblems to obtain the solution for the original problem.

See all the related problems here

Problems

Problems similar to Merge Sort

• 315. Count of Smaller Numbers After Self (Hard)
• 493. Reverse Pairs (Hard)
• 1649. Create Sorted Array through Instructions (Hard)
• 327. Count of Range Sum (Hard)