LeetCode Patterns
How to Spot a Dynamic Programming Problem in Interviews
Learn to recognize dynamic programming by finding repeated choices, merged subproblems, and the smallest reusable state before writing code.
12 min read
LeetCode Patterns
Every post on the algorithm patterns behind the problem set.
LeetCode Patterns
LeetCode 75: A Pattern-Based Study Plan That Works
Turn LeetCode 75 into a pattern-based curriculum using grouped practice, delayed re-solves, mixed review, and clear reasoning.
12 min read
LeetCode Patterns
LeetCode Patterns: The 22 That Cover the Problem Set
LeetCode patterns are the reason two people who have solved the same number of problems can walk into the same interview with completely different odds. One…
11 min read
LeetCode Patterns
Monotonic Stack Explained: The Next Greater Element Template
A monotonic stack is an ordinary stack with one rule attached: its contents are kept sorted, and anything that would break the order is popped first. That…
8 min read
LeetCode Patterns
The Sliding Window Algorithm: Template and Eight Worked Problems
The sliding window algorithm turns a nested loop over every subarray into a single pass with two indices. It is the highest-leverage pattern in interview…
8 min read
LeetCode Patterns
Topological Sort Explained: Kahn's Algorithm and the DFS Version
A topological sort orders the nodes of a directed graph so that every edge points forwards — if u must happen before v, then u comes first. That is the whole…
7 min read
Ace your next coding interview
Stealth Interview is a desktop app for macOS and Windows that reads the problem off your screen and answers with a working solution, a step-by-step explanation and its time and space complexity — while staying invisible to screen sharing.
Get Stealth Interview