# Minimum Operations to Form Subsequence With Target Sum (LeetCode 2690)
## Approach
Greedy bit bucket from largest power of two.
## Edge cases
Target not reachable; single bit.
## Practice tip
Name invariants as you type.
Interview prep: [real-time interview help](https://www.linkjob.ai/interview-copilot/).