Combinations of n choose k
Given two integers n (1..13) and k (0..n), return all combinations of k numbers chosen from the range 1..n. Each combination is an ascending list and combinations themselves do not repeat. Return the full list sorted ascending; note k = 0 yields a single empty combination.
Implement
combine(n: int, k: int) → list[list[int]]Examples
in
[4,2]out[[1,2],[1,3],[1,4],[2,3],[2,4],[3,4]]What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 20 min
solution.py
InputExpectedGot
[4,2][[1,2],[1,3],[1,4],[2,3],[2,4],[3,4]]not run yetsample