Back to Question
Longest Common Subsequence (LCS)
Question Explain
Given two strings $text1$ and $text2$, return the length of their longest common subsequence. Use Dynamic Programming.
Start Trying This Question Simulation
Click "Start Speaking" and answer the question naturally.