| Array |
|
| Two Sum |
✅ |
| 3Sum |
✅ |
| Best Time to Buy & Sell Stock |
✅ |
| ➕ Best Time to Buy & Sell Stock II |
✅ |
| ➕ Best Time to Buy & Sell Stock With Cooldown |
|
| Contains Duplicate |
✅ |
| Product of Array Except Self |
✅ |
| ➕ Move Zeroes |
✅ |
| Maximum Subarray |
✅ |
| Maximum Product Subarray |
✅ |
| Find Minimum in Rotated Sorted Array |
✅ |
| Search in Rotated Sorted Array |
✅ |
| Container With Most Water |
✅ |
| Longest Consecutive Sequence |
✅ |
| ➕ First Bad Version |
✅ |
| ➕ Trapping Rain Water |
✅ |
| ➕ Merge Sorted Array |
✅ |
| ➕ Squares of a Sorted Array |
✅ |
| ➕ Task Scheduler |
✅ |
| ➕ Subarray Sum Equals K |
✅ |
| ➕ Find Pivot Index |
✅ |
| ➕ Largest Rectangle in Histogram |
|
| ➕ Find First and Last Position of Element in Sorted Array |
✅ |
| ➕ Sliding Window Maximum |
✅ |
| ➕ Sliding Window Median |
|
| ➕ Remove Duplicates From Sorted Array |
✅ |
| ➕ Find All Duplicates in an Array |
✅ |
| ➕ First Missing Positive |
|
| ➕ Evaluate Reverse Polish Notation |
✅ |
| ➕ Find Peak Element |
✅ |
| ➕ Find K Closest Element |
|
| ➕ Sort Colors |
✅ |
| ➕ Minimum Size Subarray Sum |
✅ |
| ➕ Max Consecutive Ones III |
✅ |
| ➕ Single Element in a Sorted Array |
|
| Binary |
|
| Sum of Two Integers |
✅ |
| # of 1 Bits |
✅ |
| Counting Bits |
✅ |
| Missing Number |
✅ |
| Reverse Bits |
✅ |
| ➕ Single Number |
✅ |
| Dynamic Programming |
|
| Climbing Stairs |
✅ |
| Coin Change |
✅ |
| Longest Increasing Subsequence |
✅ |
| ➕ Increasing Triplet Subsequence |
✅ |
| Longest Common Subsequence |
✅ |
| Word Break Problem |
✅ |
| Combination Sum IV |
✅ |
| House Robber |
✅ |
| House Robber II |
✅ |
| ➕ House Robber III |
|
| Decode Ways |
✅ |
| Unique Paths |
✅ |
| ➕ Unique Paths II |
✅ |
| Jump Game |
✅ |
| ➕ Super Egg Drop |
|
| ➕ Longest Increasing Path in a Matrix |
✅ |
| Graph |
|
| Clone Graph |
✅ |
| Course Schedule |
✅ |
| Pacific Atlantic Water Flow |
✅ |
| # of Islands |
✅ |
| Alien Dictionary |
|
| Graph Valid Tree |
✅ |
| # of Connected Comps in an Undirected Graph |
|
| ➕ Is Graph Bipartite? |
✅ |
| ➕ Find the Celebrity |
✅ |
| Interval |
|
| Insert Interval |
✅ |
| Merge Intervals |
✅ |
| Non-overlapping Intervals |
✅ |
| Meeting Rooms |
✅ |
| Meeting Rooms II |
✅ |
| Linked List |
|
| Reverse Linked List |
✅ |
| ➕ Reverse Linked List II |
✅ |
| Detect Cycle in a Linked List |
✅ |
| ➕ Linked List Cycle II |
|
| Merge Two Sorted Lists |
✅ |
| Remove Nth Node From End Of List |
✅ |
| Reorder List |
✅ |
| Odd Even Linked List |
✅ |
| Matrix |
|
| Set Matrix Zeroes |
✅ |
| Rotate Image |
✅ |
| Word Search |
✅ |
| Spiral Matrix |
✅ |
| ➕ Spiral Matrix II |
|
| ➕ Diagonal Traverse |
✅ |
| ➕ Maximal Square |
✅ |
| ➕ Maximal Rectangle |
|
| ➕ Search a 2D Matrix |
✅ |
| ➕ Search a 2D Matrix II |
✅ |
| ➕ Rotting Oranges |
✅ |
| ➕ Minesweeper |
✅ |
| ➕ Valid Sudoku |
✅ |
| String |
|
| Longest Substring w.o Repeating Characters |
✅ |
| Longest Repeating Character Replacement |
✅ |
| Minimum Window Substring |
✅ |
| Valid Anagram |
✅ |
| Group Anagrams |
✅ |
| Valid Parentheses |
✅ |
| ➕ Valid Parentheses II |
✅ |
| ➕ Remove Invalid Parentheses |
|
| Valid Palindrome |
✅ |
| Longest Palindromic Substring |
✅ |
| ➕ Longest Palindromic Subsequence |
✅ |
| Palindromic Substrings |
✅ |
| Encode & Decode Strings |
|
| ➕ Decode String |
✅ |
| ➕ Basic Calculator |
✅ |
| ➕ Basic Calculator II |
✅ |
| ➕ First Unique Character |
✅ |
| ➕ Sort Characters by Frequency |
✅ |
| ➕ Simplify Path |
✅ |
| ➕ Maximum 96 Number |
✅ |
| ➕ Isomorphic Strings |
✅ |
| ➕ Add Binary |
✅ |
| ➕ Similar String Groups |
✅ |
| ➕ Minimum To Add Make Parentheses Valid |
✅ |
| ➕ Minimum To Remove Make Parentheses Valid |
✅ |
| ➕ Find All Anagrams in a String |
✅ |
| ➕ Longest Absolute File Path |
✅ |
| ➕ Add Strings |
✅ |
| Tree |
|
| Maximum Depth of BT |
✅ |
| Maximum Depth of N-ary Tree |
✅ |
| ➕ Diameter of a BT |
✅ |
| Same Tree |
✅ |
| Subtree of Another Tree |
✅ |
| Invert/Flip BT |
✅ |
| BT Maximum Path Sum |
✅ |
| BT Level Order Traversal |
✅ |
| Serialize & Deserialize BT |
✅ |
| Construct BT from Preorder & Inorder Traversal |
✅ |
| Validate BST |
✅ |
| Kth Smallest Element in a BST |
✅ |
| Lowest Common Ancestor of BST |
✅ |
| ➕ Lowest Common Ancestor of BT |
|
| Word Search II |
✅ |
| ➕ BT Right Side View |
✅ |
| ➕ Split a String in Balanced Strings |
✅ |
| ➕ Vertical Order Traversal of a BT |
✅ |
| ➕ Flatten BT to Linked List |
✅ |
| ➕ Convert BST to Doubly Linked List |
✅ |
| ➕ Check Completeness of a BT |
✅ |
| ➕ BT Right Side View |
✅ |
| ➕ All Nodes Distance K in Binary Tree |
✅ |
| ➕ Convert Sorted List to BST |
✅ |
| Heap |
|
| Merge K Sorted Lists |
✅ |
| Top K Frequent Elements |
✅ |
| Find Median from Data Stream |
✅ |
| ➕ Kth Largest Element in an Array |
|
| ➕ Top K Frequent Words |
✅ |
| ➕ K Closest Points to Origin |
✅ |
| ➕ Number & Permutation |
|
| ➕ Maximum Swap |
✅ |
| ➕ Palindrome Number |
✅ |
| ➕ Implement Rand10() Using Rand7() |
✅ |
| ➕ Letter Combinations of a Phone Number |
✅ |
| ➕ Sqrt(x) |
✅ |
| ➕ Valid Perfect Square |
✅ |
| ➕ Sum of Square Numbers |
✅ |
| ➕ Happy Number |
✅ |
| ➕ Knight Dialer |
|
| ➕ Next Permutation |
✅ |
| ➕ Permutations |
✅ |
| ➕ Permutations II |
✅ |
| ➕ Data Structures |
|
| Implement Trie (Prefix Tree) |
✅ |
| Add & Search Word |
✅ |
| ➕ Implement Queue Using Stacks |
✅ |
| ➕ Implement Stack Using Queues |
✅ |
| ➕ LRU Cache |
✅ |
| ➕ LFU Cache |
|
| ➕ Insert Delete Get Random O(1) |
✅ |
| ➕ Insert Delete Get Random O(1) - Dupes Allowed |
✅ |
| ➕ Min Stack |
✅ |
| ➕ Flatten Nested List Iterator |
✅ |
React
Vue.js
Typescript
TensorFlow
Django
Laravel
D3
Facebook
Microsoft
Google
Alibaba
D3
Tencent