Quiz
Question 1 of 4. 0 correct, 0 incorrect.
A longest common subsequence table compares a string of length m with a string of length n. What size should the table be?
Hint
Ask what the first letter of each string reads from.
Ask what the first letter of each string reads from.