...

/

Solution: Combinations

Solution: Combinations

Let’s solve the Combinations problem using the Backtracking pattern.

Statement

You are given two integers, n and k. Your task is to return all possible combinations of k numbers chosen from the range [1, n].

The result can be returned in any order.

Note: Combinations are unordered, i.e., [1, 2] and [2, 1] are considered the same combination.

Constraints:

  • 11 \leq n 20\leq 20

  • 11 \leq k n\leq n ...