Leetcode 3685. Subsequence Sum After Capping Elements

For each x from 1..n, determine whether the target k can be formed as a subsequence sum from the array obtained by replacing each nums[i] with min(nums[i], x). In other words, it's n repeated subset-sum feasibility checks on arrays with nondecreasing capped values (n, k ≤ 4000), requiring an efficient way to reuse work across caps.