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

Be a Good Techer and Tech for Good. www.goodtecher.com

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…

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…

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…

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…

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…

Description https://leetcode.com/problems/climbing-stairs/ You are climbing a stair case. It takes n steps to reach to the top. Each time you can either…

Description https://leetcode.com/problems/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…

Description https://leetcode.com/problems/unique-paths-ii/description/ Follow up for “Unique Paths”: Now consider if some obstacles are added to the grids. How many unique…

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…

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.…