{"id":22359970,"url":"https://github.com/silenceoverflow/leetcode_solutions_in_cpp","last_synced_at":"2025-10-14T23:31:22.728Z","repository":{"id":121189157,"uuid":"114719462","full_name":"SilenceOverflow/LeetCode_Solutions_in_CPP","owner":"SilenceOverflow","description":"LeetCode Solutions Implemented in C++ and Notes on Algorithms and Data Structures","archived":false,"fork":false,"pushed_at":"2018-07-07T00:38:44.000Z","size":148,"stargazers_count":4,"open_issues_count":0,"forks_count":1,"subscribers_count":0,"default_branch":"master","last_synced_at":"2024-12-04T15:37:14.085Z","etag":null,"topics":["algorithms-and-data-structures","leetcode-solutions"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/SilenceOverflow.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2017-12-19T04:34:00.000Z","updated_at":"2024-04-23T19:30:56.000Z","dependencies_parsed_at":null,"dependency_job_id":"494f5048-6e33-48a2-827f-4b15142c3f23","html_url":"https://github.com/SilenceOverflow/LeetCode_Solutions_in_CPP","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SilenceOverflow%2FLeetCode_Solutions_in_CPP","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SilenceOverflow%2FLeetCode_Solutions_in_CPP/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SilenceOverflow%2FLeetCode_Solutions_in_CPP/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SilenceOverflow%2FLeetCode_Solutions_in_CPP/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/SilenceOverflow","download_url":"https://codeload.github.com/SilenceOverflow/LeetCode_Solutions_in_CPP/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":236535423,"owners_count":19164793,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithms-and-data-structures","leetcode-solutions"],"created_at":"2024-12-04T15:28:19.678Z","updated_at":"2025-10-14T23:31:17.441Z","avatar_url":"https://github.com/SilenceOverflow.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"LeetCode Solutions - Implemented in ![Language](https://img.shields.io/badge/language-CPP-blue.svg)\n\n# Current Updating\nIf you think this repo is useful, please ***watch***, ***star*** or ***fork*** it!\n\n## About LeetCode\n\nLeetCode 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/).  \n\nOne problem each day. / 日拱一卒 (in Chinese)\n\n## Tags\nTags are arranged in alphabetical order, while in each category, orders are arranged in numerical order.\n\n* [Array](https://github.com/YoujieXia/LeetCode_Solutions_in_CPP#array)\n* [Backtracking](https://github.com/YoujieXia/LeetCode_Solutions_in_CPP#backtracking)\n* [Bit Manipulation](https://github.com/YoujieXia/LeetCode_Solutions_in_CPP#bit-manipulation)\n* [Greedy](https://github.com/YoujieXia/LeetCode_Solutions_in_CPP#Greedy)\n* [Queue](https://github.com/YoujieXia/LeetCode_Solutions_in_CPP#Queue)\n\n## Array\n\n|  Order  | Title |   Analysis    | Solution |  Time           | Space           | Difficulty    | Runtime | Beats |\n|:-----:|---------------- | :---------: | :-------------: | --------------- | :-------------: | :-------------: | :-------------: | :-------------: |\n| 078 | Subsets | [Markdown](./md/078-subsets.md) | [C++](./cpp/078-subsets.cpp) | O(n * 2^n) | O(1) |  Medium | 6 ms\t| 12.97% |\n| 621 | Task Scheduler | [Markdown](./md/621-task_scheduler.md) | [C++](./cpp/621-task_scheduler.cpp) | O(n) | O(26)/O(1) |  Medium | 46 ms\t| 95.31% |\n\n\n## Backtracking\n\n|  Order  | Title |   Analysis    | Solution |  Time           | Space           | Difficulty    | Runtime | Beats |\n|:-----:|---------------- | :---------: | :-------------: | --------------- | :-------------: | :-------------: | :-------------: | :-------------: |\n| 078 | Subsets | [Markdown](./md/078-subsets.md) | [C++](./cpp/078-subsets.cpp) | O(n * 2^n) | O(1) |  Medium | 6 ms\t| 12.97% |\n\n\n## Bit Manipulation\n\n|  Order  | Title |   Analysis    | Solution |  Time           | Space           | Difficulty    | Runtime | Beats |\n|:-----:|---------------- | :---------: | :-------------: | --------------- | :-------------: | :-------------: | :-------------: | :-------------: |\n| 078 | Subsets | [Markdown](./md/078-subsets.md) | [C++](./cpp/078-subsets.cpp) | O(n * 2^n) | O(1) |  Medium | 6 ms\t| 12.97% |\n\n## Greedy\n\n|  Order  | Title |   Analysis    | Solution |  Time           | Space           | Difficulty    | Runtime | Beats |\n|:-----:|---------------- | :---------: | :-------------: | --------------- | :-------------: | :-------------: | :-------------: | :-------------: |\n| 621 | Task Scheduler | [Markdown](./md/621-task_scheduler.md) | [C++](./cpp/621-task_scheduler.cpp) | O(n) | O(26)/O(1) |  Medium | 46 ms\t| 95.31% |\n## Queue\n\n|  Order  | Title |   Analysis    | Solution |  Time           | Space           | Difficulty    | Runtime | Beats |\n|:-----:|---------------- | :---------: | :-------------: | --------------- | :-------------: | :-------------: | :-------------: | :-------------: |\n| 621 | Task Scheduler | [Markdown](./md/621-task_scheduler.md) | [C++](./cpp/621-task_scheduler.cpp) | O(n) | O(26)/O(1) |  Medium | 46 ms\t| 95.31% |\n\n\u003c!--### Notes: TLE \u0026 MLE\nFailed attempts are kept in the source code as documentation, which are annotated as TLE (Time Limit Exceeded) or MLE (Memory Limit Exceeded).--\u003e\n\n\n\n\n\n\n\n## To Do\n- [x] add corresponding `.cpp` files\n- [x] add links to each problem page\n\n\n## License\n[MIT](License)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsilenceoverflow%2Fleetcode_solutions_in_cpp","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsilenceoverflow%2Fleetcode_solutions_in_cpp","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsilenceoverflow%2Fleetcode_solutions_in_cpp/lists"}