Longest Common Subsequence

medium
1. You are given a string str1.
2. You are given another string str2.
3. You are required to print the length of longest common subsequence of two strings.

Input Format

A string str1 A string str2

Output Format

A number representing the length of longest common subsequence of two strings.

Constraints

0 <= str1.length <= 10
0 <= str2.length <= 10

Notice

Try First, Check Solution later

1. You should first read the question and watch the question video.
2. Think of a solution approach, then try and submit the question on editor tab.
3. We strongly advise you to watch the solution video for prescribed approach.

Example

Input
abcd
aebd
Output
3
Previous
Russian Doll Envelopes
Next
Count Palindromic Subsequences

Related Questions