minsubs.ts

function minSubs(integers: number[], k: number): number[] {
  const sums = [];

  for (let i = 0; i < integers.length; i++) {
    if (i + k > integers.length) {
      break;
    }

    let innerSum = 0;
    const innerArray = [];

    for (let j = i; j < i + k; j++) {
      const number = integers[j];

      if (Number.isInteger(number)) {
        innerSum += number;
        innerArray.push(number);
      }
    }

    sums.push({ sum: innerSum, array: innerArray });
  }

  const [minimumPossibleSum] = sums.sort((a, b) => a.sum - b.sum);

  return minimumPossibleSum.array;
}