ALGORITHMUS-LESENOTIZ

Maximum Subarray

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

TYPAlgorithmusKATEGORIESets & Dynamic ProgrammingTIEFEFortgeschrittenTYPISCHE KOMPLEXITÄTO(n) with Kadane

KURZE INTERVIEWANTWORT

Beginne mit diesem mentalen Modell

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

EINFACHE ERKLÄRUNG

So funktioniert es – ohne unnötigen Jargon

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.

AUSFÜHRUNG

Lies den Algorithmus als Folge von Entscheidungen

Define the state precisely.

Write the transition/choice from smaller states.

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

Ein kleines Beispiel als Orientierung

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.

LESBARE JAVASCRIPT-IMPLEMENTIERUNGJavaScript

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;
}

So liest du diesen Code

Lerne die Syntax nicht auswendig. Folge dem Zustand, der sich in jeder Zeile ändert, und verbinde ihn mit der oben beschriebenen Invariante.

KOMPLEXITÄT

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.

WANN EINSETZEN

Gut geeignet

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

HÄUFIGE FEHLER

Was typischerweise schiefgeht

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

SO ERKLÄRST DU ES IM INTERVIEW

Struktur einer professionellen Antwort

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

Problem→Kernidee→Invariante / Zustand→Big-O→Trade-off

SCHNELLER INTERVIEW-CHECK

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).

Was sollte ich zur Komplexität erwähnen?

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.

Was ist der häufigste Fehler?

Writing recurrence before defining state.

WeiterlesenMemoizationTabulationBacktracking

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; }