## find maximum path to reach from source to destination

Given a directed graph and two vertices ( source and destination ), find maximum path to reach from source to destination. For example in the below directed graph if...

## Graph coloring backtracking problem

You are given an undirected graph and two colors, black and white. write a program to find the maximum number of nodes that can be colored with black such...

## Smart Frog codechef problem solution by backtracking

Backtracking problem is not easier to understand. For an average programmer practice is the only way to become an expert at backtracking problem solution. The article “Smart Frog codechef...

## find minimum number of clicks to make monochromatic grid

A grid of size NxM where each cell of the grid is filled with some color. Find minimum number of clicks to make monochromatic grid (having one color). Problem...

## subset sum problem using backtracking

We have discussed the “subset sum problem using dynamic programming” . We can solve subset sum problem using backtracking algorithm. For example if there is set S{ 1,3,9,2} and...

## find all distinct sums

Given a sum total and list of n positive integers find all distinct sums that add up to sum total. For example if the given sum total is 5...

## Search Word In Matrix

Search Word In Matrix problem states that “Given a 2D matrix filled with some characters. Check whether the word exist in the matrix or not”. All movements right, left,...

## UAV 729 The Hamming Distance Backtracking Problem

This problem simply states that we have to print all permutation of binary number of length N with M number of 1’s. Let us see the below example test...

## UVA Backtracking problem 639 Don’t Get Rooked solution

UVA Backtracking problem 639 Don’t Get Rooked solution. The given problem is based on backtracking. https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=580. ...

## permutation of a string using backtracking

write c program for all permutation of a string using backtracking. Permutation means all possible re-arrangements of a collection of objects, where the order is important. for example {a,b,c}...