Faaez Razeen

Combinations

  • 1 min read
  • LC-Medium
  • Backtracking

3 years ago

Solution

TimeSpaceExplanation
O()O()
function combine(n: number, k: number): number[][] { const combinations: number[][] = []; function backtrack (start: number, cur: number[]) { if (cur.length === k) { combinations.push(cur); return; } for (let i = start; i <= n; i++) { backtrack(i + 1, [...cur, i]); } } backtrack(1, []); return combinations; };