Skip to main content
grasp.study
About
Explore
Pricing
Log in
Try it for free
Back to course
👋
Welcome to a Grasp lesson
Create a free account
to keep studying and create your own study path.
Java Data Structures and Algorithms
·
Module 9
Backtracking
1
Recursive Subset Generation
Generate all subsets of a set using a recursive approach.
2
Permutations with Backtracking and Swaps
Generate all permutations of a set using backtracking with a swap-based approach.
3
Combinations with Backtracking
Generate all combinations of a given size from a set using backtracking.
4
Solving N-Queens with Backtracking
Implement a backtracking solution to find all valid configurations for the N-Queens problem.
5
Sudoku Solver: Backtracking Algorithm
Implement a backtracking algorithm to solve a Sudoku puzzle.
6
Maze Solving with Backtracking
Apply backtracking to solve maze-solving problems (e.g., Rat in a Maze).
Previous module
Hashing and Tries
Next module
Graphs: Representations and Traversals