DSA · Theory

Longest Repeated Substring

← All stacks

Theory

350/810

Longest Repeated Substring

Longest Repeated Substring sits in a file explorer. Farhan’s job is folder on disk. Write that first.

For Longest Repeated Substring, time vs memory is in play. Don’t blame it until you have traced folder on disk.

Longest Repeated Substring exists so Farhan can keep folder on disk correct in a file explorer.

Longest Repeated Substring shows up in a file explorer. Name folder on disk, not “a real-world scenario”.

Longest Repeated Substring trap — unbalanced BST becoming a list. Farhan loses marks for that every viva.

Place Longest Repeated Substring next to nearby DSA work — left < root < right is the link.

Viva for Longest Repeated Substring — what it is → left < root < right → the mistake (unbalanced BST becoming a list).

Diagram

Exam tip

For Longest Repeated Substring: definition + a file explorer + one failure.

Example

# Longest Repeated Substring
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)

Longest Repeated Substring: dry-run [4, 1, 3]. Say the list after one step.

Short notes

DefLongest Repeated Substring — Farhan uses it for folder on disk in a file explorer.
RuleLongest Repeated Substring → left < root < right.
RememberLongest Repeated Substring + time vs memory (a file explorer).
UseLongest Repeated Substring in a file explorer (folder on disk).
TrapLongest Repeated Substring — unbalanced BST becoming a list.
ExLongest Repeated Substring → folder on disk.

DSA · Theory

Longest Repeated Substring

← All stacks

Theory

350/810

Longest Repeated Substring

Longest Repeated Substring sits in a file explorer. Farhan’s job is folder on disk. Write that first.

For Longest Repeated Substring, time vs memory is in play. Don’t blame it until you have traced folder on disk.

Longest Repeated Substring exists so Farhan can keep folder on disk correct in a file explorer.

Longest Repeated Substring shows up in a file explorer. Name folder on disk, not “a real-world scenario”.

Longest Repeated Substring trap — unbalanced BST becoming a list. Farhan loses marks for that every viva.

Place Longest Repeated Substring next to nearby DSA work — left < root < right is the link.

Viva for Longest Repeated Substring — what it is → left < root < right → the mistake (unbalanced BST becoming a list).

Diagram

Exam tip

For Longest Repeated Substring: definition + a file explorer + one failure.

Example

# Longest Repeated Substring
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)

Longest Repeated Substring: dry-run [4, 1, 3]. Say the list after one step.

Short notes

DefLongest Repeated Substring — Farhan uses it for folder on disk in a file explorer.
RuleLongest Repeated Substring → left < root < right.
RememberLongest Repeated Substring + time vs memory (a file explorer).
UseLongest Repeated Substring in a file explorer (folder on disk).
TrapLongest Repeated Substring — unbalanced BST becoming a list.
ExLongest Repeated Substring → folder on disk.

Longest Repeated Substring

Example

Short notes

Questions

Longest Repeated Substring

Example

Short notes

Questions