Neetcode Blind 75
The Blind 75 is a well-known collection of algorithmic practice problems widely used for coding interview preparation.
Azhar Khan75 problems19 Easy49 Med7 Hard
Progress0%
0 solved75 left
Easy
0/19
Medium
0/49
Hard
0/7
#323Premium
Number of Connected Components in an Undirected Graph
Medium✓ Solution📹 Video
#261Premium
Graph Valid Tree
Medium✓ Solution📹 Video
#297
Serialize and Deserialize Binary Tree
Hard✓ Solution📹 Video
#105
Construct Binary Tree from Preorder and Inorder Traversal
Medium✓ Solution📹 Video
#98
Validate Binary Search Tree
Medium✓ Solution📹 Video
#104
Maximum Depth of Binary Tree
Easy✓ Solution📹 Video
#23
Merge k Sorted Lists
Hard✓ Solution📹 Video
#3
Longest Substring Without Repeating Characters
Medium✓ Solution📹 Video
Discussion
Start the conversation
Ask a question or share what stood out to you — someone reading this later will thank you.