Algorithm · Salesforce · Hard
An integer array nums and an integer goal are provided. For any subsequence of nums, let s be the sum of its elements. You need to choose a subsequence that makes $$ s - goal $$ as small as possible, then return that minimum value. A subsequence is formed by deleting zero or more elements from nums; the remaining elements keep their original relative order. The empty subsequence is allowed and has sum 0. Example 1: Explanation: The subsequence [2, -1, 3] sums to 4, matching…
Checking your access…