Blind 75
Array and Hashing
| LC# | Title | Level | Solved? | Time | Soln | T.C. | S.C. |
|---|---|---|---|---|---|---|---|
| 0001 | Two Sum | Easy | ✓ | 00:02:34 | Link | ||
| 0242 | Valid Anagram | Easy | ✓ | 00:01:46 | Link | ||
| 0217 | Contains Duplicate | Easy | ✓ | 00:02:09 | Link | ||
| 0238 | Product of Array Except Self | Medium | ✓ | 00:07:15 | Link | ||
| 0049 | Group Anagrams | Medium | ✓ | 00:03:27 | Link | ||
| 0271 | Encode and Decode Strings | Medium | ✓ | 00:04:51 | Link | ||
| 0347 | Top K Frequent Elements | Medium | ✓ | 00:05:16 | Link |
Binary Search
| LC# | Title | Level | Solved? | Time | Soln | T.C. | S.C. |
|---|---|---|---|---|---|---|---|
| 0153 | Find Minimum in Rotated Sorted Array | Medium | ✓ | 00:04:16 | Link | ||
| 0033 | Search in Rotated Sorted Array | Medium | ✓ | 00:11:03 | Link |
Bit Manipulation
| LC# | Title | Level | Solved? | Time | Soln | T.C. | S.C. |
|---|---|---|---|---|---|---|---|
| 0191 | Number of 1 Bits | Easy | ✓ | 00:02:17 | Link | ||
| 0338 | Counting Bits | Easy | ✓ | 00:03:18 | Link | ||
| 0268 | Missing Number | Easy | ✓ | 00:01:54 | Link | ||
| 0190 | Reverse Bits | Easy | ✓ | 00:03:49 | Link | ||
| 0371 | Sum of Two Integers | Medium | ✓ | 00:09:16 | Link |
Dynamic Programming
| LC# | Title | Level | Solved? | Time | Soln | T.C. | S.C. |
|---|---|---|---|---|---|---|---|
| 0070 | Climbing Stairs | Easy | ✓ | 00:02:21 | Link | ||
| 0139 | Word Break | Easy | ✓ | 00:04:27 | Link | ||
| 0198 | House Robber | Medium | ✓ | 00:06:23 | Link | ||
| 0322 | Coin Change | Medium | ✓ | 00:06:42 | Link | ||
| 0300 | Longest Increasing Subsequence | Medium | ✓ | 00:23:51 | Link | ||
| 1143 | Longest Common Subsequence | Medium | ✓ | 00:08:34 | Link | ||
| 0005 | Longest Palindromic Substring | Medium | ✓ | 00:06:57 | Link | ||
| 0152 | Maximum Product Subarray | Medium | ✓ | 00:05:34 | Link | ||
| 0647 | Palindromic Substrings | Medium | ✓ | Link | |||
| 0377 | Combination Sum IV | Medium | ✓ | Link | |||
| 0213 | House Robber II | Medium | ✓ | 00:04:52 | Link | ||
| 0091 | Decode Ways | Medium | ✓ | 00:08:29 | Link | ||
| 0062 | Unique Paths | Medium | ✓ | Link |
Graphs
| LC# | Title | Level | Solved? | Time | Soln | T.C. | S.C. |
|---|---|---|---|---|---|---|---|
| 0133 | Clone Graph | Medium | ✓ | Link | |||
| 0207 | Course Schedule | Medium | ✓ | Link | |||
| 0417 | Pacific Atlantic Water Flow | Medium | ✓ | Link | |||
| 0200 | Number of Islands | Medium | ✓ | Link | |||
| 0128 | Longest Consecutive Sequence | Medium | ✓ | Link | |||
| 0269 | Alien Dictionary | Hard | ✓ | Link | |||
| 0261 | Graph Valid Tree | Hard | ✓ | Link | |||
| 0323 | Number of Connected Components in an Undirected Graph | Hard | ✓ | Link |
Greedy
| LC# | Title | Level | Solved? | Time | Soln | T.C. | S.C. |
|---|---|---|---|---|---|---|---|
| 0055 | Jump Game | Medium | ✓ | Link | |||
| 0053 | Maximum Subarray | Medium | ✓ | Link |
Heaps
| LC# | Title | Level | Solved? | Time | Soln | T.C. | S.C |
|---|---|---|---|---|---|---|---|
| 0295 | Find Median from Data Stream | Hard | ✓ | Link |
Intervals
| LC# | Title | Level | Solved? | Time | Soln | T.C. | S.C. |
|---|---|---|---|---|---|---|---|
| 0252 | Meeting Rooms | Easy | ✓ | Link | |||
| 0057 | Insert Interval | Medium | ✓ | Link | |||
| 0056 | Merge Intervals | Medium | ✓ | Link | |||
| 0435 | Non-overlapping Intervals | Medium | ✓ | Link | |||
| 0253 | Meeting Rooms II | Medium | ✓ | Link |
Linked Lists
| LC# | Title | Level | Solved? | Time | Soln | T.C. | S.C. |
|---|---|---|---|---|---|---|---|
| 0206 | Reverse Linked List | Easy | ✓ | Link | |||
| 0141 | Linked List Cycle | Easy | ✓ | Link | |||
| 0021 | Merge Two Sorted Lists | Easy | ✓ | Link | |||
| 0019 | Remove Nth Node From End of List | Medium | ✓ | Link | |||
| 0143 | Reorder List | Medium | ✓ | Link | |||
| 0023 | Merge k Sorted Lists | Hard | ✓ | Link |
Sliding Window
| LC# | Title | Level | Solved? | Time | Soln | T.C. | S.C. |
|---|---|---|---|---|---|---|---|
| 0121 | Best Time to Buy and Sell Stock | Easy | ✓ | Link | |||
| 0424 | Longest Repeating Character Replacement | Medium | ✓ | Link | |||
| 0003 | Longest Substring Without Repeating Characters | Medium | ✓ | Link | |||
| 0076 | Minimum Window Substring | Hard | ✓ | Link |
Stacks
| LC# | Title | Level | Solved? | Time | Soln | T.C. | S.C. |
|---|---|---|---|---|---|---|---|
| 0020 | Valid Parentheses | Easy | ✓ | Link |
Trees
| LC# | Title | Level | Solved? | Time | Soln | T.C. | S.C. |
|---|---|---|---|---|---|---|---|
| 0104 | Maximum Depth of Binary Tree | Easy | ✓ | Link | |||
| 0100 | Same Tree | Easy | ✓ | Link | |||
| 0226 | Invert Binary Tree | Easy | ✓ | Link | |||
| 0572 | Subtree of Another Tree | Easy | ✓ | Link | |||
| 0102 | Binary Tree Level Order Traversal | Medium | ✓ | Link | |||
| 0105 | Construct Binary Tree from Preorder and Inorder Traversal | Medium | ✓ | Link | |||
| 0098 | Validate Binary Search Tree | Medium | ✓ | Link | |||
| 0230 | Kth Smallest Element in a BST | Medium | ✓ | Link | |||
| 0235 | Lowest Common Ancestor of a Binary Search Tree | Medium | ✓ | Link | |||
| 0124 | Binary Tree Maximum Path Sum | Hard | ✓ | Link | |||
| 0297 | Serialize and Deserialize Binary Tree | Hard | ✓ | Link |
Tries
| LC# | Title | Level | Solved? | Time | Soln | T.C. | S.C. |
|---|---|---|---|---|---|---|---|
| 0208 | Implement Trie (Prefix Tree) | Medium | ✓ | Link | |||
| 0211 | Design Add and Search Words Data Structure | Medium | ✓ | Link | |||
| 0212 | Word Search II | Hard | ✓ | Link |
Two Pointers
| LC# | Title | Level | Solved? | Time | Soln | T.C. | S.C. |
|---|---|---|---|---|---|---|---|
| 0125 | Valid Palindrome | Easy | ✓ | Link | |||
| 0015 | 3Sum | Medium | ✓ | Link | |||
| 0011 | Container With Most Water | Medium | ✓ | Link |