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

# Author: Raunak Jain

SDE at Societe Generale | Ex-Intern at Samsung R&D Institute | Ex-Intern at Hewlett Packard Enterprises

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

## Equal sum partition (DP-09)

You are given a set of positive integers. You need to find whether or not, the set can be divided into to partitions of equal