Explore Interactive Engineering Tutorials
Pick any standalone tutorial below to learn a specific data structure, algorithm, or system concept with plain-English analogies, interactive visual steppers, and 4-language code. Want a structured goal-based study plan instead? Explore our Goal Roadmaps →
Follow these 23 tutorials in strict dependency order with live progress tracking.
Open DSA Mastery RoadmapData Structures & Algorithms Tutorials
LIVE · 23 TUTORIALSSelf-contained visual tutorials with interactive dry-run steppers, Python/C++/Java/JS code, and curated practice problems.
Arrays, Memory & In-Place Matrix Operations
Start from zero: learn what an Array actually is in computer memory, why reading is instant while shifting is slow, and how to manipulate arrays and 2D matrices in place.
Hashing (Hash Sets & Hash Maps)
Understand what a Hash Function is, how Hash Sets and Hash Maps give instant O(1) value lookups, and how to turn slow O(N^2) searches into single-pass solutions.
Prefix Sums & Kadane's Subarray Algorithm
Learn what a contiguous subarray is, how Prefix Sums answer any range sum in O(1), and how Kadane's Algorithm finds the maximum subarray sum in one pass.
Two Pointers
Understand what a Pointer index is, why Two Pointers eliminates O(N^2) nested loops using O(1) memory, and master opposite-end, read/write, and 3-way pointers.
Sliding Window
Learn what a Sliding Window is, why re-scanning overlapping subarrays wastes work, and master fixed, variable, and frequency-counted windows.
Binary Search (1D, 2D & Answer Space)
Understand what Binary Search is, why cutting a search space in half turns 1 billion steps into 30, and master Exact, Rotated, and Answer-Space Binary Search.
Linked Lists & LRU Cache
Understand what a Node is, why Linked Lists exist compared to Arrays, how to rewire pointers without losing the list, and how to build an LRU Cache.
Stacks (LIFO) & Queues (FIFO)
Learn what Stacks and Queues are from scratch, why restricting access to LIFO or FIFO makes code cleaner and faster, and how to solve bracket and Min-Stack problems.
Monotonic Stack & Monotonic Deque
Understand what 'Monotonic' means, why keeping a stack sorted turns O(N^2) 'next greater' searches into O(N), and how a Monotonic Deque tracks window maximums.
Recursion Fundamentals & Subsets
Understand how Recursion and the Call Stack actually work, why Backtracking needs an 'Undo' step, and how to generate all 2^N Subsets.
Combinations, Permutations & Grid Backtracking
Master the difference between Combinations (order doesn't matter) and Permutations (order matters), plus 2D Grid Backtracking for Word Search and N-Queens.
Binary Trees (DFS, BFS & Bottom-Up Recursion)
Learn what a Binary Tree is from scratch, master Preorder/Inorder/Postorder DFS and Level-Order BFS, and solve Height, Diameter, and LCA problems.
Binary Search Trees (BST)
Understand what makes a Binary Tree a Binary Search Tree (BST), why it gives O(log N) search AND insertion, and how to validate and query BSTs.
Heaps & Priority Queues (Top-K & Two Heaps)
Understand what a Binary Heap is, how it stores a tree inside a flat array, and how to solve Top-K and Streaming Median problems in O(N log K).
Tries (Prefix Trees)
Understand what a Trie (Prefix Tree) is from scratch, why Hash Maps cannot do fast prefix autocomplete, and how to build and search a Trie.
Intervals (Sorting, Merging & Sweep Line)
Understand what an Interval is, why sorting by start time or end time is the universal first step, and how to merge or remove overlapping intervals.
Greedy Algorithms
Understand what a Greedy Algorithm is, when making the best local choice guarantees the global best answer, and when you must use DP instead.
Graph Fundamentals, BFS & DFS
Understand what a Graph is (Vertices, Edges, Directed/Undirected), how to build an Adjacency List, and when to use Graph DFS vs. Multi-Source BFS.
Topological Sort & Directed Cycle Detection
Understand what a Directed Acyclic Graph (DAG) and Indegree are, and how Kahn's Algorithm orders tasks with prerequisites or detects deadlocks.
Dijkstra's Shortest Path & Disjoint Set Union (Union-Find)
Master Dijkstra's Min-Heap Shortest Path for weighted graphs and Disjoint Set Union (Union-Find) for near-O(1) dynamic connectivity.
1D Linear & Knapsack Dynamic Programming
Master Dynamic Programming for product-company interviews: learn how to spot DP vs. Greedy, the 4-stage Brute-Force → Memoization → Tabulation → O(1) Space blueprint, and 0/1 vs. Unbounded Knapsack.
2D Grid, String & Subsequence DP
Master 2D Dynamic Programming for product-company interviews: Grid Path DP, Two-String Alignment (Longest Common Subsequence & Edit Distance), and O(N log N) Longest Increasing Subsequence.
Bit Manipulation
Understand binary numbers and bitwise operators from scratch, and master XOR pair cancellation and Brian Kernighan's n & (n - 1) lowest-bit trick.
More Engineering Tutorial Tracks Coming Soon
BigOSlate is expanding with visual tutorials for System Design, Object-Oriented Design, and Database Internals.
High-Level System Design (HLD) Tutorials
Standalone tutorials on Load Balancers, Consistent Hashing, Redis Caching, Kafka Streams, Sharding, CAP Theorem, and real system designs.
Low-Level Design (LLD) & Design Patterns Tutorials
Clear tutorials with UML diagrams and 4-language code for SOLID principles, Creational/Structural/Behavioral GoF patterns, and concurrency.
SQL, Indexing & Database Internals Tutorials
Visual deep dives into how relational and NoSQL engines store data on disk, traverse B+ Trees, and execute transactions safely.