Leetcode 77. Combinations
Generate all k-element subsets from the numbers 1..n — a combinatorial generation problem typically solved with backtracking or lexicographic construction. Expect C(n, k) outputs (n ≤ 20), so the solution must efficiently enumerate all combinations.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Hello Interview Premium
Your account is free and you can post anonymously if you choose.