ملاحظة قراءة الخوارزمية

Longest Common Subsequence

LCS finds the longest sequence of values that appears in both inputs in the same relative order, but not necessarily contiguously.

النوعخوارزميةالفئةSets & Dynamic Programmingالعمقمتقدمالتعقيد المعتادO(mn)

إجابة مقابلة قصيرة

ابدأ بهذا النموذج الذهني

LCS finds the longest sequence of values that appears in both inputs in the same relative order, but not necessarily contiguously.

شرح مبسط

كيف يعمل، بلا مصطلحات زائدة

dp[i][j] usually means LCS length for prefixes ending before i and j.

Matching characters extend the diagonal state; otherwise take the best of dropping one side.

التنفيذ

اقرأ الخوارزمية كسلسلة من القرارات

Define the state precisely.

Write the transition/choice from smaller states.

Set base cases, then decide memoization, tabulation or backtracking.

مثال صغير لتحتفظ به في ذهنك

Read a tiny input by hand and write down the state after every important operation. For Longest Common Subsequence, the goal is to make the invariant visible rather than to memorize code.

تطبيق JavaScript قابل للقراءةJavaScript

function lcs(a, b) {
  const dp = Array.from({ length: a.length + 1 }, () => Array(b.length + 1).fill(0));
  for (let i = 1; i <= a.length; i++) {
    for (let j = 1; j <= b.length; j++) {
      dp[i][j] = a[i - 1] === b[j - 1]
        ? dp[i - 1][j - 1] + 1
        : Math.max(dp[i - 1][j], dp[i][j - 1]);
    }
  }
  return dp[a.length][b.length];
}

كيف تقرأ هذا الكود

لا تحفظ الصياغة. تتبع الحالة التي تتغير في كل سطر واربطها بالثابت الموضح أعلاه.

التعقيد

O(mn)

Do not quote this complexity mechanically. Ask which operation or input dimension it describes, then derive the cost from the loops, recursion depth, data-structure operations and any preprocessing assumptions.

متى تستخدمه

مناسب لـ

Use DP when subproblems overlap and optimal solutions can be composed from smaller optimal states.

أخطاء شائعة

ما الذي يسوء عادةً

Writing recurrence before defining state.
Using DP when state space is larger than the original problem.

كيف تشرحه في المقابلة

صيغة إجابة احترافية

Explicitly distinguish subsequence from substring. This is one of the most common interview confusions.

المشكلة→الفكرة الأساسية→الثابت / الحالة→Big-O→المفاضلة

فحص سريع للمقابلة

What problem does Longest Common Subsequence solve?

LCS finds the longest sequence of values that appears in both inputs in the same relative order, but not necessarily contiguously.

ماذا يجب أن أذكر عن التعقيد؟

Its typical cost here is O(mn), but a complete answer should connect that cost to the representation, input constraints and the dominant operations.

ما الخطأ الأكثر شيوعاً؟

Writing recurrence before defining state.

متابعة القراءةMemoizationTabulationBacktracking

function lcs(a, b) { const dp = Array.from({ length: a.length + 1 }, () => Array(b.length + 1).fill(0)); for (let i = 1; i <= a.length; i++) { for (let j = 1; j <= b.length; j++) { dp[i][j] = a[i - 1] === b[j - 1] ? dp[i - 1][j - 1] + 1 : Math.max(dp[i - 1][j], dp[i][j - 1]); } } return dp[a.length][b.length]; }