Longest common subsequence
Given two strings, return the length of their longest common subsequence.
Implement
longest_common_subsequence(a: str, b: str) → intExamples
in
["abcde","ace"]out3What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 25 min
solution.py
InputExpectedGot
["abcde","ace"]3not run yetsample