Longest Common Subsequence
Given two strings, str1 and str2, find the length of their longest common subsequence. If no common subsequence exists, return 0.
A subsequence is a sequence derived from another sequence by deleting some or no elements without changing the order of the remaining elements. For example, the subsequences of abc are ``, a, b, c, ab, ac, bc, and abc.
A common subsequence between two strings refers to a subsequence that appears in both string sequences in the same relative order. For example, in the strings xyz and axabz, the longest common subsequence is xz, and therefore, the length of the longest common subsequence is 2.
Input
str1: string: A stringstr2: string: A string
Examples
Input: str1 = "xyz", str2 = "axabz"Output: 2Explanation: The longest common subsequence is 'xz'.
Input: str1 = "xyz", str2 = "xyz"Output: 3Explanation: The longest common subsequence is 'xyz'.
Input: str1 = "xyz", str2 = "pqr"Output: 0Explanation: There is no common subsequence.
Constraints
- 1 <=
str1.length,str2.length<= 1000 str1andstr2consist of only lowercase English characters
Sponsor: SwagOverflowBugs? Manageable. But "It looks weird on my phone"? Pure terror. This black tee perfectly captures every front end engineer's worst fear — mystery UI issues on an unknown device. Whether it's a client's 5-year-old Android or some obscure browser setting, you already know it's going to be painful.
Sponsor: SwagOverflowBugs? Manageable. But "It looks weird on my phone"? Pure terror. This black tee perfectly captures every front end engineer's worst fear — mystery UI issues on an unknown device. Whether it's a client's 5-year-old Android or some obscure browser setting, you already know it's going to be painful.
Longest Common Subsequence
Given two strings, str1 and str2, find the length of their longest common subsequence. If no common subsequence exists, return 0.
A subsequence is a sequence derived from another sequence by deleting some or no elements without changing the order of the remaining elements. For example, the subsequences of abc are ``, a, b, c, ab, ac, bc, and abc.
A common subsequence between two strings refers to a subsequence that appears in both string sequences in the same relative order. For example, in the strings xyz and axabz, the longest common subsequence is xz, and therefore, the length of the longest common subsequence is 2.
Input
str1: string: A stringstr2: string: A string
Examples
Input: str1 = "xyz", str2 = "axabz"Output: 2Explanation: The longest common subsequence is 'xz'.
Input: str1 = "xyz", str2 = "xyz"Output: 3Explanation: The longest common subsequence is 'xyz'.
Input: str1 = "xyz", str2 = "pqr"Output: 0Explanation: There is no common subsequence.
Constraints
- 1 <=
str1.length,str2.length<= 1000 str1andstr2consist of only lowercase English characters
Sponsor: SwagOverflowBugs? Manageable. But "It looks weird on my phone"? Pure terror. This black tee perfectly captures every front end engineer's worst fear — mystery UI issues on an unknown device. Whether it's a client's 5-year-old Android or some obscure browser setting, you already know it's going to be painful.
Premium solution
Purchase premium to unlock official solutions and all the best materials we have to offer.You must be signed in to view your submissions
Loading editor
Loading editor
Loading tests
JavaScript Console
console.log() statements will appear here.