Combinatorial Search with Pruning

DFS over choices with constraint checks before going deeper cuts the tree.

Try this in Python

# Brute count binary strings length 3 (toy search space)
print(2**3)

Key takeaways

• Order arguments (index, mask, sum) consistently.
• Memoize when states repeat.
• Estimate branches before coding.