{"id":983,"date":"2025-08-22T16:44:49","date_gmt":"2025-08-22T11:14:49","guid":{"rendered":"https:\/\/codeanddebug.in\/blog\/?p=983"},"modified":"2025-08-22T16:50:06","modified_gmt":"2025-08-22T11:20:06","slug":"longest-common-subsequence","status":"publish","type":"post","link":"https:\/\/codeanddebug.in\/blog\/longest-common-subsequence\/","title":{"rendered":"Longest Common Subsequence | Leetcode 1143 | All DP Approach"},"content":{"rendered":"\n

Given two strings text1<\/code> and text2<\/code>, find the length of their Longest Common Subsequence (LCS)<\/strong>. A subsequence is a sequence that appears in the same relative order, but not necessarily contiguous. Return the length<\/strong> of the LCS.<\/p>\n\n\n\n

Here’s the [Problem Link<\/span><\/mark><\/a><\/strong>] to begin with.<\/p>\n\n\n\n

Example 1<\/strong><\/p>\n\n\n\n

<\/circle><\/circle><\/circle><\/g><\/svg><\/span><\/path><\/path><\/svg><\/span>
Input<\/span>:  <\/span>text1 = "abcde", text2 = "ace"<\/span><\/span>\nOutput<\/span>: <\/span>3<\/span><\/span>\nExplanation<\/span>: <\/span>The LCS is "ace" with length 3.<\/span><\/span><\/code><\/pre><\/div>\n\n\n\n
Example 2<\/strong><\/p>\n\n\n\n
<\/circle><\/circle><\/circle><\/g><\/svg><\/span><\/path><\/path><\/svg><\/span>
Input<\/span>:  <\/span>text1 = "abc", text2 = "abc"<\/span><\/span>\nOutput<\/span>: <\/span>3<\/span><\/span>\nExplanation<\/span>: <\/span>The LCS is "abc" with length 3.<\/span><\/span><\/code><\/pre><\/div>\n\n\n\n
Goal: compute only the length of the LCS, not the subsequence itself.<\/p>\n\n\n
\n\t\t\t
\n\t\t\t\t
Contents:<\/div>\n\t\t\t\t
\n\t\t\t
\n\t\t\t\u00a0[show<\/a>]\n\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t<\/div>\n\t\t<\/div>
\n\t\t\t
\n\t\t\t\t