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:

• $1 \leq$ n $\leq 20$

• $1 \leq$ k $\leq n$

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.