DSA-VerseLearn by watching code run
DashboardData StructuresAlgorithmsVisualizerCORECoding PlaygroundInterview QuestionsComplexity AnalyzerLearning NotesBookmarksLearning ProgressSettings

Algorithms

Explanations, pseudocode, an embedded interactive visualization, implementations in JavaScript, Python, Java and Go, complexity and interview variations.

Recursion and Backtracking

Basic Recursion

Planned

Base case + recursive case; how the call stack grows and unwinds.

varies

Factorial

Planned

n! = n × (n−1)!, the classic first recursive function.

O(n)

Fibonacci

Planned

Naive recursion recomputes subproblems — exponential time.

O(2ⁿ)

Tower of Hanoi

Planned

Move n−1 disks aside, move the largest, move n−1 back on top.

O(2ⁿ)

Subsets

Planned

Include / exclude each element to generate the power set.

O(n·2ⁿ)

Permutations

Planned

Choose, recurse, un-choose to list every ordering.

O(n·n!)

N-Queens

Planned

Place queens row by row, backtracking on conflicts.

O(n!)

Sudoku Solver

Planned

Fill empty cells with valid digits, undo on dead ends.

exponential