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

## traveling salesman problem Brute force and dynamic programming

Traveling salesman problem Brute force and dynamic programming: Given a set of cities and the distances between them, find the shortest path visiting each of a given set of...

## Maximum subarray problem

Maximum subarray problem is to find the largest contiguous sub-array which has largest sum total. For example in array {-1,-2,3,4} the largest contiguous array which has largest sum is...

## longest increasing subsequence

Longest increasing subsequence problem: Dynamic programing Given a set of integers in unsorted manner find the length of longest increasing subsequence. for example 10 23 3 45 56 24...