0/150 (0%)
Arrays & Hashing
9| # | Problem | Tags | Diff | Source | |
|---|---|---|---|---|---|
| 1 | Contains Duplicate | 1 | LC | ||
| 2 | Valid Anagram | 1 | LC | ||
| 3 | Two Sum | 1.5 | LC | ||
| 4 | Group Anagrams | 3 | LC | ||
| 5 | Top K Frequent Elements | 3 | LC | ||
| 6 | Encode and Decode Strings | 3.5 | LC | ||
| 7 | Product of Array Except Self | 3.5 | LC | ||
| 8 | Valid Sudoku | 3 | LC | ||
| 9 | Longest Consecutive Sequence | 4 | LC |
Two Pointers
5| # | Problem | Tags | Diff | Source | |
|---|---|---|---|---|---|
| 1 | Valid Palindrome | 1 | LC | ||
| 2 | Two Sum II Input Array Is Sorted | 2 | LC | ||
| 3 | 3Sum | 3.5 | LC | ||
| 4 | Container With Most Water | 3 | LC | ||
| 5 | Trapping Rain Water | 5 | LC |
Sliding Window
6| # | Problem | Tags | Diff | Source | |
|---|---|---|---|---|---|
| 1 | Best Time to Buy and Sell Stock | 1.5 | LC | ||
| 2 | Longest Substring Without Repeating Characters | 3 | LC | ||
| 3 | Longest Repeating Character Replacement | 3.5 | LC | ||
| 4 | Permutation in String | 3.5 | LC | ||
| 5 | Minimum Window Substring | 5 | LC | ||
| 6 | Sliding Window Maximum | 5 | LC |
Stack
7| # | Problem | Tags | Diff | Source | |
|---|---|---|---|---|---|
| 1 | Valid Parentheses | 1.5 | LC | ||
| 2 | Min Stack | 3 | LC | ||
| 3 | Evaluate Reverse Polish Notation | 3 | LC | ||
| 4 | Generate Parentheses | 3.5 | LC | ||
| 5 | Daily Temperatures | 3 | LC | ||
| 6 | Car Fleet | 4 | LC | ||
| 7 | Largest Rectangle in Histogram | 5 | LC |
Binary Search
7| # | Problem | Tags | Diff | Source | |
|---|---|---|---|---|---|
| 1 | Binary Search | 1 | LC | ||
| 2 | Search a 2D Matrix | 2.5 | LC | ||
| 3 | Koko Eating Bananas | 3.5 | LC | ||
| 4 | Find Minimum in Rotated Sorted Array | 3.5 | LC | ||
| 5 | Search in Rotated Sorted Array | 4 | LC | ||
| 6 | Time Based Key-Value Store | 3.5 | LC | ||
| 7 | Median of Two Sorted Arrays | 5 | LC |
Linked List
11| # | Problem | Tags | Diff | Source | |
|---|---|---|---|---|---|
| 1 | Reverse Linked List | 1.5 | LC | ||
| 2 | Merge Two Sorted Lists | 1.5 | LC | ||
| 3 | Reorder List | 3.5 | LC | ||
| 4 | Remove Nth Node From End of List | 3 | LC | ||
| 5 | Copy List with Random Pointer | 3.5 | LC | ||
| 6 | Add Two Numbers | 3 | LC | ||
| 7 | Linked List Cycle | 1.5 | LC | ||
| 8 | Find the Duplicate Number | 4 | LC | ||
| 9 | LRU Cache | 4.5 | LC | ||
| 10 | Merge K Sorted Lists | 5 | LC | ||
| 11 | Reverse Nodes in k-Group | 5 | LC |
Trees
15| # | Problem | Tags | Diff | Source | |
|---|---|---|---|---|---|
| 1 | Invert Binary Tree | 1 | LC | ||
| 2 | Maximum Depth of Binary Tree | 1 | LC | ||
| 3 | Diameter of Binary Tree | 2 | LC | ||
| 4 | Balanced Binary Tree | 2 | LC | ||
| 5 | Same Tree | 1.5 | LC | ||
| 6 | Subtree of Another Tree | 2 | LC | ||
| 7 | Lowest Common Ancestor of a BST | 2.5 | LC | ||
| 8 | Binary Tree Level Order Traversal | 2.5 | LC | ||
| 9 | Binary Tree Right Side View | 3 | LC | ||
| 10 | Count Good Nodes in Binary Tree | 3 | LC | ||
| 11 | Validate Binary Search Tree | 3.5 | LC | ||
| 12 | Kth Smallest Element in a BST | 3 | LC | ||
| 13 | Construct Binary Tree from Preorder and Inorder Traversal | 4 | LC | ||
| 14 | Binary Tree Maximum Path Sum | 5 | LC | ||
| 15 | Serialize and Deserialize Binary Tree | 5 | LC |
Tries
3| # | Problem | Tags | Diff | Source | |
|---|---|---|---|---|---|
| 1 | Implement Trie (Prefix Tree) | 3 | LC | ||
| 2 | Design Add and Search Words Data Structure | 3.5 | LC | ||
| 3 | Word Search II | 5 | LC |
Heap / Priority Queue
7| # | Problem | Tags | Diff | Source | |
|---|---|---|---|---|---|
| 1 | Kth Largest Element in a Stream | 2 | LC | ||
| 2 | Last Stone Weight | 1.5 | LC | ||
| 3 | K Closest Points to Origin | 3 | LC | ||
| 4 | Kth Largest Element in an Array | 3.5 | LC | ||
| 5 | Task Scheduler | 4 | LC | ||
| 6 | Design Twitter | 4 | LC | ||
| 7 | Find Median from Data Stream | 5 | LC |
Backtracking
9| # | Problem | Tags | Diff | Source | |
|---|---|---|---|---|---|
| 1 | Subsets | 3 | LC | ||
| 2 | Combination Sum | 3 | LC | ||
| 3 | Permutations | 3 | LC | ||
| 4 | Subsets II | 3.5 | LC | ||
| 5 | Combination Sum II | 3.5 | LC | ||
| 6 | Word Search | 3.5 | LC | ||
| 7 | Palindrome Partitioning | 3.5 | LC | ||
| 8 | Letter Combinations of a Phone Number | 3 | LC | ||
| 9 | N-Queens | 5 | LC |
Graphs
13| # | Problem | Tags | Diff | Source | |
|---|---|---|---|---|---|
| 1 | Number of Islands | 3 | LC | ||
| 2 | Clone Graph | 3 | LC | ||
| 3 | Max Area of Island | 3 | LC | ||
| 4 | Pacific Atlantic Water Flow | 3.5 | LC | ||
| 5 | Surrounded Regions | 3.5 | LC | ||
| 6 | Rotting Oranges | 3 | LC | ||
| 7 | Walls and Gates | 3 | LC | ||
| 8 | Course Schedule | 3.5 | LC | ||
| 9 | Course Schedule II | 3.5 | LC | ||
| 10 | Redundant Connection | 3.5 | LC | ||
| 11 | Number of Connected Components in an Undirected Graph | 3 | LC | ||
| 12 | Graph Valid Tree | 3.5 | LC | ||
| 13 | Word Ladder | 4.5 | LC |
Advanced Graphs
6| # | Problem | Tags | Diff | Source | |
|---|---|---|---|---|---|
| 1 | Reconstruct Itinerary | 4.5 | LC | ||
| 2 | Min Cost to Connect All Points | 4 | LC | ||
| 3 | Network Delay Time | 4 | LC | ||
| 4 | Swim in Rising Water | 4.5 | LC | ||
| 5 | Alien Dictionary | 4.5 | LC | ||
| 6 | Cheapest Flights Within K Stops | 4.5 | LC |
1-D Dynamic Programming
12| # | Problem | Tags | Diff | Source | |
|---|---|---|---|---|---|
| 1 | Climbing Stairs | 1.5 | LC | ||
| 2 | Min Cost Climbing Stairs | 2 | LC | ||
| 3 | House Robber | 3 | LC | ||
| 4 | House Robber II | 3.5 | LC | ||
| 5 | Longest Palindromic Substring | 3.5 | LC | ||
| 6 | Palindromic Substrings | 3.5 | LC | ||
| 7 | Decode Ways | 4 | LC | ||
| 8 | Coin Change | 3.5 | LC | ||
| 9 | Maximum Product Subarray | 3.5 | LC | ||
| 10 | Word Break | 4 | LC | ||
| 11 | Longest Increasing Subsequence | 4 | LC | ||
| 12 | Partition Equal Subset Sum | 4 | LC |
2-D Dynamic Programming
11| # | Problem | Tags | Diff | Source | |
|---|---|---|---|---|---|
| 1 | Unique Paths | 3 | LC | ||
| 2 | Longest Common Subsequence | 3.5 | LC | ||
| 3 | Best Time to Buy and Sell Stock with Cooldown | 4 | LC | ||
| 4 | Coin Change II | 4 | LC | ||
| 5 | Target Sum | 4 | LC | ||
| 6 | Interleaving String | 4.5 | LC | ||
| 7 | Longest Increasing Path in a Matrix | 4.5 | LC | ||
| 8 | Distinct Subsequences | 4.5 | LC | ||
| 9 | Edit Distance | 4.5 | LC | ||
| 10 | Burst Balloons | 5 | LC | ||
| 11 | Regular Expression Matching | 5 | LC |
Greedy
8| # | Problem | Tags | Diff | Source | |
|---|---|---|---|---|---|
| 1 | Maximum Subarray | 2.5 | LC | ||
| 2 | Jump Game | 3.5 | LC | ||
| 3 | Jump Game II | 4 | LC | ||
| 4 | Gas Station | 4 | LC | ||
| 5 | Hand of Straights | 3.5 | LC | ||
| 6 | Merge Triplets to Form Target Triplet | 3.5 | LC | ||
| 7 | Partition Labels | 3.5 | LC | ||
| 8 | Valid Parenthesis String | 4 | LC |
Intervals
6| # | Problem | Tags | Diff | Source | |
|---|---|---|---|---|---|
| 1 | Insert Interval | 3.5 | LC | ||
| 2 | Merge Intervals | 3 | LC | ||
| 3 | Non-overlapping Intervals | 3.5 | LC | ||
| 4 | Meeting Rooms | 2 | LC | ||
| 5 | Meeting Rooms II | 3.5 | LC | ||
| 6 | Minimum Interval to Include Each Query | 5 | LC |
Math & Geometry
8| # | Problem | Tags | Diff | Source | |
|---|---|---|---|---|---|
| 1 | Rotate Image | 3.5 | LC | ||
| 2 | Spiral Matrix | 3.5 | LC | ||
| 3 | Set Matrix Zeroes | 3.5 | LC | ||
| 4 | Happy Number | 1.5 | LC | ||
| 5 | Plus One | 1.5 | LC | ||
| 6 | Pow(x, n) | 3.5 | LC | ||
| 7 | Multiply Strings | 4 | LC | ||
| 8 | Detect Squares | 4 | LC |
Bit Manipulation
7| # | Problem | Tags | Diff | Source | |
|---|---|---|---|---|---|
| 1 | Single Number | 1.5 | LC | ||
| 2 | Number of 1 Bits | 1.5 | LC | ||
| 3 | Counting Bits | 2.5 | LC | ||
| 4 | Reverse Bits | 2.5 | LC | ||
| 5 | Missing Number | 2 | LC | ||
| 6 | Sum of Two Integers | 4 | LC | ||
| 7 | Reverse Integer | 3 | LC |