| Dynamic Programming in Java: Demystifying the 0/1 Knapsack Pattern | Hard | | | | | |
| Pattern Blueprint: The Backtracking Master Template | Medium | | | | | |
| Pattern Blueprint: The Monotonic Stack Template | Medium | | | | | |
| Pattern Blueprint: The Universal Sliding Window Template | Medium | | | | | |
| Pattern Blueprint: The Two Pointers Master Template | Medium | | | | | |
| DSA Masterclass: Dijkstra’s vs. Bellman-Ford (Shortest Path Algorithms) | Hard | | | | | |
| Binary Search: Curated Practice Problems | Medium | | | | | |
| DSA Masterclass Module 12: Binary Search Patterns | Easy | | | | | |
| System Design Module 8: CAP Theorem & Consistency Models | Hard | | | | | |
| DSA Complexity: Curated Practice Problems | Easy | | | | | |
| System Design Module 6: Database Design (SQL vs NoSQL) | Medium | | | | | |
| Dynamic Programming: Curated Practice Problems | Medium | | | | | |
| The Dynamic Programming Masterclass: Tabulation, Memoization, and State | Hard | | | | | |
| Graphs: Curated Practice Problems | Medium | | | | | |
| The Graph Mastery Blueprint: BFS, DFS, and Representation | Medium | | | | | |
| DSA Masterclass Module 11: Greedy Algorithms | Medium | | | | | |
| Greedy Algorithms: Curated Practice Problems | Medium | | | | | |
| Heaps: Curated Practice Problems | Medium | | | | | |
| DSA Masterclass Module 13: Heaps & Priority Queues | Medium | | | | | |
| Lesson: The FAANG Interview Checklist | Easy | | | | | |
| DSA Masterclass Module 15: Mock Interviews & Strategy | Easy | | | | | |
| Linked List Deep Dive: Memory, References, and Pointers | Medium | | | | | |
| Linked Lists: Curated Practice Problems | Medium | | | | | |
| LLD Design Patterns: Curated Practice Problems | Medium | | | | | |
| LLD Masterclass: Curated Practice Problems | Medium | | | | | |
| DSA Masterclass Module 2: The Problem Solving Mindset | Easy | | | | | |
| Recursion & Backtracking: Curated Practice Problems | Medium | | | | | |
| Mastering Recursion: The Three Laws and the Decision Tree | Medium | | | | | |
| Sliding Window Pattern: Curated Practice Problems | Medium | | | | | |
| Stack & Queue: Curated Practice Problems | Medium | | | | | |
| DSA Masterclass Module 6: Stack, Queue & Monotonic Stack | Easy | | | | | |
| DSA Masterclass Module 1: Time & Space Complexity | Easy | | | | | |
| Trees: Curated Practice Problems | Medium | | | | | |
| The Binary Tree Masterclass: BFS, DFS, and Structural Intuition | Medium | | | | | |
| Tries: Curated Practice Problems | Hard | | | | | |
| DSA Masterclass Module 14: Tries & Advanced Structures | Hard | | | | | |
| Arrays & Two Pointers: Curated Practice Problems | Medium | | | | | |
| Lesson: How to Explain DSA Solutions | Easy | | | | | |
| DSA Masterclass: The Bitmasking & XOR Blueprint | Hard | | | | | |
| Merge Intervals Pattern in Java: Conquer Overlapping Subarrays Efficiently | Medium | | | | | |
| Company Playbook: The Google 15 | Hard | | | | | |
| Company Playbook: The Meta 15 | Hard | | | | | |
| 3Sum - Finding Unique Triplets | Medium | | | | | |
| 8: Alien Dictionary (Hard) | Hard | | | | | |
| 15: Basic Calculator II (Hard) | Hard | | | | | |
| Binary Search (Easy) | Easy | | | | | |
| Binary Tree In-order Traversal (Easy) | Easy | | | | | |
| Binary Tree Level Order Traversal | Medium | | | | | |
| 29: Burst Balloons (Hard) | Hard | | | | | |
| Coin Change | Medium | | | | | |
| Combination Sum | Medium | | | | | |
| Container With Most Water (Medium) | Medium | | | | | |
| 46: Count Vowels Permutation (Hard) | Hard | | | | | |
| Course Schedule (Topological Sort) | Medium | | | | | |
| 43: Cut Off Trees for Golf Event (Hard) | Hard | | | | | |
| Daily Temperatures (Monotonic Stack) | Medium | | | | | |
| 42: Design In-Memory File System (Hard) | Hard | | | | | |
| 39: Design Search Autocomplete System (Hard) | Hard | | | | | |
| 13: Edit Distance (Hard) | Hard | | | | | |
| 24: Employee Free Time (Hard) | Hard | | | | | |
| 34: Find Median from Data Stream (Hard) | Hard | | | | | |
| 27: First Missing Positive (Hard) | Hard | | | | | |
| Flood Fill (Easy) | Easy | | | | | |
| Group Anagrams | Medium | | | | | |
| 33: Insert Interval (Hard) | Hard | | | | | |
| Jump Game | Medium | | | | | |
| Koko Eating Bananas (Search on Answer) | Medium | | | | | |
| Kth Largest Element in an Array | Medium | | | | | |
| 14: K-th Smallest in Lexicographical Order (Hard) | Hard | | | | | |
| 26: Largest Rectangle in Histogram (Hard) | Hard | | | | | |
| 16: LFU Cache Design (Hard) | Hard | | | | | |
| Linked List Cycle (Easy) | Easy | | | | | |
| 22: Longest Increasing Path in a Matrix (Hard) | Hard | | | | | |
| Longest Increasing Subsequence | Medium | | | | | |
| Longest Substring with K Distinct Characters | Medium | | | | | |
| 11: Longest Valid Parentheses (Hard) | Hard | | | | | |
| Lowest Common Ancestor of a Binary Tree | Medium | | | | | |
| 5: LRU Cache Design (Hard) | Hard | | | | | |
| 41: Making A Large Island (Hard) | Hard | | | | | |
| Maximum Sum Subarray of Size K | Easy | | | | | |
| 25: Maximal Rectangle (Hard) | Hard | | | | | |
| 45: Maximize Score After N Operations (Hard) | Hard | | | | | |
| Maximum Depth of Binary Tree | Easy | | | | | |
| 35: Maximum Profit in Job Scheduling (Hard) | Hard | | | | | |
| 2: Median of Two Sorted Arrays (Expert) | Hard | | | | | |
| Meeting Rooms (Interval Scheduling) | Easy | | | | | |
| Merge Intervals | Medium | | | | | |
| 4: Merge K Sorted Lists (Hard) | Hard | | | | | |
| 23: Minimum Window Subsequence (Hard) | Hard | | | | | |
| 37: Minimum Number of K Consecutive Bit Flips (Hard) | Hard | | | | | |
| Minimum Window Substring | Hard | | | | | |
| Move Zeroes (Easy) | Easy | | | | | |
| 12: N-Queens (Hard) | Hard | | | | | |
| Analyze Nested Loops | Easy | | | | | |
| Next Greater Element I | Medium | | | | | |
| Number of 1 Bits (Easy) | Easy | | | | | |
| Number of Islands (DFS/BFS) | Medium | | | | | |
| 38: Palindrome Pairs (Hard) | Hard | | | | | |
| 48: Parallel Courses III (Hard) | Hard | | | | | |
| Permutations | Medium | | | | | |
| 49: Prefix and Suffix Search (Hard) | Hard | | | | | |
| 44: Race Car (Hard) | Hard | | | | | |
| Range Sum Query (Easy) | Easy | | | | | |
| Analyze Recursive Depth | Easy | | | | | |
| 31: Regular Expression Matching (Hard) | Hard | | | | | |
| Remove Duplicates from Sorted Array (In-Place) | Easy | | | | | |
| 7: Reverse Nodes in k-Group (Hard) | Hard | | | | | |
| Reverse a Linked List | Easy | | | | | |
| Search in Rotated Sorted Array | Medium | | | | | |
| 36: Serialize and Deserialize BST (Hard) | Hard | | | | | |
| 21: Serialize and Deserialize Binary Tree (Hard) | Hard | | | | | |
| 50: Sliding Puzzle (Hard) | Hard | | | | | |
| 6: Sliding Window Maximum (Hard) | Hard | | | | | |
| 30: Smallest Range Covering Elements from K Lists (Hard) | Hard | | | | | |
| 10: Sudoku Solver (Hard) | Hard | | | | | |
| 40: Swim in Rising Water (Hard) | Hard | | | | | |
| 1: Trapping Rain Water (Hard) | Hard | | | | | |
| 9: Binary Tree Maximum Path Sum (Hard) | Hard | | | | | |
| Two Sum II: Input Array Is Sorted (Two Pointers) | Easy | | | | | |
| Valid Anagram (Easy) | Easy | | | | | |
| 47: Valid Arrangement of Pairs (Hard) | Hard | | | | | |
| Valid Palindrome (Easy) | Easy | | | | | |
| Valid Parentheses | Easy | | | | | |
| Validate Binary Search Tree | Medium | | | | | |
| 32: Word Break II (Hard) | Hard | | | | | |
| 17: Word Ladder (Hard) | Hard | | | | | |
| 28: Word Ladder II (Hard) | Hard | | | | | |
| 3: Word Search II (Hard) | Hard | | | | | |
| The Sliding Window Pattern: Eliminating Redundant Calculations | Medium | | | | | |
| Tree Traversals in Java: Mastering BFS and DFS for Coding Interviews | Easy | | | | | |
| Trie (Prefix Tree) in Java: The Ultimate Data Structure for String Problems | Hard | | | | | |
| The Two Pointers Pattern: Mastering Linear Array Optimizations | Medium | | | | | |
| Centroid Decomposition in Java: Solving Tree Path Problems | Medium | | | | | |
| Heavy-Light Decomposition in Java: Optimizing Tree Queries | Hard | | | | | |
| Link-Cut Trees in Java: Dynamic Tree Connectivity | Hard | | | | | |
| Suffix Automaton in Java: The Ultimate String Data Structure | Medium | | | | | |
| AVL Trees: Self-Balancing Binary Search Trees | Medium | | | | | |
| The 'Small Files' Problem in Data Lakes: Why Your Kafka Sink is Slow | Easy | | | | | |
| Kosaraju's Algorithm for Strongly Connected Components | Hard | | | | | |
| Manacher's Algorithm in Java: Linear Time Palindrome Search | Medium | | | | | |
| Mo's Algorithm: Offline Range Queries | Hard | | | | | |
| Red-Black Trees in Java: The Engine Behind TreeMap and HashMap | Medium | | | | | |
| Segment Tree Data Structure: Efficient Range Queries | Medium | | | | | |
| Skip Lists in Java: The Probabilistic Alternative to Balanced Trees | Medium | | | | | |
| System Design: Solving the Top K Problem (Heavy Hitters) | Hard | | | | | |
| Tarjan's Algorithm in Java: Finding Strongly Connected Components | Medium | | | | | |
| Trie (Prefix Tree) Data Structure - Java Implementation and Use Cases | Medium | | | | | |
| A* Search Algorithm in Java: Heuristic Pathfinding | Easy | | | | | |
| B-Trees and B+ Trees in Java: The Engines of Modern Databases | Hard | | | | | |
| Backtracking Pattern in Java: Permutations and Combinations | Medium | | | | | |
| Bellman-Ford Algorithm in Java: Shortest Paths with Negative Weights | Medium | | | | | |
| Bloom Filters in Java: Probabilistic Data Structures | Medium | | | | | |
| Boyer-Moore Voting Algorithm in Java: Finding the Majority Element | Medium | | | | | |
| Dijkstra's Algorithm in Java: Finding the Shortest Path | Medium | | | | | |
| Fenwick Trees (Binary Indexed Trees) in Java | Medium | | | | | |
| Floyd-Warshall Algorithm in Java: All-Pairs Shortest Paths | Medium | | | | | |
| Huffman Coding in Java: Lossless Data Compression | Hard | | | | | |
| Kadane's Algorithm in Java: Maximum Sum Subarray | Medium | | | | | |
| Kruskal's Algorithm in Java: Finding the Minimum Spanning Tree | Easy | | | | | |
| Longest Common Subsequence (LCS) in Java: Dynamic Programming Guide | Easy | | | | | |
| Lowest Common Ancestor (LCA) in Java: Binary Trees and DAGs | Hard | | | | | |
| LRU Cache Implementation in Java: $O(1)$ Strategy | Medium | | | | | |
| Matrix Traversal in Java: Spiral, Diagonal, and Flood Fill | Medium | | | | | |
| N-Queens Problem in Java: Solving Constraints with Backtracking | Hard | | | | | |
| Prim's Algorithm in Java: Minimum Spanning Tree via Greedy Growth | Medium | | | | | |
| Rabin-Karp Algorithm in Java: Efficient String Searching with Hashing | Medium | | | | | |
| Sudoku Solver in Java: Efficient Backtracking and Pruning | Medium | | | | | |
| Suffix Arrays and Suffix Trees in Java: Advanced String Structures | Hard | | | | | |
| Z-Algorithm in Java: Linear Time String Matching | Hard | | | | | |
| BFS (Breadth First Search) in Java: Level-Order and Shortest Path | Medium | | | | | |
| Big-O Notation in Java: Time and Space Complexity for Interview Problem Solving | Easy | | | | | |
| Binary Search Pattern in Java: Efficiently Searching Sorted Data | Easy | | | | | |
| DFS (Depth First Search) in Java: Tree and Graph Traversals | Medium | | | | | |
| Dutch National Flag Pattern in Java: Efficient Three-Way Partitioning | Medium | | | | | |
| Fast & Slow Pointers in Java: Detecting Cycles and Finding Middle Elements | Medium | | | | | |
| In-place Reversal of a Linked List in Java: Efficient Memory Management | Medium | | | | | |
| Monotonic Queue Pattern in Java: Efficiently Solving Sliding Window Maximum | Medium | | | | | |
| Monotonic Stack Pattern in Java: Efficiently Finding Next Greater/Smaller Elements | Medium | | | | | |
| Prefix Sum Pattern in Java: Efficiently Calculate Range Sums and Subarray Properties | Medium | | | | | |
| Sorting Algorithms in Java: QuickSort, MergeSort, and HeapSort Explained | Medium | | | | | |
| Topological Sort in Java: Handling Dependencies with Kahn's Algorithm | Medium | | | | | |
| Union Find (DSU) in Java: Connectivity and Cycle Detection | Medium | | | | | |