Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
- Factor Combinations
Coding
- Find All Combinations of Bag Sizes That Sum to a Target Capacity
Coding
- Find Valid Split-Stay Listing Combinations
Coding
- Letter Combinations of a Phone Number
Coding · Backtracking · Hash Table · String
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 77. Combinations
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source