LeetCode 152. Maximum Product Subarray
Description https://leetcode.com/problems/maximum-product-subarray/ Given an integer array nums, find the contiguous subarray within an array (containing at least one number) which has…
Category: Dynamic Programming
LeetCode 300. Longest Increasing Subsequence
Description https://leetcode.com/problems/longest-increasing-subsequence/ Given an unsorted array of integers, find the length of longest increasing subsequence. Example: Input: [10,9,2,5,3,7,101,18] Output: 4…
LeetCode 322. Coin Change
Description https://leetcode.com/problems/coin-change/ You are given coins of different denominations and a total amount of money amount. Write a function to compute…
LeetCode 1143. Longest Common Subsequence
Description https://leetcode.com/problems/longest-common-subsequence/ Given two strings text1 and text2, return the length of their longest common subsequence. A subsequence of a string is a new string…
LeetCode 55. Jump Game
Description https://leetcode.com/problems/jump-game/ Given an array of non-negative integers, you are initially positioned at the first index of the array. Each…
LeetCode 64. Minimum Path Sum
Description https://leetcode.com/problems/minimum-path-sum/ 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…
LeetCode 118. Pascal’s Triangle
Description https://leetcode.com/problems/pascals-triangle/ Given a non-negative integer numRows, generate the first numRows of Pascal’s triangle. In Pascal’s triangle, each number is the sum of…
LeetCode 198. House Robber
Description https://leetcode.com/problems/house-robber/ You are a professional robber planning to rob houses along a street. Each house has a certain amount…
LeetCode 70. Climbing Stairs
Description https://leetcode.com/problems/climbing-stairs/ You are climbing a staircase. It takes n steps to reach the top. Each time you can either climb 1 or 2 steps. In…
LeetCode 139. Word Break
Description Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, determine if s can be segmented into a space-separated sequence of one or more…