0
0%
0/75

Blind 75

active phase

The smallest set that still covers every core pattern. If you only have a month, this is the month.

32h of work left3 per day to finish in 5 weeks75 problems
Easy
0
of 19
Medium
0
of 49
Hard
0
of 7
By topic
Arrays0/6
Strings0/5
Hashing0/1
Binary Search0/2
Two Pointers0/2
Sliding Window0/3
Matrix0/4
Intervals0/5
Linked List0/6
Stacks & Queues0/1
Trees0/8
Binary Search Tree0/3
Heap / Priority Queue0/2
Graphs0/7
Greedy0/1
Dynamic Programming0/10
Recursion & Backtracking0/1
Tries0/3
Bit Manipulation0/4
Design (LLD)0/1
Next phase: Top 150

Adds 75 problems on top of this one.

The sheet

Click the circle on any row to cycle status: unsolved, solved, attempted, revisit.

0 / 75 solved
Arrays0 / 6
1
Best Time to Buy and Sell Stock
EArrays
2
Longest Consecutive Sequence
MArrays
3
Maximum Subarray
MArrays
4
Product of Array Except Self
MArrays
5
Contains Duplicate
EArrays
6
Maximum Product Subarray
MArrays
Strings0 / 5
1
Group Anagrams
MStrings
2
Longest Palindromic Substring
MStrings
3
Palindromic Substrings
MStrings
4
Valid Anagram
EStrings
5
Valid Palindrome
EStrings
Hashing0 / 1
1
Two Sum
EHashing
Binary Search0 / 2
1
Search in Rotated Sorted Array
MBinary Search
2
Find Minimum in Rotated Sorted Array
MBinary Search
Two Pointers0 / 2
1
3Sum
MTwo Pointers
2
Container With Most Water
MTwo Pointers
Sliding Window0 / 3
1
Longest Substring Without Repeating Characters
MSliding Window
2
Minimum Window Substring
HSliding Window
3
Longest Repeating Character Replacement
MSliding Window
Matrix0 / 4
1
Rotate Image
MMatrix
2
Spiral Matrix
MMatrix
3
Word Search
MMatrix
4
Set Matrix Zeroes
MMatrix
Intervals0 / 5
1
Meeting Rooms IIpremium
MIntervals
2
Merge Intervals
MIntervals
3
Insert Interval
MIntervals
4
Meeting Roomspremium
EIntervals
5
Non-overlapping Intervals
MIntervals
Linked List0 / 6
1
Linked List Cycle
ELinked List
2
Merge k Sorted Lists
HLinked List
3
Merge Two Sorted Lists
ELinked List
4
Remove Nth Node From End of List
MLinked List
5
Reverse Linked List
ELinked List
6
Reorder List
MLinked List
Stacks & Queues0 / 1
1
Valid Parentheses
EStacks & Queues
Trees0 / 8
1
Binary Tree Level Order Traversal
MTrees
2
Binary Tree Maximum Path Sum
HTrees
3
Invert Binary Tree
ETrees
4
Maximum Depth of Binary Tree
ETrees
5
Serialize and Deserialize Binary Tree
HTrees
6
Construct Binary Tree from Preorder and Inorder Traversal
MTrees
7
Same Tree
ETrees
8
Subtree of Another Tree
ETrees
Binary Search Tree0 / 3
1
Kth Smallest Element in a BST
MBinary Search Tree
2
Validate Binary Search Tree
MBinary Search Tree
3
Lowest Common Ancestor of a Binary Search Tree
MBinary Search Tree
Heap / Priority Queue0 / 2
1
Find Median from Data Stream
HHeap / Priority Queue
2
Top K Frequent Elements
MHeap / Priority Queue
Graphs0 / 7
1
Clone Graph
MGraphs
2
Course Schedule
MGraphs
3
Number of Islands
MGraphs
4
Alien Dictionarypremium
HGraphs
5
Graph Valid Treepremium
MGraphs
6
Number of Connected Components in an Undirected Graphpremium
MGraphs
7
Pacific Atlantic Water Flow
MGraphs
Greedy0 / 1
1
Jump Game
MGreedy
Dynamic Programming0 / 10
1
Climbing Stairs
EDynamic Programming
2
Coin Change
MDynamic Programming
3
Decode Ways
MDynamic Programming
4
House Robber
MDynamic Programming
5
Longest Common Subsequence
MDynamic Programming
6
Longest Increasing Subsequence
MDynamic Programming
7
Unique Paths
MDynamic Programming
8
Word Break
MDynamic Programming
9
House Robber II
MDynamic Programming
10
Combination Sum IV
MDynamic Programming
Recursion & Backtracking0 / 1
1
Combination Sum
MRecursion & Backtracking
Tries0 / 3
1
Implement Trie (Prefix Tree)
MTries
2
Design Add and Search Words Data Structure
MTries
3
Word Search II
HTries
Bit Manipulation0 / 4
1
Counting Bits
EBit Manipulation
2
Missing Number
EBit Manipulation
3
Number of 1 Bits
EBit Manipulation
4
Reverse Bits
EBit Manipulation
Design (LLD)0 / 1
1
Encode and Decode Stringspremium
MDesign (LLD)