# leetcode

**Repository Path**: whfever/leetcode

## Basic Information

- **Project Name**: leetcode
- **Description**: 😏 LeetCode solutions in any programming language | 多种编程语言实现 LeetCode、《剑指 Offer（第 2 版）》、《程序员面试金典（第 6 版）》题解
- **Primary Language**: Java
- **License**: CC-BY-SA-4.0
- **Default Branch**: main
- **Homepage**: https://doocs.gitee.io/leetcode
- **GVP Project**: No

## Statistics

- **Stars**: 0
- **Forks**: 342
- **Created**: 2021-03-21
- **Last Updated**: 2021-03-21

## Categories & Tags

**Categories**: Uncategorized

**Tags**: None

## README

<p align="center">
  <a href="https://github.com/doocs/leetcode"><img src="./images/leetcode-doocs.png" alt="LeetCode-GitHub-Doocs"></a>
</p>

<p align="center">
  <a href="https://github.com/doocs/leetcode"><img src="https://img.shields.io/badge/langs-Java%20%7C%20Python%20%7C%20C%2B%2B%20%7C%20JavaScript%20%7C%20Go%20%7C%20...-red?style=flat-square&color=42b883" alt="languages"></a>
  <a href="https://doocs.github.io/#/?id=how-to-join"><img src="https://img.shields.io/badge/organization-join%20us-42b883?style=flat-square" alt="open-source-organization"></a>
  <a href="https://github.com/doocs/leetcode/blob/main/LICENSE"><img src="https://img.shields.io/github/license/doocs/leetcode?color=42b883&style=flat-square" alt="LICENSE"></a><br>
  <a href="https://opencollective.com/doocs-leetcode/backers/badge.svg" alt="backers on Open Collective"><img src="https://img.shields.io/opencollective/backers/doocs-leetcode?color=42b883&style=flat-square&logo=open%20collective&logoColor=ffffff" /></a> 
  <a href="https://github.com/doocs/leetcode/stargazers"><img src="https://img.shields.io/github/stars/doocs/leetcode?color=42b883&logo=github&style=flat-square" alt="stars"></a>
  <a href="https://github.com/doocs/leetcode/network/members"><img src="https://img.shields.io/github/forks/doocs/leetcode?color=42b883&logo=github&style=flat-square" alt="forks"></a>
  <a href="https://opencollective.com/doocs-leetcode/sponsors/badge.svg" alt="Sponsors on Open Collective"><img src="https://img.shields.io/opencollective/sponsors/doocs-leetcode?color=42b883&style=flat-square&logo=open%20collective&logoColor=ffffff" /></a>
</p>

## 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

- [LeetCode](/solution/README_EN.md)
- [LCOF: Coding Interviews, 2nd Edition](/lcof/README_EN.md)
- [LCCI: Cracking the Coding Interview, 6th Edition](/lcci/README_EN.md)

## Basic Algorithms

### Sorting

- [Bubble Sort](/basic/sorting/BubbleSort/README.md)
- [Insertion Sort](/basic/sorting/InsertionSort/README.md)
- [Selection Sort](/basic/sorting/SelectionSort/README.md)
- [Merge Sort](/basic/sorting/MergeSort/README.md)
- [Quick Sort](/basic/sorting/QuickSort/README.md)

### Searching

- [Binary Search](/basic/searching/BinarySearch/README.md)
- [Binary Search II](/basic/searching/BinarySearch-II/README.md)

## High Frequency Interview Questions

### Arrays

- [Remove Duplicates from Sorted Array](/solution/0000-0099/0026.Remove%20Duplicates%20from%20Sorted%20Array/README_EN.md)
- [Remove Element](/solution/0000-0099/0027.Remove%20Element/README_EN.md)
- [Move Zeroes](/solution/0200-0299/0283.Move%20Zeroes/README_EN.md)
- [Rotate Array](/solution/0100-0199/0189.Rotate%20Array/README_EN.md)
- [Spiral Matrix](/solution/0000-0099/0054.Spiral%20Matrix/README_EN.md)
- [Two Sum](/solution/0000-0099/0001.Two%20Sum/README_EN.md)
- [3Sum](/solution/0000-0099/0015.3Sum/README_EN.md)
- [4Sum](/solution/0000-0099/0018.4Sum/README_EN.md)
- [3Sum Smaller](/solution/0200-0299/0259.3Sum%20Smaller/README_EN.md)
- [3Sum Closest](/solution/0000-0099/0016.3Sum%20Closest/README_EN.md)
- [Merge Sorted Array](/solution/0000-0099/0088.Merge%20Sorted%20Array/README_EN.md)
- [Find Minimum in Rotated Sorted Array](/solution/0100-0199/0153.Find%20Minimum%20in%20Rotated%20Sorted%20Array/README_EN.md)
- [Find Minimum in Rotated Sorted Array II](/solution/0100-0199/0154.Find%20Minimum%20in%20Rotated%20Sorted%20Array%20II/README_EN.md)
- [Product of Array Except Self](/solution/0200-0299/0238.Product%20of%20Array%20Except%20Self/README_EN.md)

