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

Maximum Subarray

The maximum subarray problem asks for the contiguous segment with the largest sum. Kadane's algorithm solves it in O(n).

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

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

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

The maximum subarray problem asks for the contiguous segment with the largest sum. Kadane's algorithm solves it in O(n).

شرح مبسط

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

At each position decide whether to extend the previous segment or start fresh from the current value.

Track both the best segment ending here and the best seen globally.

التنفيذ

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

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 Maximum Subarray, the goal is to make the invariant visible rather than to memorize code.

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

function maxSubarray(a) {
  let ending = a[0];
  let best = a[0];
  for (let i = 1; i < a.length; i++) {
    ending = Math.max(a[i], ending + a[i]);
    best = Math.max(best, ending);
  }
  return best;
}

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

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

التعقيد

O(n) with Kadane

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.

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

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

Explain the local decision behind Kadane, not only the two variable names. Also handle the all-negative case correctly.

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

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

What problem does Maximum Subarray solve?

The maximum subarray problem asks for the contiguous segment with the largest sum. Kadane's algorithm solves it in O(n).

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

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

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

Writing recurrence before defining state.

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

function maxSubarray(a) { let ending = a[0]; let best = a[0]; for (let i = 1; i < a.length; i++) { ending = Math.max(a[i], ending + a[i]); best = Math.max(best, ending); } return best; }