I make videos about math and CS. Explore mathematics, algorithms, and assembly programming through detailed explanations and beautiful Manim animations.

Network Flow: Max Flow Problem, Ford-Fulkerson Algorithm, max-flow min-cut theorem
5:32
Network Flow: Max Flow Problem, Ford-Fulkerson Algorithm, max-flow min-cut theorem
x86-64 Assembly Arithmetic and Bitwise Operations Explained
31:06
x86-64 Assembly Arithmetic and Bitwise Operations Explained
Explanation of Basic x86-64 Assembly Programming Techniques
18:51
Explanation of Basic x86-64 Assembly Programming Techniques
Binary Search Trees Explained: Search, Insertion, Deletion
1:56
Binary Search Trees Explained: Search, Insertion, Deletion
Graphs Explained: Undirected and directed graphs, Euler and Hamiltonian paths, handshaking theorem
4:56
Graphs Explained: Undirected and directed graphs, Euler and Hamiltonian paths, handshaking theorem
Tree Data Structure: Binary trees, expression trees, in-order, pre-order, post-order traversals
2:23
Tree Data Structure: Binary trees, expression trees, in-order, pre-order, post-order traversals
Introduction to Data Structures and Algorithms
1:08
Introduction to Data Structures and Algorithms
Greedy Algorithms: Proof of Correctness for Kruskal’s Algorithm
1:47
Greedy Algorithms: Proof of Correctness for Kruskal’s Algorithm
Merge Sort in x86-64 Assembly language
13:04
Merge Sort in x86-64 Assembly language
Dynamic Programming: The Knapsack Problem, DP table, implementation in Python
1:51
Dynamic Programming: The Knapsack Problem, DP table, implementation in Python
Bipartite Matching. Is there a perfect matching?
1:09
Bipartite Matching. Is there a perfect matching?
Network Flow explained: Ford-Fulkerson, Max-flow min-cut theorem
5:31
Network Flow explained: Ford-Fulkerson, Max-flow min-cut theorem
Proving the Vertex Cover Problem is NP-Complete | 3-SAT to Vertex Cover Reduction
3:31
Proving the Vertex Cover Problem is NP-Complete | 3-SAT to Vertex Cover Reduction
The SAT Problem: First problem proven to be NP-Complete
1:41
The SAT Problem: First problem proven to be NP-Complete
Greedy Algorithms: Understand how to prove Kruskal’s Algorithm
1:47
Greedy Algorithms: Understand how to prove Kruskal’s Algorithm
Dynamic Programming: The Knapsack Problem Explained
1:51
Dynamic Programming: The Knapsack Problem Explained
Divide and Conquer Algorithms Introduction
1:22
Divide and Conquer Algorithms Introduction
Introduction to NP-Complete Problems
1:01
Introduction to NP-Complete Problems
What is a B-tree? Properties, Insertion, Deletion.
2:46
What is a B-tree? Properties, Insertion, Deletion.
Red-Black Tree | Properties, Insertion, Deletion, Elementary Operations.
3:46
Red-Black Tree | Properties, Insertion, Deletion, Elementary Operations.
Heap Sort Explained | Pseudocode and Example
3:18
Heap Sort Explained | Pseudocode and Example
Quicksort Explained | Pseudocode and Example
3:09
Quicksort Explained | Pseudocode and Example
Merge Sort Explained | Pseudocode and Example
2:20
Merge Sort Explained | Pseudocode and Example
Radix Sort Explained | Pseudocode and Example
1:16
Radix Sort Explained | Pseudocode and Example
Counting Sort Explained | Pseudocode and Example
3:11
Counting Sort Explained | Pseudocode and Example
What is the Gaussian Integral?
0:35
What is the Gaussian Integral?
What is 1 + cos t + cos 2t + … + cos Nt equal to?
0:56
What is 1 + cos t + cos 2t + … + cos Nt equal to?
Induction and Invariants | Definitions and Examples
1:52
Induction and Invariants | Definitions and Examples
Big O Notation, Big Omega Notation, and Big Theta Notation | Definitions and Examples
1:33
Big O Notation, Big Omega Notation, and Big Theta Notation | Definitions and Examples
3D Parametric Heart 💗| Happy Valentine’s Day!
0:57
3D Parametric Heart 💗| Happy Valentine’s Day!