### Strings

- [Reverse Vowels of a String](/solution/0300-0399/0345.Reverse%20Vowels%20of%20a%20String/README_EN.md)
- [String to Integer (atoi)](/solution/0000-0099/0008.String%20to%20Integer%20%28atoi%29/README_EN.md)
- [Ransom Note](/solution/0300-0399/0383.Ransom%20Note/README_EN.md)

### Linked List

- [Add Two Numbers](/solution/0000-0099/0002.Add%20Two%20Numbers/README_EN.md)
- [Delete Node in a Linked List](/solution/0200-0299/0237.Delete%20Node%20in%20a%20Linked%20List/README_EN.md)
- [Remove Linked List Elements](/solution/0200-0299/0203.Remove%20Linked%20List%20Elements/README_EN.md)
- [Kth Node From End of List](/lcci/02.02.Kth%20Node%20From%20End%20of%20List/README_EN.md)
- [Swap Nodes in Pairs](/solution/0000-0099/0024.Swap%20Nodes%20in%20Pairs/README_EN.md)
- [Merge Two Sorted Lists](/solution/0000-0099/0021.Merge%20Two%20Sorted%20Lists/README_EN.md)
- [Merge k Sorted Lists](/solution/0000-0099/0023.Merge%20k%20Sorted%20Lists/README_EN.md)
- [Insertion Sort List](/solution/0100-0199/0147.Insertion%20Sort%20List/README_EN.md)
- [Sort List](/solution/0100-0199/0148.Sort%20List/README_EN.md)
- [Reverse Linked List](/solution/0200-0299/0206.Reverse%20Linked%20List/README_EN.md)
- [Reverse Linked List II](/solution/0000-0099/0092.Reverse%20Linked%20List%20II/README_EN.md)
- [Reorder List](/solution/0100-0199/0143.Reorder%20List/README_EN.md)
- [Rotate List](/solution/0000-0099/0061.Rotate%20List/README_EN.md)
- [Palindrome Linked List](/solution/0200-0299/0234.Palindrome%20Linked%20List/README_EN.md)
- [Intersection of Two Linked Lists](/solution/0100-0199/0160.Intersection%20of%20Two%20Linked%20Lists/README_EN.md)
- [Odd Even Linked List](/solution/0300-0399/0328.Odd%20Even%20Linked%20List/README_EN.md)
- [Linked List Cycle](/solution/0100-0199/0141.Linked%20List%20Cycle/README_EN.md)
- [Linked List Cycle II](/solution/0100-0199/0142.Linked%20List%20Cycle%20II/README_EN.md)
- [Design Linked List](/solution/0700-0799/0707.Design%20Linked%20List/README_EN.md)

### Binary Tree

- [Binary Tree Preorder Traversal](/solution/0100-0199/0144.Binary%20Tree%20Preorder%20Traversal/README_EN.md)
- [Binary Tree Postorder Traversal](/solution/0100-0199/0145.Binary%20Tree%20Postorder%20Traversal/README_EN.md)
- [Binary Tree Inorder Traversal](/solution/0000-0099/0094.Binary%20Tree%20Inorder%20Traversal/README_EN.md)
- [Symmetric Tree](/solution/0100-0199/0101.Symmetric%20Tree/README_EN.md)
- [Invert Binary Tree](/solution/0200-0299/0226.Invert%20Binary%20Tree/README_EN.md)
- [Binary Tree Level Order Traversal](/solution/0100-0199/0102.Binary%20Tree%20Level%20Order%20Traversal/README_EN.md)
- [Binary Tree Level Order Traversal II](/solution/0100-0199/0107.Binary%20Tree%20Level%20Order%20Traversal%20II/README_EN.md)
- [Maximum Depth of Binary Tree](/solution/0100-0199/0104.Maximum%20Depth%20of%20Binary%20Tree/README_EN.md)
- [Minimum Depth of Binary Tree](/solution/0100-0199/0111.Minimum%20Depth%20of%20Binary%20Tree/README_EN.md)
- [Binary Tree Paths](/solution/0200-0299/0257.Binary%20Tree%20Paths/README_EN.md)
- [Path Sum](/solution/0100-0199/0112.Path%20Sum/README_EN.md)
- [Path Sum II](/solution/0100-0199/0113.Path%20Sum%20II/README_EN.md)
- [Construct Binary Tree from Preorder and Inorder Traversal](/solution/0100-0199/0105.Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal/README_EN.md)
- [Construct Binary Tree from Inorder and Postorder Traversal](/solution/0100-0199/0106.Construct%20Binary%20Tree%20from%20Inorder%20and%20Postorder%20Traversal/README_EN.md)
- [Lowest Common Ancestor of a Binary Tree](/solution/0200-0299/0236.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree/README_EN.md)
- [Lowest Common Ancestor of a Binary Search Tree](/solution/0200-0299/0235.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree/README_EN.md)
- [BiNode](/lcci/17.12.BiNode/README_EN.md)
- [Convert Binary Search Tree to Sorted Doubly Linked List](/solution/0400-0499/0426.Convert%20Binary%20Search%20Tree%20to%20Sorted%20Doubly%20Linked%20List/README_EN.md)

