DSA · Theory

When should I use a List vs a LinkedList

Theory

248/810

When should I use a List vs a LinkedList

When should I use a List vs a LinkedList sits in a counter. Kabir’s job is a ticket queue node. Write that first.

Keep When should I use a List vs a LinkedList small. Kabir should finish a ticket queue node in a few lines, not a 40-line dump.

Without When should I use a List vs a LinkedList, a counter gets messy and a ticket queue node is hard to trust.

When should I use a List vs a LinkedList shows up in a counter. Name a ticket queue node, not “a real-world scenario”.

Don’t do this with When should I use a List vs a LinkedList: losing the next pointer on delete. Interviewers spot it in ten seconds.

After When should I use a List vs a LinkedList, Kabir should still remember losing the next pointer on delete.

One breath for When should I use a List vs a LinkedList, then a ticket queue node, then losing the next pointer on delete. Sit down.

Exam tip

Say When should I use a List vs a LinkedList in one breath, then head → next → …, then losing the next pointer on delete.

Example

# When should I use a List vs a LinkedList
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)

When should I use a List vs a LinkedList: dry-run [4, 1, 3]. Say the list after one step.

Short notes

DefWhen should I use a List vs a LinkedList — Kabir uses it for a ticket queue node in a counter.
RuleWhen should I use a List vs a LinkedList → head → next → ….
RememberWhen should I use a List vs a LinkedList + time vs memory (a counter).
UseWhen should I use a List vs a LinkedList in a counter (a ticket queue node).
TrapWhen should I use a List vs a LinkedList — losing the next pointer on delete.
ExWhen should I use a List vs a LinkedList → a ticket queue node.

DSA · Theory

When should I use a List vs a LinkedList

← All stacks

Theory

248/810

When should I use a List vs a LinkedList

When should I use a List vs a LinkedList sits in a counter. Kabir’s job is a ticket queue node. Write that first.

Keep When should I use a List vs a LinkedList small. Kabir should finish a ticket queue node in a few lines, not a 40-line dump.

Without When should I use a List vs a LinkedList, a counter gets messy and a ticket queue node is hard to trust.

When should I use a List vs a LinkedList shows up in a counter. Name a ticket queue node, not “a real-world scenario”.

Don’t do this with When should I use a List vs a LinkedList: losing the next pointer on delete. Interviewers spot it in ten seconds.

After When should I use a List vs a LinkedList, Kabir should still remember losing the next pointer on delete.

One breath for When should I use a List vs a LinkedList, then a ticket queue node, then losing the next pointer on delete. Sit down.

Exam tip

Say When should I use a List vs a LinkedList in one breath, then head → next → …, then losing the next pointer on delete.

Example

# When should I use a List vs a LinkedList
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)

When should I use a List vs a LinkedList: dry-run [4, 1, 3]. Say the list after one step.

Short notes

DefWhen should I use a List vs a LinkedList — Kabir uses it for a ticket queue node in a counter.
RuleWhen should I use a List vs a LinkedList → head → next → ….
RememberWhen should I use a List vs a LinkedList + time vs memory (a counter).
UseWhen should I use a List vs a LinkedList in a counter (a ticket queue node).
TrapWhen should I use a List vs a LinkedList — losing the next pointer on delete.
ExWhen should I use a List vs a LinkedList → a ticket queue node.

When should I use a List vs a LinkedList

Example

Short notes

Questions

When should I use a List vs a LinkedList

Example

Short notes

Questions