How should I practice Closest Subsequence Sum?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Salesforce online assessment problems in FastPrep.

Is Closest Subsequence Sum associated with Salesforce?

FastPrep tags this as a Salesforce coding interview or online assessment practice problem when the problem catalog has that company context.

Problem · Array

Closest Subsequence Sum

Learn this problem

● HardSalesforceFULLTIMEOA

See Salesforce hiring insights

Problem statement

You are given an integer array nums and an integer goal.

You want to choose a subsequence of nums such that the sum of its elements is the closest possible to goal. That is, if the sum of the subsequence's elements is sum, then you want to minimize the absolute difference abs(sum - goal).

Return the minimum possible value of abs(sum - goal).

Note that a subsequence of an array is an array formed by removing some elements (possibly all or none) of the original array.

Function

minAbsDifference(nums: int[], goal: int) → int

Examples

Example 1

nums = [5, -7, 3, 5]goal = 6return = 0

Choose the whole array as a subsequence, with a sum of 6. This is equal to the goal, so the absolute difference is 0.

Example 2

nums = [7, -9, 15, -2]goal = -5return = 1

Choose the subsequence [7, -9, -2], with a sum of -4. The absolute difference is abs(-4 - (-5)) = abs(1) = 1, which is the minimum.

Example 3

nums = [1, 2, 3]goal = -7return = 7

No subsequence can get closer than an absolute difference of 7 from the goal.

Constraints

1 <= nums.length <= 40
-10^7 <= nums[i] <= 10^7
-10^9 <= goal <= 10^9