Find length of longest common subsequence

Q: Find length of longest common subsequence

This is a Coding & Algorithms interview question from TikTok for Machine Learning 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, return the length of their longest common subsequence.

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

Input

s : string
t : string

Output

Integer length of the longest common subsequence of s and t .

Constraints (typical)

0 <= len(s), len(t) <= 2000
Strings consist of lowercase English letters (or ASCII characters).

Example

s = "abcde" , t = "ace" → output 3 (one LCS is "ace" ).

Find length of longest common subsequence

Input

Output

Constraints (typical)

Example

Comments (0)