Given a list of integers and a target number, the problem is to find the closest subsequence of that list that add up to the target number, return the sum of that subsequence
Given an array of 0s and 1s and an integer k, the problem is to find the minimum number of times a k-length sequence of bits need to be flipped (i.e. 0s to 1s or 1s to 0s) in order to obtain an array of all 1s
Given an array of integers, the problem is to find the minimum number of operations needed to make all the integers in the array 0 by performing only one bit operation (flipping one bit) at a time