Blind75
The canonical 75-problem Blind 75 subset of the Neetcode curriculum: enough breadth to OA-prep without the long tail. Worked solutions and prose live here; the full 150-problem expansion (with stub links back into this page for shared problems) is on Blind150.
Arrays
Contains Duplicate
Contains Duplicate on Leetcode
Valid Anagram
Two Sum
Group Anagrams
Top K Frequent Elements
Top K Frequent Elements on Leetcode
Product of Array Except Self
Product of Array Except Self on Leetcode
Encode and Decode Strings
Encode and Decode Strings on Leetcode (★ Premium)
Graph
Longest Consecutive Sequence
Longest Consecutive Sequence on Leetcode
Two Pointers
Valid Palindrome
3Sum
Container with Most Water
Container with Most Water on Leetcode
Sliding Window
Best Time to Buy & Sell Stock
Best Time to Buy & Sell Stock on Leetcode
Longest Substring Without Repeating Characters
Longest Substring Without Repeating Characters on Leetcode
Longest Repeating Character Replacement
Longest Repeating Character Replacement on Leetcode
Minimum Window Substring
Minimum Window Substring on Leetcode
Stack
Valid Parentheses
Binary Search
Search Rotated Sorted Array
Search Rotated Sorted Array on Leetcode
Find Minimum in Rotated Sorted Array
Find Minimum in Rotated Sorted Array on Leetcode
Linked List
Reverse Linked List
Reverse Linked List on Leetcode
Merge Two Linked Lists
Merge Two Linked Lists on Leetcode
Reorder List
Remove Nth Node from End of List
Remove Nth Node from End of List on Leetcode
Linked List Cycle
Merge K Sorted Lists
Merge K Sorted Lists on Leetcode
Trees
Invert Binary Tree
Invert Binary Tree on Leetcode
Maximum Depth of Binary Tree
Maximum Depth of Binary Tree on Leetcode
Same Tree
Subtree of Another Tree
Subtree of Another Tree on Leetcode
Lowest Common Ancestor of a BST
Lowest Common Ancestor of a BST on Leetcode
Binary Tree Level Order Traversal
Binary Tree Level Order Traversal on Leetcode
Validate Binary Search Tree
Validate Binary Search Tree on Leetcode
Kth Smallest Element in a BST
Kth Smallest Element in a BST on Leetcode
Construct Tree from Preorder and Inorder Traversal
Construct Tree from Preorder and Inorder Traversal on Leetcode
Binary Tree Max Path Sum
Binary Tree Max Path Sum on Leetcode
Serialize and Deserialize Binary Tree
Serialize and Deserialize Binary Tree on Leetcode
Tries
Implement Trie
Design Add and Search Word Data Structure
Design Add and Search Word Data Structure on Leetcode
Word Search II
Heap / Priority Queue
Find Median from Data Stream
Find Median from Data Stream on Leetcode
Backtracking
Combination Sum
Word Search
Graphs
Number of Islands
Clone Graph
Pacific Atlantic Waterflow
Pacific Atlantic Waterflow on Leetcode
Course Schedule
Number of Connected Components in Graph
Number of Connected Components in Graph on Leetcode (★ Premium)
Graph Valid Tree
Graph Valid Tree on Leetcode (★ Premium)
Advanced Graphs
Alien Dictionary
Alien Dictionary on Leetcode (★ Premium)
1-D Dynamic Programming
Climbing Stairs
House Robber
House Robber II
Longest Palindromic Substring
Longest Palindromic Substring on Leetcode
Palindromic Substrings
Palindromic Substrings on Leetcode
Decode Ways
Coin Change
Maximum Product Subarray
Maximum Product Subarray on Leetcode
Word Break
Longest Increasing Subsequence
Longest Increasing Subsequence on Leetcode
2-D Dynamic Programming
Unique Paths
Longest Common Subsequence
Longest Common Subsequence on Leetcode
Greedy
Maximum Subarray
Jump Game
Intervals
Insert Interval
Merge Intervals
Non-Overlapping Intervals
Non-Overlapping Intervals on Leetcode
Meeting Rooms
Meeting Rooms on Leetcode (★ Premium)
Meeting Rooms II
Meeting Rooms II on Leetcode (★ Premium)
Math & Geometry
Rotate Image
Spiral Matrix
Set Matrix Zeroes
Bit Manipulation
Number of 1 Bits
Counting Bits
Reverse Bits
Missing Number
Sum of Two Integers
Backlinks (3)
1. Blind150 /wiki/csp/neetcode/blind150/
The full Neetcode 150 expansion: Blind 75 plus 75 follow-on problems for fuller coverage. The 75 shared problems are stubs that point at the worked solution on Blind75; the 75 extras have their full structure here.
Arrays
Contains Duplicate
Worked solution on the Blind 75 page · Leetcode
2. Neetcode /wiki/csp/neetcode/
“We all die. The goal isn’t to live forever, the goal is to create something that will.” — Chuck Palahniuk
Originally the AI suffix stood for archived intellect, however these days it has concretised to becoming an Augmenting Infrastructure — a place from which to branch out in many directions.
Within this site you will find self-contained material in the form of project posts and blog posts, but also external links 1 to other work – my own as well as not.