This table is generated by python scripts.
# | Title | Solution | Difficulty |
---|---|---|---|
1 | Two Sum | Python3 | |
2 | Add Two Numbers | Python3 | |
5 | Longest Palindromic Substring | Python3 | |
10 | Regular Expression Matching | Python3 | |
11 | Container With Most Water | Python3 | |
15 | 3Sum | Python3 | |
17 | Letter Combinations of a Phone Number | Python3 | |
20 | Valid Parentheses | Python3 | |
22 | Generate Parentheses | Python3 | |
23 | Merge k Sorted Lists | Python3 | |
24 | Swap Nodes in Pairs | Python3 | |
31 | Next Permutation | Python3 | |
32 | Longest Valid Parentheses | Python3 | |
33 | Search in Rotated Sorted Array | Python3 | |
34 | Find First and Last Position of Element in Sorted Array | Python3 | |
39 | Combination Sum | Python3 | |
40 | Combination Sum II | Python3 | |
42 | Trapping Rain Water | Python3 | |
44 | Wildcard Matching | Python3 | |
46 | Permutations | Python3 | |
47 | Permutations II | Python3 | |
50 | Pow(x, n) | Python3 | |
51 | N-Queens | Python3 | |
56 | Merge Intervals | Python3 | |
57 | Insert Interval | Python3 | |
71 | Simplify Path | Python3 | |
75 | Sort Colors | Python3 | |
78 | Subsets | Python3 | |
79 | Word Search | Python3 | |
84 | Largest Rectangle in Histogram | Python3 | |
86 | Partition List | Python3 | |
90 | Subsets II | Python3 | |
93 | Restore IP Addresses | Python3 | |
94 | Binary Tree Inorder Traversal | Python3 | |
98 | Validate Binary Search Tree | Python3 | |
100 | Same Tree | Python3 | |
101 | Symmetric Tree | Python3 | |
102 | Binary Tree Level Order Traversal | Python3 | |
104 | Maximum Depth of Binary Tree | Python3 | |
109 | Convert Sorted List to Binary Search Tree | Python3 | |
110 | Balanced Binary Tree | Python3 | |
111 | Minimum Depth of Binary Tree | Python3 | |
112 | Path Sum | Python3 | |
113 | Path Sum II | Python3 | |
114 | Flatten Binary Tree to Linked List | Python3 | |
116 | Populating Next Right Pointers in Each Node | Python3 | |
120 | Triangle | Python3 | |
121 | Best Time to Buy and Sell Stock | Python3 | |
122 | Best Time to Buy and Sell Stock II | Python3 | |
123 | Best Time to Buy and Sell Stock III | Python3 | |
124 | Binary Tree Maximum Path Sum | Python3 | |
125 | Valid Palindrome | Python3 | |
126 | Word Ladder II | Python3 | |
129 | Sum Root to Leaf Numbers | Python3 | |
133 | Clone Graph | Python3 | |
139 | Word Break | Python3 | |
140 | Word Break II | Python3 | |
144 | Binary Tree Preorder Traversal | Python3 | |
145 | Binary Tree Postorder Traversal | Python3 | |
146 | LRU Cache | Python3 | |
150 | Evaluate Reverse Polish Notation | Python3 | |
153 | Find Minimum in Rotated Sorted Array | Python3 | |
154 | Find Minimum in Rotated Sorted Array II | Python3 | |
155 | Min Stack | Python3 | |
162 | Find Peak Element | Python3 | |
173 | Binary Search Tree Iterator | Python3 | |
188 | Best Time to Buy and Sell Stock IV | Python3 | |
207 | Course Schedule | Python3 | |
210 | Course Schedule II | Python3 | |
215 | Kth Largest Element in an Array | Python3 | |
216 | Combination Sum III | Python3 | |
225 | Implement Stack using Queues | Python3 | |
230 | Kth Smallest Element in a BST | Python3 | |
232 | Implement Queue using Stacks | Python3 | |
235 | Lowest Common Ancestor of a Binary Search Tree | Python3 | |
236 | Lowest Common Ancestor of a Binary Tree | Python3 | |
242 | Valid Anagram | Python3 | |
252 | Meeting Rooms | Python3 | |
253 | Meeting Rooms II | Python3 | |
257 | Binary Tree Paths | Python3 | |
263 | Ugly Number | Python3 | |
264 | Ugly Number II | Python3 | |
269 | Alien Dictionary | Python3 | |
270 | Closest Binary Search Tree Value | Python3 | |
272 | Closest Binary Search Tree Value II | Python3 | |
278 | First Bad Version | Python3 | |
283 | Move Zeroes | Python3 | |
285 | Inorder Successor in BST | Python3 | |
290 | Word Pattern | Python3 | |
298 | Binary Tree Longest Consecutive Sequence | Python3 | |
301 | Remove Invalid Parentheses | Python3 | |
302 | Smallest Rectangle Enclosing Black Pixels | Python3 | |
309 | Best Time to Buy and Sell Stock with Cooldown | Python3 | |
313 | Super Ugly Number | Python3 | |
317 | Shortest Distance from All Buildings | Python3 | |
322 | Coin Change | Python3 | |
332 | Reconstruct Itinerary | Python3 | |
333 | Largest BST Subtree | Python3 | |
334 | Increasing Triplet Subsequence | Python3 | |
341 | Flatten Nested List Iterator | Python3 | |
347 | Top K Frequent Elements | Python3 | |
353 | Design Snake Game | Python3 | |
380 | Insert Delete GetRandom O(1) | Python3 | |
387 | First Unique Character in a String | Python3 | |
394 | Decode String | Python3 | |
416 | Partition Equal Subset Sum | Python3 | |
417 | Pacific Atlantic Water Flow | Python3 | |
429 | N-ary Tree Level Order Traversal | Python3 | |
430 | Flatten a Multilevel Doubly Linked List | Python3 | |
437 | Path Sum III | Python3 | |
444 | Sequence Reconstruction | Python3 | |
445 | Add Two Numbers II | Python3 | |
451 | Sort Characters By Frequency | Python3 | |
474 | Ones and Zeroes | Python3 | |
486 | Predict the Winner | Python3 | |
490 | The Maze | Python3 | |
494 | Target Sum | Python3 | |
496 | Next Greater Element I | Python3 | |
498 | Diagonal Traverse | Python3 | |
503 | Next Greater Element II | Python3 | |
505 | The Maze II | Python3 | |
518 | Coin Change 2 | Python3 | |
525 | Contiguous Array | Python3 | |
549 | Binary Tree Longest Consecutive Sequence II | Python3 | |
556 | Next Greater Element III | Python3 | |
567 | Permutation in String | Python3 | |
572 | Subtree of Another Tree | Python3 | |
582 | Kill Process | Python3 | |
589 | N-ary Tree Preorder Traversal | Python3 | |
590 | N-ary Tree Postorder Traversal | Python3 | |
621 | Task Scheduler | Python3 | |
622 | Design Circular Queue | Python3 | |
641 | Design Circular Deque | Python3 | |
658 | Find K Closest Elements | Python3 | |
669 | Trim a Binary Search Tree | Python3 | |
687 | Longest Univalue Path | Python3 | |
702 | Search in a Sorted Array of Unknown Size | Python3 | |
703 | Kth Largest Element in a Stream | Python3 | |
714 | Best Time to Buy and Sell Stock with Transaction Fee | Python3 | |
735 | Asteroid Collision | Python3 | |
739 | Daily Temperatures | Python3 | |
743 | Network Delay Time | Python3 | |
759 | Employee Free Time | Python3 | |
785 | Is Graph Bipartite? | Python3 | |
787 | Cheapest Flights Within K Stops | Python3 | |
814 | Binary Tree Pruning | Python3 | |
841 | Keys and Rooms | Python3 | |
852 | Peak Index in a Mountain Array | Python3 | |
872 | Leaf-Similar Trees | Python3 | |
876 | Middle of the Linked List | Python3 | |
877 | Stone Game | Python3 | |
901 | Online Stock Span | Python3 | |
915 | Partition Array into Disjoint Intervals | Python3 | |
965 | Univalued Binary Tree | Python3 | |
973 | K Closest Points to Origin | Python3 | |
986 | Interval List Intersections | Python3 | |
1013 | Partition Array Into Three Parts With Equal Sum | Python3 | |
1024 | Video Stitching | Python3 | |
1029 | Two City Scheduling | Python3 | |
1043 | Partition Array for Maximum Sum | Python3 | |
1053 | Previous Permutation With One Swap | Python3 | |
1123 | Lowest Common Ancestor of Deepest Leaves | Python3 | |
1169 | Invalid Transactions | Python3 | |
1190 | Reverse Substrings Between Each Pair of Parentheses | Python3 | |
1209 | Remove All Adjacent Duplicates in String II | Python3 | |
1274 | Number of Ships in a Rectangle | Python3 | |
1302 | Deepest Leaves Sum | Python3 | |
1325 | Delete Leaves With a Given Value | Python3 | |
1329 | Sort the Matrix Diagonally | Python3 | |
1396 | Design Underground System | Python3 | |
1462 | Course Schedule IV | Python3 |
- @zixuanzhang98 - all python3 and java solutions
🌱 MIT @zixuanzhang98 🌱