📘

Longest Common Subsequence

Given two strings, return the length of their longest common subsequence (LCS). A subsequence maintains relative order but needn't be contiguous.

Input:

abcde
ace

Output:

Reasoning:

The two input strings are abcde and ace, and we need to find their longest common subsequence (LCS).
We compare the characters of both strings and find the common characters in the same relative order: a, c, and e.
The length of this LCS is $3$ , since it contains three characters.
The final output is the length of the LCS, which is $3$ .

Editor

Python 3.13.1

0/0

Run code to see test results.

📘