Algorithm Designex03e1_lcs
Longest Common Subsequence
e02ec39d-0ed4-4edb-97cf-31cacf2a41d9.cppC++
1// Loading code...Selected Submission
100 / 100
0.035s
29468 KB
DPStrings
Time Comp.
O(m*n)
Space Comp.
O(m*n)
Readability
6/10
"The code calculates the longest common subsequence (LCS) of two strings using a recursive approach with memoization. This clearly demonstrates the use of Dynamic Programming to avoid redundant calculations and efficiently solve the problem."
History
| Attempt | Points | Time ↓ |
|---|---|---|
| Try #6 | 100 | 2/24/2025 |
| Try #5 | 0 | 2/24/2025 |
| Try #4 | 0 | 2/24/2025 |
| Try #3 | 100 | 2/24/2025 |
| Try #2 | 0 | 2/24/2025 |
| Try #1 | 10 | 2/24/2025 |