ID NAME QUALITY USERS ACC % DIFFICULTY C I
36653 Blind Escape II   2 2
17
34
36671 Bipartite Permutation (Hard)   2 3
26
34
28609 Boat Burglary   11 68
21
23
33372 Lannister Army   4 94
9
34
21457 House Fence   5 125
9
21

#divide-and-conquer

Divide and conquer is an algorithm design paradigm based on multi-branched recursion. It works by recursively breaking down a problem into two or more sub-problems of the same (or related) type (divide), until these become simple enough to be solved directly (conquer

https://en.wikipedia.org/wiki/Divide_and_conquer_algorithms