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

## minesweeper uva 10189 solution

problem link minesweeper uva 10189 solution Technique to solve this problem As you may have already noticed, each square may have at most 8 adjacent squares. Let us...

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

## Find the number of fighting groups using dfs

There is battlefield where some different types of aliens are fighting to each other. The battlefield exists some where on different planet. A scientist is able to watch the...

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

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

## Longest Increasing Path in a Matrix

Given an integer matrix, find the length of the longest increasing path. From each cell, you can either move to four directions: left, right, up or down. You may...