Why Backtracking and What Greedy Cannot Solve in DSA Python - Challenge Your Understanding

Challenge - 5 Problems

🧠 Conceptual

intermediate

Why can't greedy algorithms solve all problems?

Which of the following best explains why greedy algorithms sometimes fail to find the best solution?

A Greedy algorithms guarantee the best solution by checking every option.

B Greedy algorithms always explore all possible solutions, which is inefficient.

C Greedy algorithms use backtracking to correct wrong choices.

D Greedy algorithms make decisions based only on local information without considering future consequences.

💡 Hint

Think about how greedy algorithms choose their next step.

Greedy algorithms pick the best immediate choice without looking ahead, so they can miss better overall solutions.

❓ Predict Output

intermediate

Output of backtracking solving subset sum

What is the output of the following Python code that uses backtracking to find subsets summing to 5?

DSA Python

def backtrack(nums, target, start, path, res):
    if target == 0:
        res.append(path[:])
        return
    if target < 0:
        return
    for i in range(start, len(nums)):
        path.append(nums[i])
        backtrack(nums, target - nums[i], i + 1, path, res)
        path.pop()

result = []
backtrack([1, 2, 3, 4], 5, 0, [], result)
print(result)

A [[1, 4], [2, 3]]

B [[1, 2, 3], [4]]

C []

D [[5]]

💡 Hint

Check which combinations of numbers add up exactly to 5 without reuse.

The code finds all unique subsets of [1,2,3,4] that sum to 5. These are [1,4] and [2,3].

🔧 Debug

advanced

Why does this greedy approach fail for coin change?

Consider the coin denominations [1, 3, 4] and the amount 6. The greedy algorithm picks the largest coin first. What is the output of the code below?

DSA Python

def greedy_coin_change(coins, amount):
    coins.sort(reverse=True)
    count = 0
    for coin in coins:
        while amount >= coin:
            amount -= coin
            count += 1
    return count

print(greedy_coin_change([1, 3, 4], 6))

A 1

B 3

C 6

D 2

💡 Hint

Try to see which coins the greedy picks first and how many coins it uses.

The greedy picks 4 first, then two 1s, totaling 3 coins. But the optimal is two coins: 3 + 3.

❓ Predict Output

advanced

Backtracking path count in maze

What is the output of the code that counts paths from top-left to bottom-right in a 2x2 grid moving only right or down?

DSA Python

def count_paths(r, c, max_r, max_c):
    if r == max_r and c == max_c:
        return 1
    if r > max_r or c > max_c:
        return 0
    return count_paths(r + 1, c, max_r, max_c) + count_paths(r, c + 1, max_r, max_c)

print(count_paths(0, 0, 1, 1))

A 2

B 1

C 4

D 0

💡 Hint

Count all ways to move right or down from (0,0) to (1,1).

There are two paths: right then down, or down then right.

🧠 Conceptual

expert

Why is backtracking necessary for N-Queens?

Why can't a greedy algorithm solve the N-Queens problem efficiently?

A Because greedy algorithms always find the solution instantly without checking conflicts.

B Because N-Queens only needs one queen placed, so no algorithm is needed.

C Because placing a queen greedily may block future placements, requiring backtracking to explore alternatives.

D Because greedy algorithms use recursion which is not suitable for N-Queens.

💡 Hint

Think about how placing queens affects the board and future choices.

Greedy placement can cause conflicts later, so backtracking tries different placements to find all solutions.

Practice

1. Why is backtracking preferred over greedy algorithms in problems like the N-Queens puzzle?

easy

A. Because greedy algorithms never use recursion

B. Because greedy algorithms always find the optimal solution quickly

C. Because backtracking uses less memory than greedy algorithms

D. Because backtracking explores all possible solutions and can backtrack on wrong choices

Solution

1. Step 1: Understand the problem nature

   The N-Queens puzzle requires placing queens so none attack each other, needing exploration of many possibilities.

2. Step 2: Compare backtracking and greedy approaches

   Backtracking tries all options and undoes wrong choices, while greedy picks locally best choices that may fail globally.

3. Final Answer:

   Because backtracking explores all possible solutions and can backtrack on wrong choices -> Option D

4. Quick Check:

   Backtracking explores all options = A [OK]

Hint: Backtracking tries all paths; greedy picks only best immediate choice [OK]

