> For the complete documentation index, see [llms.txt](https://liuzhenglaichn.gitbook.io/algorithm/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://liuzhenglaichn.gitbook.io/algorithm/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](https://leetcode.com/tag/divide-and-conquer/)

## Problems

**Problems similar to Merge Sort**

* [315. Count of Smaller Numbers After Self (Hard)](https://leetcode.com/problems/count-of-smaller-numbers-after-self/)
* [493. Reverse Pairs (Hard)](https://leetcode.com/problems/reverse-pairs/)
* [1649. Create Sorted Array through Instructions (Hard)](https://leetcode.com/problems/create-sorted-array-through-instructions/)
* [327. Count of Range Sum (Hard)](https://leetcode.com/problems/count-of-range-sum/)