Course Curriculum
Arrays
4
🔒
Circular Array Operations
🔒
Minimum Distance Between Bus Stops 🔒
Array Deletion and Modification
🔒
Remove Duplicates from Sorted Array 🔒
Array Transformation Operations
🔒
Array Traversal and Pattern Recognition
🔒
Find Common Elements in Three Sorted Arrays 🔒
Longest Mountain Subarray 🔒
Check if Array is Monotonic 🔒
Binary Tree
6
🔒
Tree Essentials & Core Mechanics
🔒
Binary Tree Inorder Traversal 🔒
Same Tree 🔒
Binary Tree Preorder Traversal 🔒
Binary Tree Postorder Traversal 🔒
Binary Tree Inorder Successor 🔒
Tree Insights & Real-World Views
🔒
Minimum Depth of Binary Tree 🔒
Merge Two Binary Trees 🔒
Recursive Decomposition Patterns (DnC)
🔒
Lowest Common Ancestor of a Binary Tree 🔒
Level-Order Logic & Queue-Driven Patterns
🔒
Check Completeness of a Binary Tree 🔒
Layout-Aware Traversals
🔒
Tree Building & Reconstruction
🔒
Serialize and Deserialize Binary Tree 🔒
Two Pointers
4
🔒
Opposite Direction Pointers
🔒
Container With Most Water 🔒
Squares of a Sorted Array 🔒
Bag of Tokens 🔒
Same Direction / Expanding Window
🔒
Move Zeroes 🔒
Minimum Time to Make Rope Colorful 🔒
In-Place Partitioning & Rearrangement
🔒
Rearrange Array Elements by Sign 🔒
Remove Duplicates from Sorted Array 🔒
Remove Duplicates from Sorted Array II 🔒
Remove Duplicates from String (In-Place) 🔒
Two-Pointer Merging & Interval Processing
🔒
Merge Two Sorted Arrays 🔒
Meeting Scheduler 🔒
Shortest Word Distance 🔒
Graph
15
🔒
Theory 🔒
Traversal (DFS/BFS)
🔒
Clone Graph 🔒
Find if Path Exists in Graph 🔒
Union Find
🔒
Graph Valid Tree 🔒
Validate Binary Tree Nodes 🔒
Connected Components
🔒
Max Area Of Island 🔒
Number Of Islands 🔒
Number Of Provinces 🔒
Graph Coloring 🔒
Cycle Detection
🔒
Topological Sort
🔒
Alien Dictionary 🔒
Course Schedule Ii 🔒
Minimum Spanning Tree 🔒
BFS-Specific
🔒
Minimum Knight Moves 🔒
Word Ladder 🔒
Dijkstra 🔒
Graph Real-Life Problems
🔒
Alien Dictionary 🔒
Graph Fundamentals 🔒
Graph Degrees & Centrality
🔒
Find the Town Judge 🔒
Maximal Network Rank 🔒
Multi-Source BFS
🔒
Stack
6
🔒
Stack Fundamentals
🔒
Parentheses Validation 🔒
Expression Evaluation
🔒
Basic Calculator 🔒
Evaluate Reverse Polish Notation 🔒
Path Navigation
🔒
Monotonic Stack
🔒
Daily Temperatures 🔒
Buildings With Ocean View 🔒
Trapping Rain Water 🔒
Stack Implementations
🔒
Min Stack 🔒
Queue Using Stacks 🔒
String Processing
🔒
Backspace String Compare 🔒
Queue
3
🔒
Design Circular Queue 🔒
Reveal Cards In Increasing Order 🔒
Sliding Window Maximum 🔒
Recursion
2
🔒
Recursive Tree Construction
🔒
Combinatorial Generation
🔒
Strobogrammatic Number II 🔒
BST
4
🔒
Basics 🔒
Returning node from recursive function 🔒
BST Application 🔒
Build BST from Preorder Traversal 🔒
Priority Queue
3
🔒
Greedy Selection Algorithms
🔒
IPO 🔒
Minimum Cost to Connect Sticks 🔒
Minimum Cost to Hire K Workers 🔒
Scheduling and Resource Management
🔒
Streaming Data Processing
🔒
Find Median from Data Stream 🔒
Stock Price Fluctuation 🔒
Tree Traversal
8
🔒
Fundamental 🔒
Applications 🔒
DnC 🔒
DnC+ Dynamic programming 🔒
BFS Preferred/BFS Only 🔒
Binary tree to graph 🔒
Special Traversal 🔒
Construct Trees 🔒
Binary Search
5
🔒
Basic 🔒
Applications 🔒
Closest distance 🔒
Rotated arrays 🔒
Matrix 🔒
Bit manipulations
4
🔒
Basics 🔒
& and | tricks 🔒
Xor 🔒
Masking 🔒
Design and Code
2
🔒
Class Design(No implementation) 🔒
Data structure design 🔒
Dynamic Programming
10
🔒
Simple Linear Approach 🔒
2D Dynamic Programming 🔒
0/1 Knapsack Problem 🔒
Palindrome Problems 🔒
Array Splitting Techniques 🔒
Graph Dynamic Programming 🔒
Multiple Linear Approaches 🔒
Advanced Linear Approach 🔒
2D Advanced Techniques 🔒
3D Dynamic Programming 🔒
HashTable
2
🔒
To avoid cycles 🔒
Be clever what to put in hash table bot the key and value 🔒
List
3
🔒
Two pointers 🔒
Fast/slow pointer 🔒
Nested 🔒
Sliding Window
5
🔒
https://janac.medium.com/what-is-the-sliding-window-algorithm-f9fcfe92b853 🔒
Rolling dictionary 🔒
Two pointer 🔒
Three Pointers 🔒
Substring matching 🔒
Backtracking
2
🔒
Backtracking Basics
🔒
Backtracking Template 🔒
N-Queens Problem 🔒
Sudoku Solver 🔒
Word Search 🔒
Maximum Score Words Formed by Letters 🔒
Permutations and Combinations
🔒
Permutations 🔒
Combinations 🔒
Combination Sum 🔒
Beautiful Arrangement 🔒
Letter Case Permutation 🔒
Array Traversals
1
🔒
Straight coding
1
🔒
Tree SerializationDeserialization
1
🔒