ID NAME QUALITY USERS ACC % DIFFICULTY C I
37444 Anti Hash II   1 2
36653 Blind Escape II   3 3
23
28
36671 Bipartite Permutation (Hard)   5 47
29
31
28609 Boat Burglary   12 74
24
26
33372 Lannister Army   8 149
17
31
21457 House Fence   5 132
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