-
Notifications
You must be signed in to change notification settings - Fork 1
Open
Labels
enhancementNew feature or requestNew feature or request
Description
Week 1
- Two Sum — Easy, Array
- Valid Parentheses — Easy, Stack
- Merge Two Sorted Lists — Easy, Linked List
- Best Time to Buy and Sell Stock — Easy, Array
- Valid Palindrome — Easy, String
- Invert Binary Tree — Easy, Binary Tree
- Valid Anagram — Easy, String
- Binary Search — Easy, Binary Search
- Flood Fill — Easy, Graph
- Lowest Common Ancestor of a Binary Search Tree — Easy, Binary Search Tree
- Balanced Binary Tree — Easy, Binary Tree
- Linked List Cycle — Easy, Linked List
Week 2
- Implement Queue using Stacks — Easy, Stack
- First Bad Version — Easy, Binary Search
- Ransom Note — Easy, Hash Table
- Climbing Stairs — Easy, Dynamic Programming
- Longest Palindrome — Easy, String
- Reverse Linked List — Easy, Linked List
- Majority Element — Easy, Array
- Add Binary — Easy, Binary
- Diameter of Binary Tree — Easy, Binary Tree
- Middle of the Linked List — Easy, Linked List
- Maximum Depth of Binary Tree — Easy, Binary Tree
- Contains Duplicate — Easy, Array
Week 3
- Maximum Subarray — Medium, Dynamic Programming
- Insert Interval — Medium, Array
- 01 Matrix — Medium, Graph
- K Closest Points to Origin — Medium, Heap
- Longest Substring Without Repeating Characters — Medium, String
- 3Sum — Medium, Array
- Binary Tree Level Order Traversal — Medium, Binary Tree
- Clone Graph — Medium, Graph
- Evaluate Reverse Polish Notation — Medium, Stack
- Course Schedule — Medium, Graph
- Implement Trie (Prefix Tree) — Medium, Trie
- Coin Change — Medium, Dynamic Programming
Week 4
- Product of Array Except Self — Medium, Array
- Min Stack — Medium, Stack
- Validate Binary Search Tree — Medium, Binary Search Tree
- Number of Islands — Medium, Graph
- Rotting Oranges — Medium, Graph
- Search in Rotated Sorted Array — Medium, Binary Search
- Combination Sum — Medium, Array
- Permutations — Medium, Recursion
- Merge Intervals — Medium, Array
- Lowest Common Ancestor of a Binary Tree — Medium, Binary Tree
- Time Based Key-Value Store — Medium, Binary Search
- Accounts Merge — Medium, Graph
Week 5
- Sort Colors — Medium, Array
- Word Break — Medium, Trie
- Partition Equal Subset Sum — Medium, Dynamic Programming
- String to Integer (atoi) — Medium, String
- Spiral Matrix — Medium, Matrix
- Subsets — Medium, Recursion
- Binary Tree Right Side View — Medium, Binary Tree
- Longest Palindromic Substring — Medium, String
- Unique Paths — Medium, Dynamic Programming
- Construct Binary Tree from Preorder and Inorder Traversal — Medium, Binary Tree
- Container With Most Water — Medium, Array
- Letter Combinations of a Phone Number — Medium, Recursion
Week 6
- Word Search — Medium, Graph
- Find All Anagrams in a String — Medium, String
- Minimum Height Trees — Medium, Graph
- Task Scheduler — Medium, Heap
- LRU Cache — Medium, Linked List
- Kth Smallest Element in a BST — Medium, Binary Search Tree
- Minimum Window Substring — Hard, String
- Serialize and Deserialize Binary Tree — Hard, Binary Tree
- Trapping Rain Water — Hard, Stack
- Find Median from Data Stream — Hard, Heap
- Word Ladder — Hard, Graph
- Basic Calculator — Hard, Stack
Metadata
Metadata
Assignees
Labels
enhancementNew feature or requestNew feature or request