DSA practice list
Blind 75, by pattern
The Blind 75 list, practised on thita. Every problem is grouped under the 99 DSA patterns it teaches, with NeetCode's topic kept as a tag, so you can see which technique each problem is drilling instead of only which data structure it uses.
Each problem opens in an editor in the browser, where you run your code against the problem's test cases. Every problem on this list that is live on thita runs in all 6 of Python, C++, Java, JavaScript, Go and C#. When a pattern feels solid, take it into an AI mock interview: you solve a problem out loud, the interviewer runs your code and asks the follow-up questions a real one would.
All 75 problems are on thita.
Last updated
The 75 problems on thita, grouped by pattern
Families and patterns follow the DSA patterns sheet. The tag on each problem is its NeetCode topic.
Array/Matrix Manipulation Patterns
Spiral Traversal
- Spiral MatrixMediumMath & Geometry
Set Matrix Zeroes (In-place Marking)
- Set Matrix ZeroesMediumMath & Geometry
Hashing - Frequency Map / Counting
- Valid AnagramEasyArrays & Hashing
- Two SumEasyArrays & Hashing
- Group AnagramsMediumArrays & HashingEditorial
Product Except Self (Prefix/Suffix Products)
- Product of Array Except SelfMediumArrays & Hashing
Hashing - Previously Seen / Existence Check
- Contains DuplicateEasyArrays & HashingEditorial
- Longest Consecutive SequenceMediumArrays & HashingEditorial
In-place Rotation
- Rotate ImageMediumMath & Geometry
Linked List Manipulation Patterns
Reordering / Partitioning
- Reorder ListMediumLinked List
In-place Reversal
- Reverse Linked ListEasyLinked ListEditorial
Merging Two Sorted Lists
- Merge Two Sorted ListsEasyLinked List
Two Pointers
Fast & Slow (Cycle Detection)
- Linked List CycleEasyLinked ListEditorial
Converging (Sorted Array Target Sum)
- 3SumMediumTwo PointersEditorial
- Container With Most WaterMediumTwo PointersEditorial
Expanding From Center (Palindromes)
- Longest Palindromic SubstringMedium1-D Dynamic ProgrammingEditorial
- Palindromic SubstringsMedium1-D Dynamic ProgrammingEditorial
Sliding Window
Variable Size (Condition-Based)
- Longest Substring Without Repeating CharactersMediumSliding Window
- Longest Repeating Character ReplacementMediumSliding Window
- Minimum Window SubstringHardSliding Window
Binary Search Patterns
Find Min/Max in Rotated Sorted Array
- Find Minimum In Rotated Sorted ArrayMediumBinary SearchEditorial
- Search In Rotated Sorted ArrayMediumBinary Search
Stack Patterns
String Manipulation Patterns
Palindrome Check (Two Pointers / Reverse)
- Valid PalindromeEasyTwo Pointers
Heap (Priority Queue) Patterns
K-way Merge
- Merge K Sorted ListsHardLinked List
Top K Elements (Selection/Frequency)
- Top K Frequent ElementsMediumArrays & Hashing
Two Heaps for Median Finding
- Find Median From Data StreamHardHeap / Priority QueueEditorial
Tree Traversal Patterns (DFS & BFS)
Recursive Preorder Traversal
- Invert Binary TreeEasyTreesEditorial
- Same TreeEasyTrees
- Construct Binary Tree From Preorder And Inorder TraversalMediumTreesEditorial
Recursive Inorder Traversal
- Validate Binary Search TreeMediumTrees
- Kth Smallest Element In a BstMediumTreesEditorial
Recursive Postorder Traversal
- Maximum Depth of Binary TreeEasyTrees
- Binary Tree Maximum Path SumHardTreesEditorial
Graph Traversal Patterns (DFS & BFS)
Graph DFS - Connected Components / Island Counting
- Number of IslandsMediumGraphs
- Pacific Atlantic Water FlowMediumGraphs
Graph BFS - Topological Sort (Kahn's Algorithm)
- Alien DictionaryHardAdvanced GraphsEditorial
Deep Copy / Cloning
- Clone GraphMediumGraphsEditorial
Greedy Patterns
Interval Merging/Scheduling
- Insert IntervalMediumIntervalsEditorial
- Merge IntervalsMediumIntervals
- Non Overlapping IntervalsMediumIntervalsEditorial
- Meeting RoomsEasyIntervalsEditorial
Backtracking Patterns
Word Search / Path Finding in Grid
- Word SearchMediumBacktracking
- Word Search IIHardTries
Combination Sum
- Combination SumMediumBacktrackingEditorial
Dynamic Programming (DP) Patterns
1D Array (Kadane's Algorithm for Max/Min Subarray)
- Maximum Product SubarrayMedium1-D Dynamic Programming
- Maximum SubarrayMediumGreedy
2D Array (Unique Paths on Grid)
- Unique PathsMedium2-D Dynamic Programming
1D Array (Fibonacci Style)
- Climbing StairsEasy1-D Dynamic ProgrammingEditorial
- House RobberMedium1-D Dynamic ProgrammingEditorial
- House Robber IIMedium1-D Dynamic ProgrammingEditorial
- Decode WaysMedium1-D Dynamic ProgrammingEditorial
2D Array (Longest Common Subsequence - LCS)
- Longest Common SubsequenceMedium2-D Dynamic Programming
1D Array (Word Break Style)
- Word BreakMedium1-D Dynamic Programming
Stock problems
- Best Time to Buy And Sell StockEasySliding WindowEditorial
1D Array (Coin Change / Unbounded Knapsack Style)
- Coin ChangeMedium1-D Dynamic ProgrammingEditorial
Longest Increasing Subsequence (LIS)
- Longest Increasing SubsequenceMedium1-D Dynamic Programming
Bit Manipulation Patterns
Bitwise XOR - Finding Single/Missing Number
- Missing NumberEasyBit Manipulation
- Sum of Two IntegersMediumBit ManipulationEditorial
Bitwise DP - Counting Bits Optimization
- Counting BitsEasyBit ManipulationEditorial
Bitwise AND - Counting Set Bits (Hamming Weight)
- Number of 1 BitsEasyBit Manipulation
- Reverse BitsEasyBit ManipulationEditorial
Design Patterns
Tries
- Implement Trie Prefix TreeMediumTriesEditorial
- Design Add And Search Words Data StructureMediumTriesEditorial
Design (General/Specific)
- Encode and Decode StringsMediumArrays & HashingEditorial
A study plan for the Blind 75
Six blocks in NeetCode's topic order. Solve each problem, then write down the pattern in one line. On the last day of each week, re-solve two problems from memory before starting the next block.
Week 1: Arrays, two pointers, sliding window and stacks (16 problems)
Hash maps for lookups, the two pointer moves, when a window grows and shrinks, and the monotonic stack.
Week 2: Binary search and linked lists (8 problems)
Searching on the answer, not just the array, and pointer surgery on lists without losing a node.
Week 2: Trees, tries and heaps (15 problems)
Recursive DFS that returns something useful, level-order BFS, prefix trees, and top-k with a heap.
Week 3: Backtracking and graphs (9 problems)
Choose, explore, un-choose; grid BFS and DFS; union-find; topological sort; Dijkstra and minimum spanning trees.
Week 3: Dynamic programming (12 problems)
State, transition and base case, written out loud before any code; then the 2-D grid and string tables.
Week 4: Greedy, intervals, math and bits (15 problems)
Proving a greedy choice, sorting intervals by start, matrix walks, and XOR tricks.
Also in the original 2018 Blind 75
NeetCode's version swaps this problem out; it is not counted in the 75.
- Combination Sum IVMediumIn the original 2018 listEditorial
Questions, answered
- What is the Blind 75?
- The Blind 75 is a list of 75 LeetCode problems that Yangshun Tay posted on Blind in 2018 as a short route through the topics coding interviews draw on. This page follows NeetCode's version of it, the one neetcode.io shows, practised on thita. Thita is not affiliated with NeetCode or Blind; the list name is used only to say which problems are here.
- Is NeetCode 75 the same as Blind 75?
- Yes, in practice. "NeetCode 75" is how many people refer to the Blind 75 as neetcode.io presents it. NeetCode's version matches the original 2018 list except for one problem: it has Longest Common Subsequence where the original has Combination Sum IV. This page follows NeetCode's version and shows Combination Sum IV as an extra row, not counted in the 75.
- How does the Blind 75 relate to the NeetCode 150 and 250?
- All 75 Blind 75 problems are in the NeetCode 150, which adds 75 more (52 Medium, 14 Hard and 9 Easy) for broader coverage of every topic. The NeetCode 250 adds another 100 on top. With under four weeks, do the Blind 75; with one to two months, the NeetCode 150; with three months or more, the NeetCode 250.
- Why are the problems grouped by pattern instead of by NeetCode's topics?
- A topic says which data structure a problem uses; a pattern says which move solves it. "Trees" covers both a level-order BFS and a postorder DFS that returns heights, and interviewers test whether you can tell those apart. Grouping by thita's 99 patterns puts problems that are solved the same way next to each other. NeetCode's topic is still shown on every problem.
- Which languages can I practise the Blind 75 in?
- Every problem on the Blind 75 that is live on thita runs in all 6 of Python, C++, Java, JavaScript, Go and C#. Your code runs against the problem's test cases in the browser, with no setup or local compiler.
- Are all 75 problems available on thita?
- All 75 problems are on thita.
- Is it free?
- Browsing the list and running your code against the test cases is free on the Starter plan, which also includes unlimited AI coach sessions, 5 AI credits a month for Code Coach reviews and the free AI mock interview allowance. Editorials marked on this page are free to read. Pro adds 100 AI credits a month, more mock interviews and the remaining editorials.
- How long does the Blind 75 take?
- The plan on this page spreads it over four weeks at about three problems a day, with a review day each week. Going faster works if you already know most patterns; the risk is solving each problem once and not being able to rebuild the approach a month later.
- Is the Blind 75 enough to pass coding interviews?
- It covers the core patterns most coding rounds draw on, but solving a list is not the same as solving a new problem under time pressure while explaining yourself. Use the list to learn the patterns, then practise unseen problems from the same patterns and rehearse out loud. The NeetCode 150 is the natural next step.
Keep going
- NeetCode 150 sheet
- NeetCode 250 sheet
- Practise these problems in an AI coding interview
- NeetCode 150 vs NeetCode 250 vs Blind 75: which to do
- A NeetCode 150 study plan for 4, 8 or 12 weeks
- Is the NeetCode 150 enough for FAANG?
- The NeetCode 250, the complete list by topic
- The NeetCode 150 in Java
- The NeetCode 150 in C++
- The NeetCode 150 in Go
- The NeetCode 150 in C#
- Blind 75 vs NeetCode vs pattern-based preparation
NeetCode is a trademark of its owner; thita is not affiliated with or endorsed by NeetCode.