Find longest common subsequence length

Q: Find longest common subsequence length

This is a Coding & Algorithms interview question from TikTok for Software Engineer roles. View the full question and solution on PracHub.

Q: How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Question

Loading...

Given two strings s and t, compute the length of their longest common subsequence (LCS).

A subsequence is obtained by deleting zero or more characters from a string without changing the relative order of the remaining characters.

Input

Two strings s and t (may be empty)

Output

An integer: the maximum length of any common subsequence of s and t

Example

s = "abcde" , t = "ace" → output 3 ("ace")

Constraints (you may assume)

0 <= len(s), len(t) <= 2000
Characters are ASCII letters (or general bytes).

Find longest common subsequence length

Input

Output

Example

Constraints (you may assume)

Comments (0)