Advanced Algorithm Design · Algorithm Design

Backtracking Algorithm

Backtracking explores choices recursively, abandons paths that cannot work, and returns to try alternatives.

Enroll Now Text Us Contact Code Scholars Full DSA Course

Student Focus

We teach students to draw the choice tree before writing recursive code.

Guided Lesson Notes

Understanding Backtracking Algorithm

Backtracking Algorithm focuses on algorithmic reasoning, correctness, and choosing the right structure before writing code. Backtracking explores choices recursively, abandons paths that cannot work, and returns to try alternatives.

The mental model is this: start with inputs and outputs, then decide what information must be remembered at each step. That picture matters because it tells the student what information is available immediately and what must be searched, stored, or recomputed.

The core invariant is that every step must preserve the meaning of the variables and move measurably closer to the goal. If a solution cannot state that rule, the code may still run on a sample input but fail on edge cases.

A strong implementation usually uses pseudocode, traces, helper functions, tests, and complexity checks. The goal is not just to memorize an API; the goal is to know why each operation is allowed and what it costs.

In competitive programming, Backtracking Algorithm tends to appear when the problem is less about syntax and more about selecting a strategy that scales. Spotting that signal is often the difference between a nested-loop solution and an efficient one.

Visual Model

A small picture for Backtracking Algorithm

Model

Trace

Analyze

Key Ideas

Choice tree
Constraint checks
Undoing state

Practice Prompts

Generate all subsets of a small set.
Write a backtracking solver for a simple constraint puzzle.

Vocabulary

Terms students should be able to say clearly

Input

The data the algorithm receives.

Output

The result the algorithm must produce.

Precondition

A fact that must be true before the algorithm runs.

Correctness

Why the algorithm always returns the required answer.

Complexity

How time and memory grow with input size.

Tradeoff

A choice where improving one cost may worsen another.

Worked Example

Worked example: tracing Backtracking Algorithm

Use a tiny input and focus on choice tree. The goal is to see how the topic changes state before scaling it to a full problem.

1Write a small input where Backtracking Algorithm is clearly useful.
2Label the part of the input related to Choice tree.
3Perform one operation and explain which invariant is still true afterward.
4Run a second operation that touches an edge case, such as an empty side, duplicate value, boundary index, disconnected vertex, or tie.
5Finish by saying which operation dominates the runtime and why.

Complexity Check

Costs students should be able to explain

Operation	Typical Cost	Reason
Trace a small input	Small n	Use a tiny example to understand state changes before coding.
Implement the core idea	Depends on topic	Choose data structures that match the operations you need.
Analyze growth	Big-O	Explain how work changes as the input gets larger.

Common Mistakes

What to watch while practicing

Coding before drawing the structure or state changes.
Forgetting the invariant that makes the algorithm correct.
Testing only the sample input and skipping boundary cases.
Giving Big-O without explaining which operation dominates the work.

Interview-Style Coding Problem

Backtracking Algorithm interview problem: Combination Sum Count

Interview medium

Problem

Given distinct candidate numbers and a target, count how many unique nondecreasing combinations sum to the target. A candidate may be reused.

Input

The first line contains n and target. The second line contains n distinct positive integers.

Output

Print the number of valid combinations.

Sample Input

4 7
2 3 6 7

Sample Output

Why the sample works

The valid combinations are 2 + 2 + 3 and 7.

Approach

1Sort candidates so recursive choices stay in nondecreasing order.
2At each step choose an index at or after the current index.
3Reuse the same index when the candidate can be picked again.
4Stop a branch when the remaining target becomes 0 or negative.

Exponential in the number of combinations, with pruning from sorting.

Java Solution

import java.util.*;

public class Main {
  static int[] candidates;

  static int countWays(int start, int remaining) {
    if (remaining == 0) return 1;
    int ways = 0;

    for (int i = start; i < candidates.length; i++) {
      if (candidates[i] > remaining) break;
      ways += countWays(i, remaining - candidates[i]);
    }

    return ways;
  }

  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int n = sc.nextInt();
    int target = sc.nextInt();
    candidates = new int[n];
    for (int i = 0; i < n; i++) candidates[i] = sc.nextInt();

    Arrays.sort(candidates);
    System.out.println(countWays(0, target));
  }
}

Python Solution

n, target = map(int, input().split())
candidates = sorted(map(int, input().split()))

def count_ways(start, remaining):
    if remaining == 0:
        return 1

    ways = 0
    for i in range(start, n):
        if candidates[i] > remaining:
            break
        ways += count_ways(i, remaining - candidates[i])
    return ways

print(count_ways(0, target))

Practice Challenge

Make the idea your own

Create a two-minute explanation of Backtracking Algorithm: define it, trace one example, name one edge case, and give the runtime of the main operation.

Tutoring Connection

Turn the topic into usable problem-solving skill

Students can use this page before a lesson, after a difficult homework assignment, or while preparing for AP Computer Science A extensions, Advanced Topics in CS, USACO growth, or a college data structures course.

Schedule Free Consultation Text Us Open Online Compiler