How should I practice Longest Common Subsequence Length?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Amazon onsite interview problems in FastPrep.

Is Longest Common Subsequence Length associated with Amazon?

FastPrep tags this as a Amazon onsite interview coding practice problem when the problem catalog has that company and stage context.

Problem · String

Longest Common Subsequence Length

Learn this problem

● Medium

AmazonFULLTIMEONSITE INTERVIEW

See Amazon hiring insights

Problem statement

Given two lowercase strings first and second, return the length of their longest common subsequence.

A subsequence is formed by deleting zero or more characters without changing the relative order of the remaining characters. The characters in a common subsequence must appear in both strings in the same relative order; they do not need to occupy consecutive positions.

Function

longestCommonSubsequence(first: String, second: String) → int

Examples

Example 1

first = "abcde"second = "ace"return = 3

The string ace appears in both inputs in the same relative order.

Example 2

first = "abc"second = "def"return = 0

The two strings share no character, so the longest common subsequence is empty.

Constraints

0 <= first.length, second.length <= 1000
first and second contain only lowercase English letters.