Function fill

partition_to_k_equal_sum_subsets_698/solution.go:37–70

(subsets []int, idx int, nums []int, target int)

}

func fill(subsets []int, idx int, nums []int, target int) bool {
	if idx < 0 {
		return true
	}

	// choose a value from nums to try to slot into each subset
	pick := nums[idx]
	idx--

	// try to fill each subset
	for i := 0; i < len(subsets); i++ {
		if subsets[i]+pick <= target {
			subsets[i] += pick

			// explore if the subsets current value + chosen value is <= target
			if fill(subsets, idx, nums, target) {
				// if call to fill is true, we were able to partition successfully
				// if not, continue on the search
				return true
			}

			// un-choose the value for the current subset
			subsets[i] -= pick
		}

		// if current subset became 0 from the un-choose, then break
		// this keeps all unfilled subsets on the end and reduces work
		if subsets[i] == 0 {
			break
		}
	}

	return false
}

/*
// First take on the problem without peeking solution.