Data Structures & Algorithms course
Learn Data Structures & Algorithms step by step: 179 lessons in 15 modules with worked examples, quizzes and interview questions. Free on JavaSchoolLab.
Foundations
- Time Complexity - Big O, Omega, Theta
- Space Complexity
- Recursion
- Iteration vs Recursion
- Mathematical Analysis
- Amortized Analysis
- Bit Manipulation Basics
- Modular Arithmetic
- GCD / LCM
- Prime Numbers / Sieve
- Combinatorics
- Probability Basics
Arrays
- 1D Arrays
- 2D / Matrix
- Prefix Sum
- Suffix Sum
- Difference Array
- Kadane's Algorithm
- Sliding Window
- Two Pointers
- Fast & Slow Pointers
- Array Rotation
- Cyclic Sort
- Dutch National Flag
- Merge Intervals
- Monotonic Array
- Range Queries
Strings
- String Manipulation
- Character Frequency
- Anagram
- Palindrome
- Substrings / Subsequences
- Prefix / Suffix
- String Hashing
- Rolling Hash
- Pattern Matching
- KMP Algorithm
- Z Algorithm
- Rabin-Karp Algorithm
- Manacher's Algorithm
- Trie-based String Problems
Linked List
- Singly Linked List
- Doubly Linked List
- Circular Linked List
- Reverse Linked List
- Detect Cycle - Floyd's Algorithm
- Find Cycle Start
- Merge Linked Lists
- Intersection of Linked Lists
- Remove Nth Node
- Fast & Slow Pointer
- LRU Cache
Stack
- Stack Implementation
- Balanced Parentheses
- Monotonic Stack
- Next Greater Element
- Next Smaller Element
- Previous Greater / Smaller
- Largest Rectangle in Histogram
- Stock Span
- Expression Evaluation
- Infix / Prefix / Postfix
- Min Stack
- Max Stack
Queue / Deque
Hashing
- HashMap
- HashSet
- Frequency Map
- Collision Concepts
- Custom Hashing
- Prefix-Sum + HashMap
- Two-Sum Pattern
- Subarray Sum
- Longest Consecutive Sequence
Sorting
- Bubble Sort
- Selection Sort
- Insertion Sort
- Merge Sort
- Quick Sort
- Heap Sort
- Counting Sort
- Radix Sort
- Bucket Sort
- Stable vs Unstable Sorting
- In-place Sorting
- Comparator / Custom Sorting
- External Sorting
Searching
- Linear Search
- Binary Search
- Lower Bound
- Upper Bound
- Binary Search on Answer
- Search in Rotated Sorted Array
- Ternary Search
- Exponential Search
- Interpolation Search
Trees
- Binary Tree
- Binary Search Tree - BST
- Full / Complete / Perfect Binary Tree
- Balanced Tree
- Tree Traversal - Preorder
- Tree Traversal - Inorder
- Tree Traversal - Postorder
- Tree Traversal - Level Order
- Recursive Traversal
- Iterative Traversal
- Height / Depth
- Diameter of a Tree
- Lowest Common Ancestor
- Path Sum
- Tree View - Left View
- Tree View - Right View
- Tree View - Top View
- Tree View - Bottom View
- Boundary Traversal
- Vertical Traversal
- Zigzag Traversal
- Serialize / Deserialize a Tree
- BST Operations
- BST Validation
- Kth Smallest / Largest in BST
- Morris Traversal
Heap
- Min Heap
- Max Heap
- Heapify
- Build Heap
- Heap Sort
- Kth Largest / Smallest
- Top K Problems
- Median from Data Stream
- Two Heap Technique
- Priority Queue
Recursion & Backtracking
- Recursion Tree
- Subsets
- Subsequences
- Permutations
- Combinations
- Combination Sum
- N-Queens
- Sudoku Solver
- Rat in a Maze
- Word Search (Backtracking)
- Generate Parentheses
- Backtracking with Pruning
- Constraint Satisfaction
Greedy Algorithms
- Activity Selection
- Fractional Knapsack
- Job Sequencing
- Interval Scheduling
- Merge Intervals (Greedy)
- Minimum Platforms
- Huffman Coding
- Gas Station
- Jump Game
- Fractional Optimization
- Greedy + Heap
Divide & Conquer
- Merge Sort (Divide & Conquer)
- Quick Sort (Divide & Conquer)
- Binary Search (Divide & Conquer)
- Counting Inversions
- Closest Pair of Points
- Divide & Conquer Optimization