ALGORITHMUS-LESENOTIZ

Linked List

A linked list stores values in nodes. Each node keeps the value plus a reference to the next node, so the elements do not need to live next to each other in memory.

TYPDatenstrukturKATEGORIEData StructuresTIEFEEinsteigerTYPISCHE KOMPLEXITÄTaccess O(n), head insert O(1)

KURZE INTERVIEWANTWORT

Beginne mit diesem mentalen Modell

A linked list stores values in nodes. Each node keeps the value plus a reference to the next node, so the elements do not need to live next to each other in memory.

EINFACHE ERKLÄRUNG

So funktioniert es – ohne unnötigen Jargon

The list starts at a head node. To reach an item, you follow next references one by one.

Insertion at the front is cheap because only a few references change. Random access is expensive because there is no direct index lookup.

AUSFÜHRUNG

Lies den Algorithmus als Folge von Entscheidungen

Keep a head reference.

Traverse with current = current.next.

For insertion/deletion, reconnect the surrounding next references carefully.

Ein kleines Beispiel als Orientierung

For 10 → 20 → 30, inserting 15 after 10 only changes the links around 10 and 15.

LESBARE JAVASCRIPT-IMPLEMENTIERUNGJavaScript

class Node {
  constructor(value, next = null) {
    this.value = value;
    this.next = next;
  }
}

class LinkedList {
  head = null;

  prepend(value) {
    this.head = new Node(value, this.head);
  }
}

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

access O(n), head insert O(1)

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

Choose it when its dominant operations match your workload.
Compare memory overhead as well as Big-O.

HÄUFIGE FEHLER

Was typischerweise schiefgeht

Memorizing complexity without understanding representation.
Ignoring worst-case shape or resizing/rebalancing costs.

SO ERKLÄRST DU ES IM INTERVIEW

Struktur einer professionellen Antwort

Contrast it with arrays: linked lists give flexible local insertion/deletion, but lose O(1) index access and usually have worse cache locality.

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

SCHNELLER INTERVIEW-CHECK

What problem does Linked List solve?

A linked list stores values in nodes. Each node keeps the value plus a reference to the next node, so the elements do not need to live next to each other in memory.

Was sollte ich zur Komplexität erwähnen?

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

Was ist der häufigste Fehler?

Memorizing complexity without understanding representation.

WeiterlesenDoubly linked listStackQueue

class Node { constructor(value, next = null) { this.value = value; this.next = next; } } class LinkedList { head = null; prepend(value) { this.head = new Node(value, this.head); } }