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

# Tag: Arrays

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

## Subset Sum Problem (DP-08)

You are given a set of positive integers and an integer S, you need to find out whether there exists a non-empty subset with sum

## 0-1 Knapsack problem (DP-07)

We are given a set of items, each item is associated with a weight and a value. We need to determine the number of each