How should I practice Longest Common Subsequence Length?

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

Is Longest Common Subsequence Length associated with Zscaler?

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

Longest Common Subsequence Length

Zscaler● MediumINTERNONSITE INTERVIEW

Learn

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. A common subsequence appears in both strings; its characters do not need to be consecutive.

Function

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

Examples

Example 1

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

The subsequence ace appears in both strings.

Example 2

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

The strings have no character in common.

Example 3

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

An empty string has no nonempty subsequence.

Constraints

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