Home Roadmap Courses Problems Dashboard Pricing

Home Roadmap Courses Problems Dashboard Pricing

Loading editor…

Problem 167

Combinations

MediumBacktracking

Return every combination of k distinct integers chosen from 1..n. Each combination is sorted, and the list of combinations is in lexicographic order.

Examples

Example 1

Input: [4,2]

Output: [[1,2],[1,3],[1,4],[2,3],[2,4],[3,4]]

Example 2

Input: [1,1]

Output: [[1]]

Constraints

Inputs fit in standard 32-bit integers unless noted.

Target ComplexityNot required

exponential Time · O(depth) Space

Companies (6)

AmazonGoogleMetaMicrosoftAppleBloomberg

Node 22.08.0

Loading editor…

Test casesRun to compare output

Input[4,2]

Expected[[1,2],[1,3],[1,4],[2,3],[2,4],[3,4]]

Output—