17 lines (12 loc) · 300 Bytes

Problem 7: Longest Common Subsequence

Problem Statement

Find the length of the longest common subsequence of two strings.

Input Format

Two strings.

Output Format

An integer.

Constraints

1 <= len(s1), len(s2) <= 1000

Example

Input: s1="abcde", s2="ace"
Output: 3