Common Mistakes:

• Thinking greedy always finds the best solution
• Confusing backtracking with dynamic programming
• Assuming backtracking uses less memory

2. Which of the following is the correct syntax to start a backtracking function in Python?

easy

A. def backtrack(path, options):

B. function backtrack(path, options) {

C. backtrack(path, options) => {

D. def backtrack[]:

Solution

1. Step 1: Identify Python function syntax

   Python functions start with 'def', followed by name and parameters in parentheses, ending with a colon.

2. Step 2: Check each option

   def backtrack[]: uses invalid square brackets instead of parentheses; function backtrack(path, options) { and backtrack(path, options) => { are JavaScript syntax; def backtrack(path, options): is the correct Python syntax.

3. Final Answer:

   def backtrack(path, options): -> Option A

4. Quick Check:

   Python function syntax = D [OK]

Hint: Python functions start with 'def' and end with ':' [OK]

Common Mistakes:

• Using JavaScript or other language syntax
• Missing colon at function end
• Using square brackets instead of parentheses

3. What will be the output of the following Python code snippet?

def backtrack(nums, path):
    if not nums:
        print(path)
        return
    for i in range(len(nums)):
        backtrack(nums[:i] + nums[i+1:], path + [nums[i]])

backtrack([1, 2], [])

medium

A. [2, 1]

B. [1, 2]

C. [1, 2]\n[2, 1]

D. []

Solution

1. Step 1: Understand the backtracking function

   The function generates all permutations of the list by choosing each element and recursing on the rest.

2. Step 2: Trace the calls for input [1, 2]

   First call picks 1, then 2 left, prints [1, 2]. Second call picks 2, then 1 left, prints [2, 1].

3. Final Answer:

   [1, 2] [2, 1] -> Option C

4. Quick Check:

   Permutations of [1, 2] = [1, 2] and [2, 1] [OK]

Hint: Backtracking here prints all permutations of the list [OK]

Common Mistakes:

• Thinking it prints only one permutation
• Confusing slicing syntax
• Missing that print happens when nums is empty

4. Find the error in this backtracking code for subset generation:

def subsets(nums, path=[]):
    print(path)
    for i in range(len(nums)):
        subsets(nums[i+1:], path.append(nums[i]))

subsets([1, 2])

medium

A. Using mutable default argument for path causes unexpected behavior

B. Missing return statement in function

C. Incorrect slicing of nums in recursive call

D. Using print inside recursion is invalid

Solution

1. Step 1: Identify mutable default argument issue

   Using path=[] as default causes the same list to be shared across calls, leading to wrong subsets.

2. Step 2: Check recursive call usage

   path.append(nums[i]) modifies path in place and returns None, so recursive call gets None instead of list.

3. Final Answer:

   Using mutable default argument for path causes unexpected behavior -> Option A

4. Quick Check:

   Mutable default args cause bugs = A [OK]

Hint: Avoid mutable defaults like lists in function parameters [OK]

Common Mistakes:

• Ignoring mutable default argument problem
• Thinking print inside recursion is wrong
• Assuming missing return causes error here

5. Which problem below cannot be solved correctly by a greedy algorithm but requires backtracking to find all solutions?

A) Finding minimum number of coins for change when coin denominations are unlimited and standard
B) Finding all subsets of a set
C) Finding shortest path in a weighted graph with non-negative edges
D) Sorting an array in ascending order

hard

A. Finding minimum number of coins for change when coin denominations are unlimited and standard

B. Finding all subsets of a set

C. Finding shortest path in a weighted graph with non-negative edges

D. Sorting an array in ascending order

Solution

1. Step 1: Analyze each problem type

   A) Greedy works for standard coin change; C) Dijkstra's algorithm is greedy and works; D) Sorting uses greedy-like comparisons.

2. Step 2: Identify problem needing backtracking

   Finding all subsets requires exploring all combinations, which greedy cannot do; backtracking is needed.

3. Final Answer:

   Finding all subsets of a set -> Option B

4. Quick Check:

   All subsets need backtracking = B [OK]

Hint: All subsets require exploring all options, not greedy choice [OK]

Common Mistakes:

• Thinking greedy can find all subsets
• Confusing shortest path with subset generation
• Assuming sorting needs backtracking