Recent posts

Problem of The Day: Longest Common Subsequence

2 minute read

Problem Statement ``` Given two strings text1 and text2, return the length of their longest common subsequence. If there is no common subsequence, return 0.