Recursion & Backtracking

Build confidence with recursive thinking, permutations, combinations, and constraint satisfaction problems.

11 exercises

hardPython

N-Queens Solver

Build a function that solves the classic N-Queens problem using backtracking. The N-Queens problem asks: how can you pl...

backtrackingrecursionalgorithms+2

mediumPython

Word Search Solver

Build a function that solves a word search puzzle. Given a 2D board of letters and a target word, determine if the word...

backtracking

mediumPython

Grid Path Finder

# Grid Path Finder Create a function that finds all possible paths in a grid from the top-left corner (0, 0) to the bot...

recursion

mediumPython

Generate All Permutations

Build a function that generates all permutations of a list of distinct integers. A permutation is a rearrangement of el...

recursion

mediumPython

Generate All Subsets of a List

Write a function that generates all possible subsets (the power set) of a list of distinct integers. The power set of a...

recursion

easyPython

Generate Valid Parentheses Combinations

Write a function that generates all valid combinations of `n` pairs of parentheses. A valid combination means: - Each o...

recursion

hardPython

Binary Tree Serialization and Deserialization

Implement functions to serialize a binary tree to a string representation and deserialize it back to the original tree s...

binary-tree

easyPython

Climbing Stairs

Build a function that computes how many distinct ways you can climb n stairs, taking 1 or 2 steps at a time. For exampl...

dynamic-programming

mediumPython

Binary Search Tree Validator

# Binary Search Tree Validator Implement a function that determines if a binary tree is a valid binary search tree (BST...

binary-tree

easyPython

Binary Tree Maximum Depth

Write a function that finds the maximum depth (height) of a binary tree. The depth of a binary tree is the number of no...

binary-tree

easyPython

Invert Binary Tree

Write a function that inverts a binary tree (creates a mirror image) and returns the root node. Inverting a binary tree...

binary-tree