#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/roadmaps/fundamental-algorithms/backtracking/combinations

░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░█████████████████████████████████████████████████████████████████████████████

#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/roadmaps/fundamental-algorithms/backtracking/combinations

Repovive

Combinations - Backtracking | Fundamental Algorithms | Repovive

Repovive.

Fundamental Algorithms8 sections · 294 units2h total

Open in Course

Combinations

Choose k elements from n.

Problem: Return all combinations of $k$ numbers from $1$ to $n$ .

function backtrack(n, k, start, current, result):
    if current.length == k:
        result.add(copy of current)
        return
    for i from start to n:
        current.add(i)
        backtrack(n, k, i + 1, current, result)
        current.removeLast()

Pruning: Skip if remaining elements $<$ needed: if n - i + 1 < k - current.length: return.

Time: $O(\binom{n}{k} \cdot k)$ . Space: $O(k)$ .