Implement `combine(n, k)` returning all `k`-length combinations of the numbers `1..n`, in standard backtracking order.
+ 1 hidden test run on Submit.
Backtracking with a rising start index yields all k-combinations.
Run your code to see results.