The most curated list of 75 essential algorithmic challenges for software engineering interviews. Free, no account required.
| Status | Title | Difficulty | Acceptance |
|---|
| Two Sum | Easy | 49.2% | |
| Longest Substring Without Repeating Characters | Medium | 33.8% | |
| Container With Most Water | Medium | 54.1% | |
| 3Sum | Medium | 32.8% | |
| Remove Nth Node From End of List | Medium | 41.5% | |
| Valid Parentheses | Easy | 40.2% | |
| Merge Two Sorted Lists | Easy | 62.5% | |
| Merge k Sorted Lists | Hard | 49.5% | |
| Search in Rotated Sorted Array | Medium | 39.2% | |
| Combination Sum | Medium | 68.5% |
The Blind 75 is a curated set of 75 algorithmic coding problems, originally compiled by a tech lead at a top Silicon Valley company. It has become the gold standard preparation list for software engineering interviews at FAANG-level companies including Google, Meta, Amazon, Apple, and Microsoft.
The Blind 75 is a curated list of 75 essential coding problems compiled by a tech lead at a major Silicon Valley company. It covers the most high-frequency patterns tested in software engineering interviews at companies like Google, Meta, Amazon, and Microsoft.
Yes! All 75 Blind 75 problems are completely free. You can solve them in Python, JavaScript, TypeScript, C++, or Java without creating an account.
The Blind 75 covers: Arrays, Binary Search, Dynamic Programming, Graph Traversal (BFS/DFS), Linked Lists, Binary Trees, Heaps, Intervals, Matrix problems, and the Two-Pointer pattern.
Most engineers complete the Blind 75 in 4–8 weeks when practicing consistently for 1–2 hours per day. TheCoder's structured track helps you progress systematically through each topic pattern.