# leetcode **Repository Path**: sswordfish/leetcode ## Basic Information - **Project Name**: leetcode - **Description**: No description available - **Primary Language**: Unknown - **License**: CC-BY-SA-4.0 - **Default Branch**: main - **Homepage**: None - **GVP Project**: No ## Statistics - **Stars**: 0 - **Forks**: 0 - **Created**: 2020-12-04 - **Last Updated**: 2020-12-19 ## Categories & Tags **Categories**: Uncategorized **Tags**: None ## README
## Introduction Complete solutions to [LeetCode](https://leetcode-cn.com/problemset/all/), [LCOF](https://leetcode-cn.com/problemset/lcof/) and [LCCI](https://leetcode-cn.com/problemset/lcci/) problems, updated daily. [中文文档](/README.md) ## Sites - Netlify: https://lc.netlify.app - Gitee Pages: https://doocs.gitee.io/leetcode - GitHub Pages: https://doocs.github.io/leetcode ## Solutions 1. [LeetCode](/solution/README_EN.md) 1. [LCOF: _Coding Interviews, 2nd Edition_](/lcof/README_EN.md) 1. [LCCI: _Cracking the Coding Interview, 6th Edition_](/lcci/README_EN.md) ## Basic Algorithms 1. [Bubble Sort](/basic/sorting/BubbleSort/README.md) 1. [Insertion Sort](/basic/sorting/InsertionSort/README.md) 1. [Selection Sort](/basic/sorting/SelectionSort/README.md) 1. [Merge Sort](/basic/sorting/MergeSort/README.md) 1. [Quick Sort](/basic/sorting/QuickSort/README.md) ## High Frequency Interview Questions ### Arrays 1. [Rotate Array](/solution/0100-0199/0189.Rotate%20Array/README_EN.md) ### Linked List 1. [Delete Node in a Linked List](/solution/0200-0299/0237.Delete%20Node%20in%20a%20Linked%20List/README_EN.md) 1. [Kth Node From End of List](/lcci/02.02.Kth%20Node%20From%20End%20of%20List/README_EN.md) 1. [Reverse Linked List](/solution/0200-0299/0206.Reverse%20Linked%20List/README_EN.md) 1. [Linked List Cycle](/solution/0100-0199/0141.Linked%20List%20Cycle/README_EN.md) 1. [Linked List Cycle II](/solution/0100-0199/0142.Linked%20List%20Cycle%20II/README_EN.md) ### Binary Tree 1. [Lowest Common Ancestor of a Binary Tree](/solution/0200-0299/0236.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree/README_EN.md) 1. [Lowest Common Ancestor of a Binary Search Tree](/solution/0200-0299/0235.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree/README_EN.md) ### Math 1. [Set Mismatch](/solution/0600-0699/0645.Set%20Mismatch/README_EN.md) ### Stack & Queue ### Dynamic Programming ### Misc ## Maintainer [Yang Libin](https://github.com/yanglbme): Creator of [@Doocs](https://github.com/doocs) technical community; member of [@TheAlgorithms](https://github.com/TheAlgorithms) organization. ## Contributions I'm looking for long-term contributors/partners to this repo! Send me [PRs](https://github.com/doocs/leetcode/pulls) if you're interested! See the following: 1. Fork [this repository](https://github.com/doocs/leetcode) to your own GitHub account and then clone it to your local machine. 1. Make some changes to your leetcode repository, then add, commit and push the changes to your remote GitHub repository. 1. Submit a pull request with your changes! 1. See [CONTRIBUTING](https://github.com/doocs/.github/blob/main/CONTRIBUTING.md) or [GitHub Help](https://help.github.com/en) for more details. You can also contribute to [doocs/leetcode](https://github.com/doocs/leetcode) using [Gitpod.io](https://www.gitpod.io), a free online dev environment with a single click. [](https://gitpod.io/#https://github.com/doocs/leetcode) ## Contributors This project exists thanks to all the people who contribute.