Complete solutions to Leetcode problems, updated daily.
# | Title | Tags |
---|---|---|
002 | Add Two Numbers | Linked List , Math |
003 | Longest Substring Without Repeating Characters | Hash Table , Two Pointers , String |
005 | Longest Palindromic Substring | String , Dynamic Programming |
015 | 3Sum | Array , Two Pointers |
018 | 4Sum | Array , Hash Table , Two Pointers |
019 | Remove Nth Node From End of List | Linked List , Two Pointers |
024 | Swap Nodes in Pairs | Linked List |
031 | Next Permutation | Array |
046 | Permutations | Backtracking |
047 | Permutations II | Backtracking |
054 | Spiral Matrix | Array |
059 | Spiral Matrix II | Array |
061 | Rotate List | Linked List , Two Pointers |
062 | Unique Paths | Array , Dynamic Programming |
063 | Unique Paths II | Array , Dynamic Programming |
075 | Sort Colors | Array , Two Pointers , Sort |
082 | Remove Duplicates from Sorted List II | Linked List |
086 | Partition List | Linked List , Two Pointers |
092 | Reverse Linked List II | Linked List |
094 | Binary Tree Inorder Traversal | Hash Table , Stack , Tree |
102 | Binary Tree Level Order Traversal | Tree , Breadth-first Search |
127 | Word Ladder | Breadth-first Search |
130 | Surrounded Regions | Depth-first Search , Breadth-first Search , Union Find |
137 | Single Number II | Bit Manipulation |
142 | Linked List Cycle II | Linked List , Two Pointers |
143 | Reorder List | Linked List |
144 | Binary Tree Preorder Traversal | Stack , Tree |
150 | Evaluate Reverse Polish Notation | Stack |
153 | Find Minimum in Rotated Sorted Array | Array , Binary Search |
177 | Nth Highest Salary | SQL |
178 | Rank Scores | SQL |
180 | Consecutive Numbers | SQL |
328 | Odd Even Linked List | Linked List |
# | Title | Tags |
---|---|---|
004 | Median of Two Sorted Arrays | Array , Binary Search , Divide and Conquer |
023 | Merge k Sorted Lists | Linked List , Divide and Conquer , Heap |
032 | Longest Valid Parentheses | String , Dynamic Programming |
084 | Largest Rectangle in Histogram | Array , Stack |
145 | Binary Tree Postorder Traversal | Stack , Tree |
295 | Find Median from Data Stream | Heap , Design |
I'm looking for long-term contributors/partners to this repo! Send me PRs if you're interested! See the following:
- Fork this repository to your own GitHub account and then clone it to your local device.
- Add or update file of the repository, then commit and push it to your GitHub repository.
- Submit a pull request with your changes!
- For more details, see CONTRIBUTING.md
" If you want to go fast, go alone. If you want to go far, go together. And that's the spirit of teamwork ".
|
|
|
|
|
|
|
|
---|---|---|---|---|---|---|---|
|
|
|
|
|