Blind 75
The Blind 75 is a curated list of the most important coding interview questions, created by a Facebook tech lead. This roadmap covers these essential questions across key data structure and algorithm topics like arrays, strings, trees, graphs and dynamic programming. Working through these problems will help build strong fundamentals for technical interviews.
Arrays & Hashing
#179
easy
blind75
#183
easy
arrays
blind75
#188
easy
blind 75
#191
medium
blind75
#194
medium
blind 75
#197
medium
blind75
#199
medium
blind75
array
#201
medium
blind75
array
hash-set
Two Pointers
#203
easy
blind75
string
two-pointers
#205
medium
blind75
array
two-pointers
#207
medium
blind75
array
two-pointers
#209
easy
blind75
array
dynamic-programming
Sliding Window
#211
medium
blind75
string
sliding-window
hash-map
#213
medium
blind75
string
sliding-window
#215
hard
blind75
string
sliding-window
hash-map
Stack
#217
easy
blind75
string
stack
Binary Search
#219
medium
blind75
array
binary-search
#221
medium
blind75
array
binary-search
Linked List
#223
easy
blind75
linked-list
#225
easy
blind75
linked-list
#227
medium
blind75
linked-list
#229
medium
blind75
linked-list
two-pointers
#231
easy
blind75
linked-list
two-pointers
#233
hard
blind75
linked-list
heap
divide-and-conquer
Trees
#235
easy
blind75
binary-tree
recursion
#237
easy
blind75
binary-tree
recursion
#239
easy
blind75
binary-tree
recursion
#241
easy
blind75
binary-tree
recursion
#243
medium
blind75
binary-search-tree
recursion
#245
medium
blind75
binary-tree
bfs
#247
medium
blind75
binary-search-tree
recursion
#249
medium
blind75
binary-search-tree
recursion
#251
medium
blind75
binary-tree
recursion
#253
hard
blind75
binary-tree
recursion
#255
hard
blind75
binary-tree
serialization
#263
medium
blind75
trie
data-structure
Heap / Priority Queue
#257
hard
blind75
heap
data-stream
Backtracking
#259
medium
blind75
backtracking
recursion
#261
medium
blind75
backtracking
matrix
#267
hard
blind75
trie
backtracking
matrix
Graphs
#269
medium
blind75
matrix
dfs
#271
medium
blind75
graph
dfs
#273
medium
blind75
matrix
dfs
#275
medium
blind75
graph
topological-sort
#277
medium
blind75
graph
union-find
#279
medium
blind75
graph
union-find
#281
hard
blind75
graph
topological-sort
Dynamic Programming
#283
easy
blind75
dynamic-programming
#285
medium
blind75
dynamic-programming
#287
medium
blind75
dynamic-programming
#289
medium
blind75
dynamic-programming
string
#291
medium
blind75
dynamic-programming
string
#293
medium
blind75
dynamic-programming
string
#295
medium
blind75
dynamic-programming
#297
medium
blind75
dynamic-programming
array
#299
medium
blind75
dynamic-programming
string
#301
medium
blind75
dynamic-programming
array
#305
medium
blind75
dynamic-programming
string
#307
medium
blind75
dynamic-programming
array
#309
medium
blind75
dynamic-programming
array
greedy
Intervals
#311
medium
blind75
intervals
#313
medium
blind75
intervals
#315
medium
blind75
intervals
greedy
#317
easy
blind75
intervals
#319
medium
blind75
intervals
greedy
Matrix
#321
medium
blind75
matrix
#323
medium
blind75
matrix
#325
medium
blind75
matrix
Bit Manipulation
#327
easy
blind75
bit-manipulation
#329
easy
blind75
bit-manipulation
dynamic-programming
#331
easy
blind75
bit-manipulation
#333
easy
blind75
bit-manipulation
math
#335
medium
blind75
bit-manipulation