# Split & Merge of an array / Divide & Conquer

The last one is similiar to previous category but there is one thing is added. First, you need to split the given list into 2 separate lists and then do two pointers approach to merge or unify them. There aren't many tasks here.<br>

<figure><img src="https://assets.leetcode.com/users/images/1d3c2ed7-95ca-440d-9693-f3e31360b826_1642138190.9125686.jpeg" alt=""><figcaption></figcaption></figure>

* Partition\
  (\*) <https://leetcode.com/problems/partition-list/>
* Sorting\
  (\*) <https://leetcode.com/problems/sort-list/>
