Skip to main content
DSAViz

Foundations

Core structures and the links that connect them.

  • Array
  • Stack
  • Singly Linked List
Core structuresLinked lists

Sorting and searching

Compare ordering strategies and ways to find values.

  • Bubble Sort
  • Merge Sort
  • Binary & Linear Search
SortingSearching

Trees and graphs

Explore hierarchy, traversal, networks, and connectivity.

  • Binary Search Tree
  • Graph
  • BFS vs. DFS
TreesGraphs

Advanced algorithms

Work through optimization, greedy choices, backtracking, and strings.

  • 0/1 Knapsack
  • Dijkstra's Algorithm
  • KMP
Dynamic programmingGreedyBacktrackingString algorithms

Choose a topic or scan every interactive lesson.

Browse the full index
Interview patternsLearning pathsAboutStart learning
DSAViz
Learn by topic

Foundations

Core structuresLinked lists

Sorting and searching

SortingSearching

Trees and graphs

TreesGraphs

Advanced algorithms

Dynamic programmingGreedyBacktrackingString algorithms
Browse the full index
Interview patternsLearning pathsAbout
Start learning

Free. No account required.

Backtracking Visualizers

See how trial, error, and undo explore a search space.

N-Queens Problem

Watch backtracking place queens row by row on an N×N board, retreating the instant two queens threaten each other, until a safe arrangement is found.

Sudoku Solver

See a 9×9 board fill in one cell at a time as backtracking tries each digit, checking rows, columns, and boxes, and undoing any move that leads to a dead end.

Hamiltonian Path

Trace a path that visits every node exactly once, extending it one edge at a time and backing out whenever the search paints itself into a corner.

DSAViz

Interactive lessons that connect algorithm decisions, changing data, and the code behind each step.

View the open-source project

Explore

  • Learning paths
  • Visualizer index
  • Interview patterns

Project

  • About
  • Roadmap
  • Share feedback

© 2026 DSA Visualization. Built for curious learners.