Blind 75 Checklist
The standard list of 75 high-impact questions to master coding interviews.
0 / 75 Completed 0%
2D Dynamic Programming
0 / 2| Status | Problem | Difficulty | Companies |
|---|---|---|---|
| Unique Paths | Medium | AmazonGoogleFacebookMicrosoftBloomberg | |
| Longest Common Subsequence | Medium | GoogleAmazonFacebookMicrosoftBloomberg |
Arrays & Hashing
0 / 8| Status | Problem | Difficulty | Companies |
|---|---|---|---|
| Two Sum | Easy | AmazonGoogleMicrosoftMetaAppleBloomberg | |
| Contains Duplicate | Easy | AmazonGoogleMicrosoftBloombergApple | |
| Valid Anagram | Easy | AmazonGoogleMicrosoftMetaBloomberg | |
| Group Anagrams | Medium | AmazonGoogleMetaMicrosoftBloomberg | |
| Top K Frequent Elements | Medium | AmazonGoogleMetaMicrosoftApple | |
| Product of Array Except Self | Medium | AmazonMetaMicrosoftAppleGoogle | |
| Longest Consecutive Sequence | Medium | AmazonGoogleMetaMicrosoftAdobe | |
| Encode and Decode Strings | Medium | GoogleFacebookAmazonMicrosoft |
Backtracking
0 / 4| Status | Problem | Difficulty | Companies |
|---|---|---|---|
| Combination Sum | Medium | GoogleAmazonFacebookMicrosoftAdobe | |
| Design Add and Search Words Data Structure | Medium | AmazonGoogleFacebookMicrosoft | |
| Word Search | Medium | AmazonGoogleFacebookMicrosoftBloomberg | |
| Word Search II | Hard | GoogleAmazonMicrosoftUberApple |
1D Dynamic Programming
0 / 10| Status | Problem | Difficulty | Companies |
|---|---|---|---|
| Climbing Stairs | Easy | AmazonGoogleFacebookMicrosoftBloomberg | |
| House Robber | Medium | GoogleAmazonFacebookMicrosoftBloomberg | |
| House Robber II | Medium | GoogleAmazonFacebookMicrosoft | |
| Longest Palindromic Substring | Medium | AmazonGoogleFacebookMicrosoftBloomberg | |
| Palindromic Substrings | Medium | FacebookGoogleAmazonMicrosoftBloomberg | |
| Decode Ways | Medium | GoogleAmazonFacebookMicrosoftBloomberg | |
| Coin Change | Medium | GoogleAmazonFacebookMicrosoftBloomberg | |
| Maximum Product Subarray | Medium | AmazonGoogleFacebookMicrosoftBloomberg | |
| Word Break | Medium | GoogleAmazonFacebookMicrosoftBloomberg | |
| Longest Increasing Subsequence | Medium | GoogleAmazonFacebookMicrosoftBloomberg |
Bit Manipulation
0 / 5| Status | Problem | Difficulty | Companies |
|---|---|---|---|
| Number of 1 Bits | Easy | GoogleAmazonFacebookMicrosoftApple | |
| Counting Bits | Easy | GoogleAmazonFacebookMicrosoftBloomberg | |
| Reverse Bits | Easy | GoogleAmazonFacebookMicrosoftApple | |
| Missing Number | Easy | GoogleAmazonFacebookMicrosoftBloomberg | |
| Sum of Two Integers | Medium | GoogleAmazonFacebookMicrosoftBloomberg |
Graphs
0 / 7| Status | Problem | Difficulty | Companies |
|---|---|---|---|
| Number of Islands | Medium | AmazonGoogleFacebookMicrosoftBloomberg | |
| Clone Graph | Medium | GoogleFacebookAmazonMicrosoft | |
| Pacific Atlantic Water Flow | Medium | GoogleAmazonFacebookMicrosoft | |
| Course Schedule | Medium | GoogleAmazonFacebookMicrosoftBloomberg | |
| Number of Connected Components in an Undirected Graph | Medium | AmazonGoogleFacebookMicrosoft | |
| Graph Valid Tree | Medium | GoogleAmazonFacebookMicrosoft | |
| Alien Dictionary | Hard | GoogleAmazonFacebookMicrosoftAirbnb |
Binary Search
0 / 2| Status | Problem | Difficulty | Companies |
|---|---|---|---|
| Find Minimum in Rotated Sorted Array | Medium | AmazonGoogleMicrosoftMetaApple | |
| Search in Rotated Sorted Array | Medium | AmazonGoogleMetaMicrosoftApple |
Heap & Priority Queue
0 / 3| Status | Problem | Difficulty | Companies |
|---|---|---|---|
| Find Median from Data Stream | Hard | GoogleAmazonMicrosoftFacebookBloomberg | |
| Merge K Sorted Lists | Hard | AmazonGoogleMetaMicrosoftBloomberg | |
| Top K Frequent Elements | Medium | AmazonGoogleMetaMicrosoftApple |
Greedy
0 / 2| Status | Problem | Difficulty | Companies |
|---|---|---|---|
| Maximum Subarray | Medium | AmazonGoogleFacebookMicrosoftBloomberg | |
| Jump Game | Medium | AmazonGoogleFacebookMicrosoftBloomberg |
Intervals
0 / 5| Status | Problem | Difficulty | Companies |
|---|---|---|---|
| Insert Interval | Medium | GoogleAmazonFacebookMicrosoftBloomberg | |
| Merge Intervals | Medium | AmazonGoogleFacebookMicrosoftBloomberg | |
| Non-overlapping Intervals | Medium | GoogleAmazonFacebookMicrosoftBloomberg | |
| Meeting Rooms | Easy | GoogleAmazonFacebookMicrosoft | |
| Meeting Rooms II | Medium | GoogleAmazonFacebookMicrosoftBloomberg |
Math & Geometry
0 / 3| Status | Problem | Difficulty | Companies |
|---|---|---|---|
| Rotate Image | Medium | AmazonGoogleFacebookMicrosoftBloomberg | |
| Spiral Matrix | Medium | MicrosoftGoogleAmazonFacebookBloomberg | |
| Set Matrix Zeroes | Medium | MicrosoftGoogleAmazonFacebookBloomberg |
Sliding Window
0 / 4| Status | Problem | Difficulty | Companies |
|---|---|---|---|
| Longest Substring Without Repeating Characters | Medium | AmazonGoogleMicrosoftBloombergAdobe | |
| Best Time to Buy and Sell Stock | Easy | AmazonMetaGoogleMicrosoftBloomberg | |
| Longest Repeating Character Replacement | Medium | AmazonGoogleMicrosoftBloombergUber | |
| Minimum Window Substring | Hard | MetaAmazonGoogleMicrosoftBloomberg |
Stack
0 / 1| Status | Problem | Difficulty | Companies |
|---|---|---|---|
| Valid Parentheses | Easy | AmazonGoogleMetaMicrosoftBloomberg |
Trees
0 / 11| Status | Problem | Difficulty | Companies |
|---|---|---|---|
| Invert Binary Tree | Easy | GoogleAmazonFacebookMicrosoft | |
| Maximum Depth of Binary Tree | Easy | GoogleAmazonMicrosoftFacebook | |
| Same Tree | Easy | GoogleAmazonMicrosoftFacebook | |
| Subtree of Another Tree | Easy | GoogleAmazonMicrosoftFacebook | |
| Lowest Common Ancestor of a Binary Search Tree | Easy | AmazonGoogleFacebookMicrosoftLinkedIn | |
| Validate Binary Search Tree | Medium | AmazonGoogleFacebookBloombergMicrosoft | |
| Kth Smallest Element in a BST | Medium | GoogleAmazonFacebookMicrosoft | |
| Construct Binary Tree from Preorder and Inorder Traversal | Medium | GoogleAmazonMicrosoftFacebook | |
| Binary Tree Level Order Traversal | Medium | AmazonGoogleFacebookMicrosoftBloomberg | |
| Binary Tree Maximum Path Sum | Hard | GoogleAmazonFacebookMicrosoftByteDance | |
| Serialize and Deserialize Binary Tree | Hard | GoogleAmazonFacebookMicrosoftLinkedIn |
Tries
0 / 3| Status | Problem | Difficulty | Companies |
|---|---|---|---|
| Implement Trie (Prefix Tree) | Medium | GoogleAmazonMicrosoftFacebook | |
| Design Add and Search Words Data Structure | Medium | AmazonGoogleFacebookMicrosoft | |
| Word Search II | Hard | GoogleAmazonMicrosoftUberApple |
Two Pointers
0 / 3| Status | Problem | Difficulty | Companies |
|---|---|---|---|
| Valid Palindrome | Easy | MetaMicrosoftGoogleAmazonApple | |
| 3Sum | Medium | AmazonMetaGoogleMicrosoftAdobe | |
| Container With Most Water | Medium | AmazonGoogleMetaMicrosoftBloomberg |
Linked List
0 / 6| Status | Problem | Difficulty | Companies |
|---|---|---|---|
| Reverse Linked List | Easy | AmazonGoogleMetaMicrosoftApple | |
| Merge Two Sorted Lists | Easy | AmazonMicrosoftGoogleMetaBloomberg | |
| Reorder List | Medium | AmazonGoogleMetaMicrosoft | |
| Remove Nth Node From End of List | Medium | AmazonGoogleMetaMicrosoftApple | |
| Merge K Sorted Lists | Hard | AmazonGoogleMetaMicrosoftBloomberg | |
| Linked List Cycle | Easy | AmazonMicrosoftGoogleMeta |