2952-minimum-number-of-coins-to-be-added.js

/**
 * 2952. Minimum Number of Coins to be Added
 * https://leetcode.com/problems/minimum-number-of-coins-to-be-added/
 * Difficulty: Medium
 *
 * You are given a 0-indexed integer array coins, representing the values of the coins available,
 * and an integer target.
 *
 * An integer x is obtainable if there exists a subsequence of coins that sums to x.
 *
 * Return the minimum number of coins of any value that need to be added to the array so that every
 * integer in the range [1, target] is obtainable.
 *
 * A subsequence of an array is a new non-empty array that is formed from the original array by
 * deleting some (possibly none) of the elements without disturbing the relative positions of the
 * remaining elements.
 */

/**
 * @param {number[]} coins
 * @param {number} target
 * @return {number}
 */
var minimumAddedCoins = function(coins, target) {
  coins.sort((a, b) => a - b);
  let result = 0;
  let currentMax = 0;
  let index = 0;

  while (currentMax < target) {
    if (index < coins.length && coins[index] <= currentMax + 1) {
      currentMax += coins[index];
      index++;
    } else {
      currentMax += currentMax + 1;
      result++;
    }
  }

  return result;
};