Star

Blind 75 (This Page Is Like Grind75 With YouTube Links)

If you prefer to watch NeetCode solve all 75 on YouTube in Python, be my guest

Question Difficulty YouTube Solution Topics Covered Blog Walkthrough (If Applicable)
Two Sum Easy Arrays; Hashmaps (depending on implementation)
Best Time To Buy And Sell Stock Easy Arrays
Contains Duplicate Easy Arrays; Sorting
Maximum Subarray Medium Arrays; Dynamic Programming; Memoization (depending on implementation); Kadane's Algorithm (depending on Implementation)
Maximum Product Subarray Medium Arrays; Dynamic Programming
Find Minimum In Rotated Sorted Array Medium Arrays; Binary Search
Search In Rotated Sorted Array Medium Arrays; Binary Search
3Sum Medium Arrays; Two-Pointer-Technique
Container with Most Water Medium Arrays; Two-Pointer Technique
Sum Of Two Integers Medium Bit Manipulation
Number Of 1 Bits Easy Bit Manipulation
Counting Bits Easy Bit Manipulation; Dynamic Programming (depending on implementation)
Missing Number Easy Sorting (depending on implementation); Hashmaps (depending on implementation); bit manipulation (depending on implementation); Gaussian summation (if you think of that on the spot)
Reverse Bits Easy Bit Manipulation; Memoization (depending on implementation)
Climbing Stairs Easy Dynamic Programming (depending on implementation); Memoization (depending on implementation); can also be solved with Fibonacci, Binets Method, or even brute force
Coin Change Medium

(Java - Note that BackToBackSWE has a great video as well, but you need a login to see code )

 Dynamic Programming
Longest Increasing Subsequence Medium Dynamic Programming
Longest Common Subsequence Medium Dynamic Programming (depending on implementation); memoization (depending on implementation)
Word Break Medium Dynamic Programming (depending on implementation); memoization (depending on implementation); Breadth-First Search (depending on implementation);
Combination Sum IV Medium Dynamic Programming
House Robber Medium Dynamic Programming (Depending on implementation); memoization (depending on implementation)
House Robber II Medium Dynamic Programming
Decode Ways Medium Dynamic Programming
Unique Paths Medium Dynamic Programming
Jump Game Medium Dynamic Programming (depending on implementation); backtracking (depending on implementation); greedy algorithm (depending on implementation)
Clone Graph Medium Graphs; Depth-First Search (depending on implementation); breadth-first search (depending on implementation)
Course Schedule Medium Graphs; Backtracking (depending on implementation); Depth-First Search (depending on implementation); topological sort (depending on implementation)
Pacific Atlantic Water Flow Medium Graphs; Breadth-First Search (depending on implementation); Depth-First Search (depending on implementation);
Number Of Islands Medium Graphs; Breadth-First Search (depending on implementation); Depth-First Search (depending on implementation); Union Find (depending on implementation)
Longest Consecutive Sequence Medium Brute force; sorting (depending on implementation); hashmaps (depending on implementation)
(PREMIUM ONLY) Alien Dictionary Hard Graphs; Breadth-First Search (depending on implementation); Depth-first search (depending on implementation)
(PREMIUM ONLY) Graph Valid Tree Medium Graphs; Depth-First Search (depending on implementation); Union Find (depending on implementation)
(PREMIUM ONLY) Number Of Connected Components In An Undirected Graph Medium Graphs; Depth-First Search (depending on implementation); Disjoint Set Union (depending on implementation)
Insert Interval Medium Intervals; linear search (depending on implementation); binary search (depending on implementation)
Merge Intervals Medium Intervals; Graphs (depending on implementation); sorting (depending on implementation)
Non-overlapping Intervals Medium Intervals; Dynamic Programming (depending on implementation); greedy algorithm (depending on implementation)
(PREMIUM ONLY) Meeting Rooms Easy Intervals; Brute Force (depending on implementation); sorting (depending on implementation)
(PREMIUM ONLY) Meeting Rooms II Medium Intervals; Priority Queues (depending on implementation); Intuition
Reverse linked list Easy Linked lists; iteration (depending on implementation); recursion (depending on implementation)
Detect Cycle In Linked List Easy Linked lists; Hash Table (depending on implementation); Fast And Slow Pointers (Depending on Implementation)
Merge Two Sorted Lists Easy Linked lists; Hash Table (depending on implementation); Fast And Slow Pointers (Depending on Implementation)
Merge K Sorted Lists Hard Linked lists; Priority queue (depending on implementation); divide and conquer (depending on implementation)
Remove Nth Node From End Of List Medium Linked lists
Reorder List Medium Linked lists
Set Matrix Zeroes Medium Matrix
Spiral Matrix Medium Matrix
Rotate Image Medium Matrix
Word Search (Bloomberg Favorite) Medium Matrix; Backtracking
Longest Substring Without Repeating Characters Medium Strings; Sliding Window Technique
Longest Repeating Character Replacement Medium

