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.

Searching

Linear Search

Interactive

Checks every element from left to right until the target is found or the array ends. Works on unsorted data.

O(n) · 4 languages

Binary Search

Interactive

Searches a sorted array by repeatedly comparing the target with the middle element and discarding the half that cannot contain it.

O(log n) · 4 languages

Lower Bound

Planned

First index whose value is ≥ target in a sorted array (binary-search variant).

O(log n)

Upper Bound

Planned

First index whose value is > target in a sorted array.

O(log n)

Search in Rotated Sorted Array

Planned

Binary search that first decides which half is still sorted.

O(log n)