Problem 2835 · Hard

Minimum Operations to Form Subsequence With Target Sum

Build the target bit by bit from the lowest bit, splitting the smallest larger power of two when a bit is missing.

Open the interactive visualisation