You are given an array of non-negative integers. You need to find the length of the longest subsequence which has all the elements sorted in

# Category: DP

## Minimum path sum (DP-14)

You are given an m x n matrix filled with non-negative integers, you need to find a path from top left to bottom right of

## Maximum size square sub-matrix (DP-13)

You are given a binary matrix with 0’s and 1’s. You need to find out the maximum size of a square with all 1’s in

## House Robber (DP-12)

A professional robber is planning to rob houses along a street. Each house has a certain amount of money stashed in them. You need to

## Minimum edit distance (DP-11)

The levenshtein distance or Edit distance between two strings is the minimum number of single-character edits (Insertions, deletions and replacements) required to change on word

## Coin change problem (DP-10)

You are given an unlimited supply of coins of given denominations, you need to find the total number of distinct ways to get a desired