Divide and Conquer
Problems on divide and conquer, including splitting an array in halves and combining the answers, counting inversions with merge sort, closest pair of points, recursive patterns and fractals, and fast exponentiation.
The recursion and sorting articles in the Basics section cover the building blocks. Related problem sets are under Sorting and Dynamic programming optimization.
Problems
Mowing Mischief#10352
Very hard
New Barns#10415
Very hard
Secret Cow Code#10549
Medium
Rule 110#10723
Very hard
Lemurs rearrangement#11124
Very hard
Fencing the Herd#11184
Very hard
BinCoin#11321
Easy
From XOR with love#11546
Very hard
Doya and XOR#11855
Medium
Clutch or kick#12200
Very hard
Alina and the Mountains#12241
Very hard