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…
Category: Dynamic Programming
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…
LeetCode 63. Unique Paths II
Description https://leetcode.com/problems/unique-paths-ii/ A robot is located at the top-left corner of a m x n grid (marked ‘Start’ in the diagram below).…
LeetCode 62. Unique Paths
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…
LeetCode 5. Longest Palindromic Substring
Description https://leetcode.com/problems/longest-palindromic-substring/description/ Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.…