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.

Dynamic Programming

Fibonacci DP

Planned

Memoise or tabulate to turn O(2ⁿ) into O(n).

O(n)

Climbing Stairs

Planned

ways(n) = ways(n−1) + ways(n−2).

O(n)

0/1 Knapsack

Planned

Best value with capacity W, each item taken at most once.

O(n·W)

Longest Common Subsequence

Planned

2-D table over prefixes of both strings.

O(m·n)

Longest Increasing Subsequence

Planned

O(n²) DP or O(n log n) with patience sorting.

O(n log n)

Coin Change

Planned

Fewest coins (or number of ways) to make an amount.

O(n·amount)

Matrix Chain Multiplication

Planned

Best parenthesisation via interval DP.

O(n³)

Grid Unique Paths

Planned

paths(r, c) = paths(r−1, c) + paths(r, c−1).

O(m·n)