## Java Programming – Count ways to reach the n’th stair

Java Programming – Count ways to reach the n’th stair – Dynamic Programming There are n stairs, a person standing at the bottom wants to reach the top.

## Java Programming – Subset Sum Problem

Java Programming – Subset Sum Problem – Dynamic Programming Given a set of non-negative integers, and a value sum, determine if there is a subset

## Java Programming – Bellman–Ford Algorithm

Java Programming – Bellman–Ford Algorithm – Dynamic Programming Given a graph and a source vertex src in graph, find shortest paths from src to all vertices

## Box Stacking Problem

Box Stacking Problem – Dynamic Programmming The Box Stacking problem is a variation of LIS problem. We need to build a maximum height stack.

## Variations of LIS

Variations of LIS – Dynamic Programming – We have discussed Dynamic Programming solution for Longest Increasing Subsequence problem in this post

## Maximum Length Chain of Pairs

Maximum Length Chain of Pairs – Dynamic Programming – The given problem is also a variation of Activity Selection problem and can be solved in (nLogn) time.

## Java Programming – Word Wrap Problem

Java Programming – Word Wrap Problem – Dynamic Programming Given a sequence of words, and a limit on the number of characters that can be put in one line

## Java Programming – Partition Problem

Java Programming – Partition Problem – Dynamic Programming Partition problem is to determine whether a given set can be partitioned into two subsets

## Floyd Warshall Algorithm

Java Programming – Floyd Warshall Algorithm – Dynamic Programming The Floyd Warshall Algorithm is for solving the All Pairs Shortest Path problem.