https://github.com/silenceoverflow/leetcode_solutions_in_cpp
LeetCode Solutions Implemented in C++ and Notes on Algorithms and Data Structures
https://github.com/silenceoverflow/leetcode_solutions_in_cpp
algorithms-and-data-structures leetcode-solutions
Last synced: 5 months ago
JSON representation
LeetCode Solutions Implemented in C++ and Notes on Algorithms and Data Structures
- Host: GitHub
- URL: https://github.com/silenceoverflow/leetcode_solutions_in_cpp
- Owner: SilenceOverflow
- License: mit
- Created: 2017-12-19T04:34:00.000Z (over 7 years ago)
- Default Branch: master
- Last Pushed: 2018-07-07T00:38:44.000Z (almost 7 years ago)
- Last Synced: 2024-12-04T15:37:14.085Z (7 months ago)
- Topics: algorithms-and-data-structures, leetcode-solutions
- Language: C++
- Homepage:
- Size: 145 KB
- Stars: 4
- Watchers: 0
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
LeetCode Solutions - Implemented in 
# Current Updating
If you think this repo is useful, please ***watch***, ***star*** or ***fork*** it!
## About LeetCode
LeetCode Online Judge is a platform for preparing technical coding interviews and assessing your knowledge of data structures and algorithms. Here is the problem list - [LeetCode](https://leetcode.com/problemset/algorithms/).
One problem each day. / 日拱一卒 (in Chinese)
## Tags
Tags are arranged in alphabetical order, while in each category, orders are arranged in numerical order.
* [Array](https://github.com/YoujieXia/LeetCode_Solutions_in_CPP#array)
* [Backtracking](https://github.com/YoujieXia/LeetCode_Solutions_in_CPP#backtracking)
* [Bit Manipulation](https://github.com/YoujieXia/LeetCode_Solutions_in_CPP#bit-manipulation)
* [Greedy](https://github.com/YoujieXia/LeetCode_Solutions_in_CPP#Greedy)
* [Queue](https://github.com/YoujieXia/LeetCode_Solutions_in_CPP#Queue)
## Array
| Order | Title | Analysis | Solution | Time | Space | Difficulty | Runtime | Beats |
|:-----:|---------------- | :---------: | :-------------: | --------------- | :-------------: | :-------------: | :-------------: | :-------------: |
| 078 | Subsets | [Markdown](./md/078-subsets.md) | [C++](./cpp/078-subsets.cpp) | O(n * 2^n) | O(1) | Medium | 6 ms | 12.97% |
| 621 | Task Scheduler | [Markdown](./md/621-task_scheduler.md) | [C++](./cpp/621-task_scheduler.cpp) | O(n) | O(26)/O(1) | Medium | 46 ms | 95.31% |
## Backtracking
| Order | Title | Analysis | Solution | Time | Space | Difficulty | Runtime | Beats |
|:-----:|---------------- | :---------: | :-------------: | --------------- | :-------------: | :-------------: | :-------------: | :-------------: |
| 078 | Subsets | [Markdown](./md/078-subsets.md) | [C++](./cpp/078-subsets.cpp) | O(n * 2^n) | O(1) | Medium | 6 ms | 12.97% |
## Bit Manipulation
| Order | Title | Analysis | Solution | Time | Space | Difficulty | Runtime | Beats |
|:-----:|---------------- | :---------: | :-------------: | --------------- | :-------------: | :-------------: | :-------------: | :-------------: |
| 078 | Subsets | [Markdown](./md/078-subsets.md) | [C++](./cpp/078-subsets.cpp) | O(n * 2^n) | O(1) | Medium | 6 ms | 12.97% |
## Greedy
| Order | Title | Analysis | Solution | Time | Space | Difficulty | Runtime | Beats |
|:-----:|---------------- | :---------: | :-------------: | --------------- | :-------------: | :-------------: | :-------------: | :-------------: |
| 621 | Task Scheduler | [Markdown](./md/621-task_scheduler.md) | [C++](./cpp/621-task_scheduler.cpp) | O(n) | O(26)/O(1) | Medium | 46 ms | 95.31% |
## Queue
| Order | Title | Analysis | Solution | Time | Space | Difficulty | Runtime | Beats |
|:-----:|---------------- | :---------: | :-------------: | --------------- | :-------------: | :-------------: | :-------------: | :-------------: |
| 621 | Task Scheduler | [Markdown](./md/621-task_scheduler.md) | [C++](./cpp/621-task_scheduler.cpp) | O(n) | O(26)/O(1) | Medium | 46 ms | 95.31% |
## To Do
- [x] add corresponding `.cpp` files
- [x] add links to each problem page
## License
[MIT](License)