ViewTube

ViewTube
Sign inSign up

Sort by

Newest

Oldest

Popular

Find All Shortest Paths with BFS + Backtracking | Word Ladder II
4:51
Find All Shortest Paths with BFS + Backtracking | Word Ladder II

23 views

2d ago

BFS Graph Algorithms: Find Every Shortest Path | Word Ladder II
5:46
BFS Graph Algorithms: Find Every Shortest Path | Word Ladder II

29 views

4d ago

5 Islands, 3 Shapes: Count Distinct Islands with DFS
3:44
5 Islands, 3 Shapes: Count Distinct Islands with DFS

20 views

7d ago

The Boundary Trick for Grid DFS | Number of Enclaves (LeetCode 1020)
3:14
The Boundary Trick for Grid DFS | Number of Enclaves (LeetCode 1020)

363 views

8d ago

The Border-First DFS Trick for Surrounded Regions (LeetCode 130)
3:52
The Border-First DFS Trick for Surrounded Regions (LeetCode 130)

28 views

9d ago

Bipartite Graphs Explained: The 2-Coloring Trick That Finds Odd Cycles
4:46
Bipartite Graphs Explained: The 2-Coloring Trick That Finds Odd Cycles

150 views

10d ago

Directed Graph Cycle Detection: The DFS Rule That Finds Hidden Loops
4:51
Directed Graph Cycle Detection: The DFS Rule That Finds Hidden Loops

63 views

11d ago

Graph Algorithms: Detect a Cycle in an Undirected Graph (DFS)
4:19
Graph Algorithms: Detect a Cycle in an Undirected Graph (DFS)

40 views

12d ago

Multi-Source BFS Explained: The Grid Algorithm Behind Rotting Oranges
6:24
Multi-Source BFS Explained: The Grid Algorithm Behind Rotting Oranges

113 views

2w ago

Number of Islands Explained: DFS Flood Fill
3:56
Number of Islands Explained: DFS Flood Fill

614 views

2w ago

Flood Fill Explained: The Graph Traversal Behind Grid Problems
4:11
Flood Fill Explained: The Graph Traversal Behind Grid Problems

45 views

2w ago

Graph Algorithms: Find Connected Components with DFS
3:17
Graph Algorithms: Find Connected Components with DFS

31 views

2w ago

DFS Without Recursion: The Explicit Stack Explained
6:14
DFS Without Recursion: The Explicit Stack Explained

156 views

3w ago

Depth-First Search Finally Makes Sense: Recursion, Backtracking & the Call Stack
4:54
Depth-First Search Finally Makes Sense: Recursion, Backtracking & the Call Stack

121 views

3w ago

BFS Shortest Path: The Distance Array Trick That Makes It Work
5:16
BFS Shortest Path: The Distance Array Trick That Makes It Work

69 views

3w ago

BFS Explained: The Ripple Trick Behind Shortest Paths
3:34
BFS Explained: The Ripple Trick Behind Shortest Paths

107 views

3w ago

The Graph Complexity Formula You Need to Know: O(V + E)
4:58
The Graph Complexity Formula You Need to Know: O(V + E)

63 views

3w ago

You’re Not Solving 3 Problems—It’s One Graph (BFS Explained)
4:58
You’re Not Solving 3 Problems—It’s One Graph (BFS Explained)

341 views

3w ago

Adjacency Matrix vs Adjacency List: Why 97% of Your Graph Is Wasted
4:08
Adjacency Matrix vs Adjacency List: Why 97% of Your Graph Is Wasted

173 views

3w ago

Graph Theory Fundamentals: Paths, Cycles, Components, DAGs & Trees
6:13
Graph Theory Fundamentals: Paths, Cycles, Components, DAGs & Trees

235 views

4w ago

Graph Theory Explained: The One Idea Behind Every Network
4:01
Graph Theory Explained: The One Idea Behind Every Network

164 views

4w ago

The Dynamic Programming Finale
7:47
The Dynamic Programming Finale

154 views

1mo ago

Dynamic Programming: 10 Patterns That Make Hard Problems Click
6:11
Dynamic Programming: 10 Patterns That Make Hard Problems Click

218 views

1mo ago

The DP Logic Blueprint: A 5-Step Method to Solve Dynamic Programming Problems
8:15
The DP Logic Blueprint: A 5-Step Method to Solve Dynamic Programming Problems

143 views

1mo ago

The Convex Hull Trick Explained: From DP Formula to 28 Lines of C++
5:51
The Convex Hull Trick Explained: From DP Formula to 28 Lines of C++

109 views

1mo ago

The DP Optimization That Cuts O(n³) to O(n²) — Knuth Optimization
5:01
The DP Optimization That Cuts O(n³) to O(n²) — Knuth Optimization

262 views

1mo ago

The DP Optimization That Escapes O(KN²) — Divide & Conquer DP Explained
6:54
The DP Optimization That Escapes O(KN²) — Divide & Conquer DP Explained

121 views

1mo ago

The DP Optimization That Turns O(nk) Into O(n) | Monotonic Double-Ended Queue
6:20
The DP Optimization That Turns O(nk) Into O(n) | Monotonic Double-Ended Queue

76 views

1mo ago

The DP Speedup That Turns O(n·k) Into O(n) | Prefix Sums Explained
5:05
The DP Speedup That Turns O(n·k) Into O(n) | Prefix Sums Explained

119 views

1mo ago

When DP Loops Back: Solving Cyclic Expected-Value Equations
7:02
When DP Loops Back: Solving Cyclic Expected-Value Equations

37 views

1mo ago

Show more