Grind 75
Your Progress 0%
Array
(0/11)
| Completed | Problem | Difficulty | Leetcode |
|---|---|---|---|
| Two Sum | Easy | ||
| Best Time to Buy and Sell Stock | Easy | ||
| Insert Interval | Medium | ||
| 3Sum | Medium | ||
| Product of Array Except Self | Medium | ||
| Combination Sum | Medium | ||
| Merge Intervals | Medium | ||
| Majority Element | Easy | ||
| Sort Colors | Medium | ||
| Contains Duplicate | Easy | ||
| Container With Most Water | Medium |
String
(0/7)
| Completed | Problem | Difficulty | Leetcode |
|---|---|---|---|
| Valid Anagram | Easy | ||
| Longest Substring Without Repeating Characters | Medium | ||
| Longest Palindrome | Easy | ||
| Minimum Window Substring | Hard | ||
| String to Integer (atoi) | Medium | ||
| Longest Palindromic Substring | Medium | ||
| Find All Anagrams in a String | Medium |
Matrix
(0/1)
| Completed | Problem | Difficulty | Leetcode |
|---|---|---|---|
| Spiral Matrix | Medium |
Binary Search
(0/5)
| Completed | Problem | Difficulty | Leetcode |
|---|---|---|---|
| Binary Search | Easy | ||
| First Bad Version | Easy | ||
| Search in Rotated Sorted Array | Medium | ||
| Time Based Key-Value Store | Medium | ||
| Maximum Profit in Job Scheduling | Hard |
Graph
(0/10)
| Completed | Problem | Difficulty | Leetcode |
|---|---|---|---|
| Flood Fill | Easy | ||
| 01 Matrix | Medium | ||
| Clone Graph | Medium | ||
| Course Schedule | Medium | ||
| Number of Islands | Medium | ||
| Rotting Oranges | Medium | ||
| Accounts Merge | Medium | ||
| Word Ladder | Hard | ||
| Word Search | Medium | ||
| Minimum Height Trees | Medium |
Binary search tree
(0/3)
| Completed | Problem | Difficulty | Leetcode |
|---|---|---|---|
| Lowest Common Ancestor of a Binary Search Tree | Easy | ||
| Validate Binary Search Tree | Medium | ||
| Kth Smallest Element in a BST | Medium |
Binary tree
(0/9)
| Completed | Problem | Difficulty | Leetcode |
|---|---|---|---|
| Invert Binary Tree | Easy | ||
| Balanced Binary Tree | Easy | ||
| Binary Tree Level Order Traversal | Medium | ||
| Lowest Common Ancestor of a Binary Tree | Medium | ||
| Serialize and Deserialize Binary Tree | Hard | ||
| Diameter of Binary Tree | Easy | ||
| Binary Tree Right Side View | Medium | ||
| Maximum Depth of Binary Tree | Easy | ||
| Construct Binary Tree from Preorder and Inorder Traversal | Medium |
Hash Table
(0/1)
| Completed | Problem | Difficulty | Leetcode |
|---|---|---|---|
| Ransom Note | Easy |
Recursion
(0/3)
| Completed | Problem | Difficulty | Leetcode |
|---|---|---|---|
| Permutations | Medium | ||
| Subsets | Medium | ||
| Letter Combinations of a Phone Number | Medium |
Linked List
(0/5)
| Completed | Problem | Difficulty | Leetcode |
|---|---|---|---|
| Merge Two Sorted Lists | Easy | ||
| Linked List Cycle | Easy | ||
| Reverse Linked List | Easy | ||
| Middle of the Linked List | Easy | ||
| LRU Cache | Medium |
Stack
(0/7)
| Completed | Problem | Difficulty | Leetcode |
|---|---|---|---|
| Valid Parentheses | Easy | ||
| Implement Queue using Stacks | Easy | ||
| Evaluate Reverse Polish Notation | Medium | ||
| Min Stack | Medium | ||
| Trapping Rain Water | Hard | ||
| Basic Calculator | Hard | ||
| Largest Rectangle in Histogram | Hard |
Heap
(0/4)
| Completed | Problem | Difficulty | Leetcode |
|---|---|---|---|
| K Closest Points to Origin | Medium | ||
| Find Median from Data Stream | Hard | ||
| Merge k Sorted Lists | Hard | ||
| Task Scheduler | Medium |
Trie
(0/2)
| Completed | Problem | Difficulty | Leetcode |
|---|---|---|---|
| Implement Trie (Prefix Tree) | Medium | ||
| Word Break | Medium |
Dynamic Programming
(0/5)
| Completed | Problem | Difficulty | Leetcode |
|---|---|---|---|
| Maximum Subarray | Easy | ||
| Coin Change | Medium | ||
| Climbing Stairs | Easy | ||
| Partition Equal Subset Sum | Medium | ||
| Unique Paths | Medium |