DSA Tools

Interactive companions for the DSA course. Everything runs in your browser — your code never leaves it, and no login is needed. Pick a tool:

Time Complexity Playground

Paste a Python function and walk through the course's 5-step Big-O derivation: variables and T(n), a per-line operation-count table, simplification, and the final class — then benchmark real runtimes against theoretical curves.

  • 5-step analysis of loops and recursion
  • Safe in-browser benchmarking with charts
  • Built-in course examples
Recursive Functions Visualizer

Write a recursive Python function and watch it run: frames push and pop on the call stack while the call tree draws itself, with repeated calls flagged — plus time and space analysis on demand.

  • Step-by-step call stack and call tree replay
  • Trace your own code, sandboxed
  • Recurrence-method time & space analysis
BT/BST Coding Assistant

Generate fresh binary tree and binary search tree practice questions for the final's coding part — solve first, then reveal the full solution with complexity analysis and walkthroughs.

  • Four question types: iterative/recursive × BT/BST
  • Solutions stay hidden until you ask
  • Your OpenRouter key, your choice of model

The tools assist your DSA reasoning — they don't replace it.