Multiple ChoiceHard 30s
Longest Common Subsequence
The Longest Common Subsequence (LCS) of two strings uses a DP table of size:
Options
- 1n × n irrespective of each string length
- 2m + n, the sum of the two string lengths
- 32^m × 2^n, exponential in the string lengths
- 4(m+1) × (n+1) where m,n are string lengths
Think you can answer under pressure?
Get matched and answer live questions in 3-minute 1v1 battles. Elo ranking, badge tiers and bragging rights on the line.