All challenges

Choose sets covering every element while minimizing total cost.

Construct a permutation whose increasing-subsequence count matches the target value.