## how to find nth permutation of a string in c

how to find nth permutation of a string in c.write a c program to find nth permutation of a string. For example if given string is “1256” then all...

## c program to generate all strings of n bits ( Backtracking problem)

Write a c program to generate all strings of n bits by using recursive backtracking method.. For example if given size of an array is 3 then the output...

## c program to print all possible combinations of given characters

write a c program to print all possible combinations of given characters. For example if given characters are then ,its all possible combinations are as...

## find longest increasing subsequence using recursion

write a recursive function to find longest increasing subsequence using recursion. For example if we have sequence of { 6, 3, 4, 5, 6, 9, 8 }. The longest...

## 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...