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.

String Algorithms Visualizers

See how each pattern-matching strategy searches text in real time.

Rabin-Karp Algorithm

Watch a rolling hash slide across the text, comparing hash values instead of characters, and see how a hash collision triggers a character-by-character check.

KMP Algorithm

See the failure function (LPS array) built from the pattern itself, then watch the search reuse it to skip re-comparing characters after a mismatch.

Boyer-Moore Algorithm

Compare the pattern right-to-left against the text and watch the bad character rule skip large chunks of text in a single jump on a mismatch.

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.