LeetCode 279. Perfect Squares
Description https://leetcode.com/problems/perfect-squares/ Given an integer n, return the least number of perfect square numbers that sum to n. A perfect square is an integer that…
Category: Dynamic Programming
LeetCode 44. Wildcard Matching
Description https://leetcode.com/problems/wildcard-matching/ Given an input string (s) and a pattern (p), implement wildcard pattern matching with support for ‘?’ and ‘*’ where: ‘?’ Matches any…
LeetCode 120. Triangle
Description https://leetcode.com/problems/triangle/ Given a triangle array, return the minimum path sum from top to bottom. For each step, you may move to an…
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…
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. If there is no common subsequence, return 0. A subsequence of a string is…
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…