### Math

- [Single Number](/solution/0100-0199/0136.Single%20Number/README_EN.md)
- [Single Number II](/solution/0100-0199/0137.Single%20Number%20II/README_EN.md)
- [Single Number III](/solution/0200-0299/0260.Single%20Number%20III/README_EN.md)
- [Set Mismatch](/solution/0600-0699/0645.Set%20Mismatch/README_EN.md)
- [Count Primes](/solution/0200-0299/0204.Count%20Primes/README_EN.md)
- [Missing Number](/solution/0200-0299/0268.Missing%20Number/README_EN.md)

### Stack & Queue

- [Valid Parentheses](/solution/0000-0099/0020.Valid%20Parentheses/README_EN.md)
- [Min Stack](/solution/0100-0199/0155.Min%20Stack/README_EN.md)
- [Implement Queue using Stacks](/solution/0200-0299/0232.Implement%20Queue%20using%20Stacks/README_EN.md)
- [Implement Stack using Queues](/solution/0200-0299/0225.Implement%20Stack%20using%20Queues/README_EN.md)
- [Evaluate Reverse Polish Notation](/solution/0100-0199/0150.Evaluate%20Reverse%20Polish%20Notation/README_EN.md)
- [Number of Recent Calls](/solution/0900-0999/0933.Number%20of%20Recent%20Calls/README_EN.md)
- [Daily Temperatures](/solution/0700-0799/0739.Daily%20Temperatures/README_EN.md)
- [Basic Calculator II](/solution/0200-0299/0227.Basic%20Calculator%20II/README_EN.md)

### Dynamic Programming

- [Maximum Subarray](/solution/0000-0099/0053.Maximum%20Subarray/README_EN.md)
- [Maximum Product Subarray](/solution/0100-0199/0152.Maximum%20Product%20Subarray/README_EN.md)
- [House Robber](/solution/0100-0199/0198.House%20Robber/README_EN.md)
- [House Robber II](/solution/0200-0299/0213.House%20Robber%20II/README_EN.md)
- [Longest Increasing Subsequence](/solution/0300-0399/0300.Longest%20Increasing%20Subsequence/README_EN.md)
- [Russian Doll Envelopes](/solution/0300-0399/0354.Russian%20Doll%20Envelopes/README_EN.md)

### Misc

- [Combine Two Tables](/solution/0100-0199/0175.Combine%20Two%20Tables/README_EN.md)
- [Second Highest Salary](/solution/0100-0199/0176.Second%20Highest%20Salary/README_EN.md)
- [Nth Highest Salary](/solution/0100-0199/0177.Nth%20Highest%20Salary/README_EN.md)
- [Rank Scores](/solution/0100-0199/0178.Rank%20Scores/README_EN.md)

## 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 push the changes to your remote GitHub repository.
1. Create 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.

<p align="center">
  <a href="https://github.com/doocs/leetcode"><img src="./images/how-to-contribute.png" alt="how-to-contribute"></a>
</p>

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.

[![Open in Gitpod](https://gitpod.io/button/open-in-gitpod.svg)](https://gitpod.io/#https://github.com/doocs/leetcode)

## Contributors

This project exists thanks to all the people who contribute.

<a href="https://opencollective.com/doocs-leetcode/contributors.svg?width=890&button=true" target="_blank"><img src="https://opencollective.com/doocs-leetcode/contributors.svg?width=890&button=false" /></a>

## Backers & Sponsors

Thank you to all our backers and sponsors!

<a href="https://opencollective.com/doocs-leetcode/backers.svg?width=890" target="_blank"><img src="https://opencollective.com/doocs-leetcode/backers.svg?width=890"></a>

<a href="https://opencollective.com/doocs-leetcode/sponsors.svg?width=890" target="_blank"><img src="https://opencollective.com/doocs-leetcode/sponsors.svg?width=890"></a>

> "_You help the developer community practice for interviews, and there is nothing better we could ask for._" -- [Alan Yessenbayev](https://opencollective.com/alan-yessenbayev)

## License

This work is licensed under a <a rel="license" href="http://creativecommons.org/licenses/by-sa/4.0/">Creative Commons Attribution-ShareAlike 4.0 International License</a>.

[![FOSSA Status](https://app.fossa.com/api/projects/git%2Bgithub.com%2Fdoocs%2Fleetcode.svg?type=large)](https://app.fossa.com/projects/git%2Bgithub.com%2Fdoocs%2Fleetcode?ref=badge_large)