Bite-sized flashcards to memorize algorithm patterns, not solutions — a study companion for LeetCode and coding interviews.
Given an array and a target, find two numbers that add up to it.
Store complements in a hash map. For each num, check if target - num exists. O(n) time, O(n) space.
Stop grinding problems blindly. Learn to recognize the underlying algorithm patterns that top engineers use in coding interviews.
Each card shows a popular coding interview problem with a direct link to solve it on LeetCode.
Before flipping, try to identify the algorithm pattern. This builds the neural pathways that matter.
Flip the card to see the pattern, approach, and complexity. Spaced repetition locks it in.
Flashcards organized by the core patterns tested at FAANG, startups, and everywhere in between. Built for LeetCode practice that sticks.
18 cards
14 cards
16 cards
12 cards
22 cards
24 cards
10 cards
15 cards
11 cards
13 cards
9 cards
8 cards
Most engineers spend weeks solving hundreds of LeetCode problems, only to forget the approach days later. The problem isn't practice — it's how you practice.
YeetCode uses active recall and spaced repetition — the same techniques behind medical school flashcards — to help you internalize algorithm patterns instead of memorizing individual solutions.
Whether you're a beginner learning your first data structures or a senior engineer brushing up before a FAANG loop, YeetCode meets you where you are.
Flashcards for coding interview prep. Start building pattern recognition today — it's completely free.
Start practicing nowNo signup required · 150+ flashcards · Always free
Get notified when we add new patterns and flashcards.