Problem 2735 · Medium

Collecting Chocolates

Each rotation shifts every chocolate type by one index for a fixed cost; find the cheapest number of rotations plus purchases that collects every type.

Open the interactive visualisation