DSA · Theory

Add two numbers represented by linked lists

Theory

230/810

Add two numbers represented by linked lists

Add two numbers represented by linked lists is a DSA idea you prove with a ticket queue node, not with a slogan.

Add two numbers represented by linked lists on the board: head → next → …. Then say what a ticket queue node looks like after.

Add two numbers represented by linked lists exists so Vikram can keep a ticket queue node correct in a counter.

Add two numbers represented by linked lists shows up in a counter. Name a ticket queue node, not “a real-world scenario”.

If a ticket queue node breaks under Add two numbers represented by linked lists, check losing the next pointer on delete first.

Add two numbers represented by linked lists is not a lonely heading. Vikram ties it to a ticket queue node.

Viva for Add two numbers represented by linked lists: what it is → head → next → … → the mistake (losing the next pointer on delete).

Diagram

  [10] → [20] → [30] → /
   head              tail

Exam tip

Say Add two numbers represented by linked lists in one breath, then head → next → …, then losing the next pointer on delete.

Example

# Add two numbers represented by linked lists
data = [4, 1, 3]
print("start", data)
if data[0] > data[1]:
    data[0], data[1] = data[1], data[0]
print("after one step", data)

Add two numbers represented by linked lists: dry-run [4, 1, 3]. Say the list after one step.

Short notes

DefAdd two numbers represented by linked lists — Vikram uses it for a ticket queue node in a counter.
RuleAdd two numbers represented by linked lists → head → next → ….
RememberAdd two numbers represented by linked lists + Big-O (a counter).
UseAdd two numbers represented by linked lists in a counter (a ticket queue node).
TrapAdd two numbers represented by linked lists — losing the next pointer on delete.
ExAdd two numbers represented by linked lists → a ticket queue node.

DSA · Theory

Add two numbers represented by linked lists

← All stacks

Theory

230/810

Add two numbers represented by linked lists

Add two numbers represented by linked lists is a DSA idea you prove with a ticket queue node, not with a slogan.

Add two numbers represented by linked lists on the board: head → next → …. Then say what a ticket queue node looks like after.

Add two numbers represented by linked lists exists so Vikram can keep a ticket queue node correct in a counter.

Add two numbers represented by linked lists shows up in a counter. Name a ticket queue node, not “a real-world scenario”.

If a ticket queue node breaks under Add two numbers represented by linked lists, check losing the next pointer on delete first.

Add two numbers represented by linked lists is not a lonely heading. Vikram ties it to a ticket queue node.

Viva for Add two numbers represented by linked lists: what it is → head → next → … → the mistake (losing the next pointer on delete).

Diagram

  [10] → [20] → [30] → /
   head              tail

Exam tip

Say Add two numbers represented by linked lists in one breath, then head → next → …, then losing the next pointer on delete.

Example

# Add two numbers represented by linked lists
data = [4, 1, 3]
print("start", data)
if data[0] > data[1]:
    data[0], data[1] = data[1], data[0]
print("after one step", data)

Add two numbers represented by linked lists: dry-run [4, 1, 3]. Say the list after one step.

Short notes

DefAdd two numbers represented by linked lists — Vikram uses it for a ticket queue node in a counter.
RuleAdd two numbers represented by linked lists → head → next → ….
RememberAdd two numbers represented by linked lists + Big-O (a counter).
UseAdd two numbers represented by linked lists in a counter (a ticket queue node).
TrapAdd two numbers represented by linked lists — losing the next pointer on delete.
ExAdd two numbers represented by linked lists → a ticket queue node.

Add two numbers represented by linked lists

Example

Short notes

Questions

Add two numbers represented by linked lists

Example

Short notes

Questions