Pattern Mastery 250 — Video Course
Every solution taught using the BASIC Framework: Breakdown, Assess, Structure, Implement, Check. Walkthroughs available in both Java and Python.
Videos are being published continuously. New content added weekly — check back often.
Arrays & Hashing
Foundational pattern for frequency counting, grouping, and mapping relationships
Two Pointers
Converge from both ends or walk in tandem to solve sorted-array and string problems
Sliding Window
Maintain a dynamic window over contiguous elements to optimize subarray and substring queries
Stack
Use LIFO ordering to match pairs, evaluate expressions, and track monotonic sequences
Binary Search
Halve the search space each step to find targets in sorted or monotonic structures
Linked List
Pointer manipulation, fast-slow runners, and in-place reversal techniques
Trees
Recursive and iterative traversals for binary trees and BSTs
Tries
Prefix-tree structures for efficient string searching and autocomplete
Heap / Priority Queue
Efficiently track the smallest or largest elements in a dynamic collection
Backtracking
Explore all candidates by building choices incrementally and pruning invalid paths
Graphs
BFS, DFS, and connected-component techniques for grid and adjacency-list problems
Advanced Graphs
Dijkstra, Bellman-Ford, and weighted shortest-path algorithms
Dynamic Programming
Break problems into overlapping subproblems and cache results for optimal solutions
Greedy
Make locally optimal choices at each step to arrive at a globally optimal solution
Pattern Recognition Flash Cards
Test yourself on pattern identification before jumping into code. Given a problem description, can you name the pattern and approach?
Coming Soon — Launching Q2 2026Interview Checklists
Pre-interview preparation lists, day-of guides, and post-interview review templates — everything to keep you calm and structured.
Coming Soon