[LeetCode 91] Decode Ways [Java]

1. Description A message containing letters from A-Z is being encoded to numbers using the following mapping: 'A' -> 1 'B' -> 2 ... 'Z' -> 26 Given...

[LeetCode 64] Minimum Path Sum [Java]

1. Description Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all number...

[LeetCode 63] Unique Paths II [Java]

1. Description Follow up for "Unique Paths": Now consider if some obstacles are added to the grids. How many unique paths would there be? An obstac...

[LeetCode 62] Unique Paths [Java]

1. Description A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below). The robot can only move either down...

[LeetCode 279] Perfect Squares [Java]

1. Description Given a positive integer n, find the least number of perfect square numbers (for example, 1, 4, 9, 16, ...) which sum to n. 2. Runti...

[LeetCode 322] Coin Change [Java]

1. Description You are given coins of different denominations and a total amount of money amount. Write a function to compute the fewest number of ...

[LeetCode 673] Number of Longest Increasing Subsequence [Java]

1. Description Given an unsorted array of integers, find the number of longest increasing subsequence. 2. Runtime Distribution 3. Submission Detai...

[LeetCode 152] Maximum Product Subarray [Java] [Runtime : 2MS]

1. Description Find the contiguous subarray within an array (containing at least one number) which has the largest product. 2. Runtime Distribution...

[LintCode 125] Backpack II [Java]

1. Description Given n items with size Ai and value Vi, and a backpack with size m. What's the maximum value can you put into the backpack? Notice ...

[LintCode 92] Backpack [Java]

1. Description Given n items with size Ai, an integer m denotes the size of a backpack. How full you can fill this backpack? Notice You can not ...