Note that this is at 800 likes/330 dislikes, which is relatively poor for Nick White.The NeetCode One is higher rated

 Strings; Sliding Window Technique; Binary Search (Depending on implementation)
Minimum Window Substring Hard Strings; Sliding Window Technique; Hashmaps
Valid Anagram Easy Strings; Hashmaps (depending on implementation); sorting (depending on implementation)
Group Anagrams Medium Strings; Hashmaps
Valid Parentheses Easy Strings; Stacks
Valid Palindrome Easy Strings; Two-Pointer Technique
Longest Palindromic Substring Medium Strings; Dynamic Programming (depending on implementation); Manacher's Algorithm (depending on implementation)
Palindromic Substrings Medium Strings; Dynamic Programming (depending on implementation); Manacher's Algorithm (depending on implementation)
Encode And Decode Strings Medium Strings; Non-ASCII Characters (depending on implementation); serialization and deserialization (depending on implementation)
Maximum Depth Of Binary Tree Easy Trees; Recursion (depending on implementation); Breadth-First search (depending on implementation); iteration (depending on implementation)
Same Tree Easy Trees; Recursion (depending on implementation); Iteration (depending on implementation)
Invert Binary Tree Easy Trees; Recursion (depending on implementation); Iteration (depending on implementation); neither here nor there, but this problem is kind of a meme now. Thanks Ben Awad
Binary Tree Maximum Path Sum Hard Trees; Depth-First Search
Binary Tree Level-Order Traversal Medium Trees; Breadth-First Search; Queues
Serialize And Deserialize Binary Tree Hard Trees; Depth-First Search (depending on implementation)
Subtree Of Another Tree Easy Trees; Depth-First Search (depending on implementation); String Matching (depending on implementation)
Subtree Of Another Tree Easy Trees; Depth-First Search (depending on implementation); String Matching (depending on implementation)
Construct Binary Tree From Preorder And Inorder Traversal Medium Trees; Recursion
Validate Binary Search Tree Medium Trees; Binary Search Trees; Tree Traversal With Recursion Or Iteration
Kth Smallest Element in a BST Medium Trees; Binary Search Trees; Tree Traversal With Recursion Or Iteration
Lowest Common Ancestor Of A Binary Search Tree Medium Trees; Binary Search Trees; Tree Traversal With Recursion Or Iteration
Implement Trie (Prefix Tree) Medium Trees; Trie
Design Add And Search Words Data Structure Medium Trees; Trie
Word Search II Hard Trees; Trie; Backtracking
Merge K Sorted Lists Hard Heaps; priority queue (depending on implementation)
Top K Frequent Elements Medium Heaps (depending on implementation); Hoare's Selection Algorithm/QuickSelect (depending on implementation); Lomuto's Partition Scheme (Depending on implementation)
Find Median From Data Stream Hard Heaps (depending on implementation); Two Heaps; Sorting (depending on implementation); Multiset with two pointers (depending on implementation)

Start Grindly blinding Blind75

Original Blind75 link (and basis for this site)

Like Blind75? Try Grind75

Grind75 by Yangshun Tay, creator of Blind75

List of LeetCode company frequencies

LeetCode Patterns, by Sean Prashad

14 Coding Patterns, An Overview

A HackerNoon Article

LeetCode questions by 14 Coding Patterns

LeetCode Aggregate link

CTCI LeetCode Mappings

Another aggregate LeetCode Link