companyhub
DashboardCompaniesProblemsSheetsBookmarksRevisionsAnalyticsLeaderboardCompare
Settings
Sign in
DashboardCompaniesProblemsSheetsBookmarks

Study sheet

Blind 75

The classic 75 questions covering every core pattern asked in interviews.

Overall progress0 / 75 · sign in to track

Step 1 · Array

0/10
Two Sum
Easy
Best Time to Buy and Sell Stock
Easy
Contains Duplicate
Easy
Product of Array Except Self
Medium
Maximum Subarray
Medium
Maximum Product Subarray
Medium
Find Minimum in Rotated Sorted Array
Medium
Search in Rotated Sorted Array
Medium
3Sum
Medium
Container With Most Water
Medium

Step 2 · Binary

0/5
Sum of Two Integers
Medium
Number of 1 Bits
Easy
Counting Bits
Easy
Missing Number
Easy
Reverse Bits
Easy

Step 3 · Dynamic Programming

0/11
Climbing Stairs
Easy
Coin Change
Medium
Longest Increasing Subsequence
Medium
Longest Common Subsequence
Medium
Word Break
Medium
Combination Sum IV
Medium
House Robber
Medium
House Robber II
Medium
Decode Ways
Medium
Unique Paths
Medium
Jump Game
Medium

Step 4 · Graph

0/8
Clone Graph
Medium
Course Schedule
Medium
Pacific Atlantic Water Flow
Medium
Number of Islands
Medium
Longest Consecutive Sequence
Medium
Alien Dictionary
Hard
Graph Valid Tree
Medium
Number of Connected Components in an Undirected Graph
Medium

Step 5 · Interval

0/5
Insert Interval
Medium
Merge Intervals
Medium
Non-overlapping Intervals
Medium
Meeting Rooms
Easy
Meeting Rooms II
Medium

Step 6 · Linked List

0/6
Reverse Linked List
Easy
Linked List Cycle
Easy
Merge Two Sorted Lists
Easy
Merge k Sorted Lists
Hard
Remove Nth Node From End of List
Medium
Reorder List
Medium

Step 7 · Matrix

0/4
Set Matrix Zeroes
Medium
Spiral Matrix
Medium
Rotate Image
Medium
Word Search
Medium

Step 8 · String

0/10
Longest Substring Without Repeating Characters
Medium
Longest Repeating Character Replacement
Medium
Minimum Window Substring
Hard
Valid Anagram
Easy
Group Anagrams
Medium
Valid Parentheses
Easy
Valid Palindrome
Easy
Longest Palindromic Substring
Medium
Palindromic Substrings
Medium
Encode and Decode Strings
Medium

Step 9 · Tree

0/14
Maximum Depth of Binary Tree
Easy
Same Tree
Easy
Invert Binary Tree
Easy
Binary Tree Maximum Path Sum
Hard
Binary Tree Level Order Traversal
Medium
Serialize and Deserialize Binary Tree
Hard
Subtree of Another Tree
Easy
Construct Binary Tree from Preorder and Inorder Traversal
Medium
Validate Binary Search Tree
Medium
Kth Smallest Element in a BST
Medium
Lowest Common Ancestor of a BST
Medium
Implement Trie (Prefix Tree)
Medium
Design Add and Search Words Data Structure
Medium
Word Search II
Hard

Step 10 · Heap

0/2
Top K Frequent Elements
Medium
Find Median from Data Stream
Hard