2835. Minimum Operations to Form Subsequence With Target Sum

You are given a 0-indexed array nums consisting of non-negative powers of 2, and an integer target. In one operation, you must apply the following changes to the array: - Choose any element of the array nums[i] such that nums[i] > 1. - Remove nums[i] from the array. - Add two occurrences of nums[i] / 2 to the end of nums. Return the minimum number of operations you need to perform so that num