Brainback
subjects · stem · computer science

Data structures

Hash maps aren't magic.

stemincluded on every plan

the shape of this subject

The right data structure is often the whole solution. Brainback trains the reflex of asking 'what am I looking up, and by what key?' before you write.

Because data structures rewards the students who do the reps — and punishes the ones who outsource them.

quick facts
discipline
STEM
parent subject
Computer science
typical weekly load
3-6 problem sets · 3-5 hours · 1-2 recall sessions
covered on plan
all plans (free forever)
what's in the box

Every data structures concept Brainback covers.

Add Data structures as a Learn subject and every problem in these areas routes to the Socratic tutor — attempt-first, hint-laddered, output-guarded.

T01Arrays
T02Linked lists
T03Trees
T04Heaps
T05Hash tables
T06Graphs
a real session

What one turn in data structures actually looks like.

Attempt → correction → guiding question. No answer. Ever. Verbatim from a beta session.

brainback tutor · learn mode · data structuresattempt-first
You (attempt)

I'll use a min-heap of size k to track the k largest elements seen so far…

Brainbackships the question

Do you need order, or just membership? That decides your structure.

no answer · one guiding question · your next move

two libraries

How real attempts start. How Brainback nudges.

attempt starters (student side)
  • I'll use a min-heap of size k to track the k largest elements seen so far…
guiding questions (brainback side)
  • Do you need order, or just membership? That decides your structure.

the anti-pattern

What data structures looks like when the AI does the thinking.

Answer machines make data structures look like a solved problem. It isn't. The exam room reveals whose reasoning was built and whose was rented.

the failure mode this subject teaches is subtle — and expensive
common mistakes brainback catches
  • M1Applying a formula without checking whether the conditions actually hold.
  • M2Skipping the sanity check — 'does the sign / magnitude make sense?'
  • M3Memorizing steps instead of reasoning about why they're legal.
  • M4Reading past the setup and diving straight into computation.

the recall card

What a spaced-repetition card looks like in data structures.

Every wrong attempt and low-scored explain-back becomes a card. SM-2 schedules them — the tricky ones come back tomorrow, the solid ones drift out to next week, then next month.

recall card · due todayease 2.5 · reps 3

Recall the core concept in your own words. Then apply it to a fresh example under 2 minutes.

againhardgoodeasy

data structures — ready when you are

Start your first data structures session.

Attempt-first. Never the answer. Add it as a Learn subject in 30 seconds.