Page 1 of 1
1. (10 pts, standard.) Design an algorithm that finds a longest common subsequence between two given strings such that t
Posted: Thu May 05, 2022 12:43 pm
by answerhappygod
- 1 10 Pts Standard Design An Algorithm That Finds A Longest Common Subsequence Between Two Given Strings Such That T 1 (46.82 KiB) Viewed 36 times
1. (10 pts, standard.) Design an algorithm that finds a longest common subsequence between two given strings such that the subsequence starts with symbol ‘a' and ends with symbol ‘b’ and in between, there are exactly two 'c'. When the desired subsequence does not exist, your algorithm returns None. I will grade on the efficiency of your algorithm.