Backend Study Lab · Games
← All games

Graph Traversal Navigator

Choose BFS or DFS, place visited checks, handle cycles, and cover disconnected graph components.

Concept
BFS and DFS graph traversal
Difficulty
Intermediate
Play time
7-10 minutes
Path
Algorithmic Reasoning

Interactive scenario

Playable game area: Make the next backend decision

Use the controls below. Feedback appears immediately and final scores stay in this browser.

Concept notes

Why this decision matters

Graph Traversal Navigator is focused practice for BFS and DFS graph traversal. It explains why each answer is safe, risky, or production-ready.

Navigate the frontier deliberately instead of treating BFS and DFS as interchangeable templates.

Learning objectives

  • Choose BFS for unweighted shortest hops.
  • Use iterative DFS for deep exploration.
  • Handle cycles and disconnected components.

How to play

  1. Inspect the graph trace.
  2. Choose the traversal and visited strategy.
  3. Review how the frontier changes.

Scoring

  • Correct traversal decisions add 250 points.
  • Misses enter local review.
  • A perfect run scores 1,000.

Backend concept notes

BFS explores equal-distance layers through a queue; DFS explores one branch through a stack.

Visited timing controls duplicate work and termination in cyclic graphs.

Common mistakes

  • Using first-hit DFS for shortest paths.
  • Marking visited too late.
  • Starting from one node when all components must be audited.

Review misses from this game

Related Backend Study Lab tools

Use tools from the main site when you want to inspect real inputs.

Keep practicing nearby backend concepts while the mental model is fresh.

Algorithms Advanced

Bloom Filter Tuner

Tune Bloom-filter capacity, hash count, verification, saturation, and deletion behavior without introducing false negatives.

Time
8-11 minutes
Concept
Bloom filters and probabilistic membership
  • Algorithmic Reasoning
  • bloom filter
  • hashing
  • probability
Play Bloom Filter Tuner
Queues Intermediate

Message Queue Simulator

Tune workers, retries, and dead-letter behavior while jobs move through an async queue with failures and poison messages.

Time
7-11 minutes
Concept
Async jobs, retries, visibility timeout, and dead-letter queues
  • Production Reliability
  • Async Workflows
  • queues
  • retries
  • dead-letter queue
Play Message Queue Simulator
Algorithms Intermediate

Pattern Signal Arena

Recognize monotonic-stack, interval-merge, heap, and probabilistic membership signals from problem constraints.

Time
7-10 minutes
Concept
Algorithm pattern recognition
  • Algorithmic Reasoning
  • algorithms
  • heaps
  • intervals
Play Pattern Signal Arena

FAQ

Short answers for how this game fits backend interview and study practice.

Does BFS always find the shortest path?

It finds fewest-edge paths in unweighted graphs.

Why prefer iterative DFS in deep graphs?

An explicit stack avoids language call-stack limits.

Leaderboard

Top 10 scores for the current ruleset. No account required.

Loading leaderboard...

    Finish the game to load your latest local score.