# Category - Backtracking

## C Programming – Backtracking Set 8 Solving Cryptarithmetic Puzzles

C Programming - Backtracking Set 8 Solving Cryptarithmetic Puzzles - Backtracking - The goal here is to assign each letter a digit from 0 to 9 .The rules are...

## C++ Programming – Tug of War

C++ Programming - Tug of War - Backtracking - Given a set of n integers, divide the set in two subsets of n/2 sizes each such that the difference of the sum

## Python Programming – Backtracking Set 7 Sudoku

Python Programming Backtracking Set 7 Sudoku - Backtracking - Given a partially filled 9×9 2D array ‘grid’, the goal is to assign digits (from 1 to 9)

## C++ Programming – Backtracking Set 7 Sudoku

C++ Programming - Backtracking Set 7 Sudoku - Backtracking - Given a partially filled 9×9 2D array ‘grid’, the goal is to assign digits (from 1 to 9)

## C Programming – Backtracking Set 7 Sudoku

C Programming - Backtracking Set 7 Sudoku - Backtracking - Given a partially filled 9×9 2D array ‘grid’, the goal is to assign digits (from 1 to 9)

## C Programming-Backtracking Set 2 (Rat in a Maze)

C Programming-Backtracking Set 2 - Backtracking - A Maze is given as N*N binary matrix of blocks where source block is the upper left most block..maze...

## C++ Programming-Backtracking Set 6 (Hamiltonian Cycle)

C++ Programming-Backtracking Set 6 (Hamiltonian Cycle) - Backtracking - Hamiltonian Path in an undirected graph is a path that visits each vertex exactly.

## C++ Programming-Backtracking Set 5 (m Coloring Problem)

C++ Programming-Backtracking Set 5 - Backtracking - Given an undirected graph and a number m, determine if the graph can be colored with most m colors such...

## C Programming-Backtracking Set 5 (m Coloring Problem)

Backtracking Set 5 (m Coloring Problem)-Backtracking-Given an undirected graph and a number m, determine if the graph can be colored with at most m colors .

## Backtracking Set 4 (Subset Sum)

Backtracking Set 4 (Subset Sum) - Backtracking - Subset sum problem is to find subset of elements that are selected from a given set whose sum adds up.

X