Data Structures Algorithms Big-O Notation Practice

Command Palette

Search for a command to run...

Sign In Sign Up

Data Structures Algorithms Big-O Notation

Two Pointers Fast & Slow Pointers Sliding Window Binary Search Prefix Sums Recursion Sorting Backtracking 1D Dynamic Programming Greedy Intervals Bit Operations Depth-First Search Breadth-First Search 2D Dynamic Programming Two-Heaps Pattern Dijkstra's Algorithm A* Search Algorithm Floyd-Warshall's Algorithm Bellman-Ford Algorithm Prim's Algorithm Kruskal's Algorithm Topological Sort DAG Shortest Path

AlgorithmsDepth-First Search

Depth-First Search

An algorithm for traversing graphs by exploring as far as possible along each branch.

Definition

Where complexity meets clarity.
By Armas Zarra.

Topics

Data Structures
Algorithms
Big-O Notation
Robotics
AI Research
Machine Learning

Practice

Blind 75
LeetCode 75
NeetCode 150

Legal

Privacy Policy
Terms of Service

© 2026 Armas Films LLC

Built with ♥ by Armas Zarra

Back to Algorithms

Depth-First Search

Content coming soon.