mirror of https://github.com/doocs/leetcode.git
|
|
||
|---|---|---|
| .github | ||
| basic | ||
| images | ||
| lcci | ||
| lcof | ||
| solution | ||
| .docsifytopdfrc.js | ||
| .gitignore | ||
| .nojekyll | ||
| CODE_OF_CONDUCT.md | ||
| LICENSE | ||
| README.md | ||
| README_EN.md | ||
| index.html | ||
| summary.md | ||
| summary_en.md | ||
README_EN.md
Introduction
Complete solutions to LeetCode, LCOF and LCCI problems, updated daily.
Sites
- Netlify: https://lc.netlify.app
- Gitee Pages: https://doocs.gitee.io/leetcode
- GitHub Pages: https://doocs.github.io/leetcode
Solutions
Basic Algorithms
Sorting
Searching
High Frequency Interview Questions
Arrays
- Remove Duplicates from Sorted Array
- Remove Element
- Move Zeroes
- Rotate Array
- Spiral Matrix
- Two Sum
- 3Sum
- 4Sum
- Merge Sorted Array
- Find Minimum in Rotated Sorted Array
- Find Minimum in Rotated Sorted Array II
- Product of Array Except Self
Strings
Linked List
- Add Two Numbers
- Delete Node in a Linked List
- Remove Linked List Elements
- Kth Node From End of List
- Swap Nodes in Pairs
- Merge Two Sorted Lists
- Merge k Sorted Lists
- Insertion Sort List
- Sort List
- Reverse Linked List
- Reverse Linked List II
- Reorder List
- Rotate List
- Palindrome Linked List
- Intersection of Two Linked Lists
- Odd Even Linked List
- Linked List Cycle
- Linked List Cycle II
- Design Linked List
Binary Tree
- Symmetric Tree
- Invert Binary Tree
- Binary Tree Level Order Traversal
- Binary Tree Level Order Traversal II
- Maximum Depth of Binary Tree
- Minimum Depth of Binary Tree
- Binary Tree Paths
- Path Sum
- Path Sum II
- Construct Binary Tree from Preorder and Inorder Traversal
- Construct Binary Tree from Inorder and Postorder Traversal
- Lowest Common Ancestor of a Binary Tree
- Lowest Common Ancestor of a Binary Search Tree
- BiNode
- Convert Binary Search Tree to Sorted Doubly Linked List
Math
Stack & Queue
- Valid Parentheses
- Min Stack
- Implement Queue using Stacks
- Implement Stack using Queues
- Evaluate Reverse Polish Notation
- Number of Recent Calls
- Daily Temperatures
Dynamic Programming
- Maximum Subarray
- Maximum Product Subarray
- House Robber
- House Robber II
- Longest Increasing Subsequence
- Russian Doll Envelopes
Misc
Maintainer
Yang Libin: Creator of @Doocs technical community; member of @TheAlgorithms organization.
Contributions
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 machine.
- Make some changes to your leetcode repository, then add, commit and push the changes to your remote GitHub repository.
- Create a pull request with your changes!
- See CONTRIBUTING or GitHub Help for more details.
You can also contribute to doocs/leetcode using Gitpod.io, a free online dev environment with a single click.
Contributors
This project exists thanks to all the people who contribute.
Backers & Sponsors
Thank you to all our backers and sponsors!
"You help the developer community practice for interviews, and there is nothing better we could ask for." -- Alan Yessenbayev
License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

