DSA · Theory

Sum Of Distances

Theory

758/810

Sum Of Distances is a DSA idea you prove with a Sum Of Distances dry-run, not with a slogan.

Sum Of Distances on the board: one Sum Of Distances step Vikram can write from memory. Then say what a Sum Of Distances dry-run looks like after.

Without Sum Of Distances, a viva board gets messy and a Sum Of Distances dry-run is hard to trust.

Vikram ships Sum Of Distances in a viva board. That is the use case worth saying.

Don’t do this with Sum Of Distances: skipping the failure case for Sum Of Distances. Interviewers spot it in ten seconds.

Sum Of Distances is not a lonely heading. Vikram ties it to a Sum Of Distances dry-run.

Close Sum Of Distances with: “If I skip it, a Sum Of Distances dry-run goes wrong like this: skipping the failure case for Sum Of Distances.”

Exam tip

Board: a Sum Of Distances dry-run. Dry-run Sum Of Distances. Name the trap: skipping the failure case for Sum Of Distances.

# Sum Of Distances
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)

Sum Of Distances: dry-run [4, 1, 3]. Say the list after one step.

DefSum Of Distances — Vikram uses it for a Sum Of Distances dry-run in a viva board.
RuleSum Of Distances → one Sum Of Distances step Vikram can write from memory.
RememberSum Of Distances + time vs memory (a viva board).
UseSum Of Distances in a viva board (a Sum Of Distances dry-run).
TrapSum Of Distances — skipping the failure case for Sum Of Distances.
ExSum Of Distances → a Sum Of Distances dry-run.