Back to Questions

Longest Common Subsequence (LCS)

51.1K views•Asked at Airbnb•
Medium

Question Explain

Given two strings $text1$ and $text2$, return the length of their longest common subsequence. Use Dynamic Programming.

Start Trying This Question Simulation

Practice answering orally or with text to get instant AI feedback.

Practice with This Question

Other interview questions like this

Two Sum

104.4K views

Longest Substring Without Repeating Characters

62.2K views

Median of Two Sorted Arrays

107.8K views
Longest Common Subsequence (LCS) - Interview Question