DSA / DATA STRUCTURES
RUN THE DATA.
BEAT THE CLOCK.
You're a data runner. Move through a tiny obstacle course, then prove you understood what just happened. Every level teaches one DSA idea through play.
01 — PLAYMake the right move in a 20-second mini challenge.
02 — UNLOCKClear the run to unlock a DSA decision.
03 — LEARNAnswer one question and get the exact reason why.
DATA STRUCTURES
Queue Rush
RUN SCORE
Play well. Learn fast.
Play well. Learn fast.
0 pts
🏁
RUN COMPLETE.
WHAT YOU ACTUALLY LEARNED
• Queue = first in, first out (FIFO)
• Stack = last in, first out (LIFO)
• Binary search works by repeatedly cutting the search space in half
• A priority queue serves the highest-priority item first
• Big-O describes how an algorithm's work grows as input grows