{"id":18527499,"url":"https://github.com/aurelius84/leetcode","last_synced_at":"2026-02-06T03:01:18.375Z","repository":{"id":112060201,"uuid":"100382696","full_name":"Aurelius84/LeetCode","owner":"Aurelius84","description":"LeetCode Is Precious deposits","archived":false,"fork":false,"pushed_at":"2017-10-12T03:38:51.000Z","size":119,"stargazers_count":5,"open_issues_count":0,"forks_count":3,"subscribers_count":6,"default_branch":"master","last_synced_at":"2025-02-17T06:27:22.214Z","etag":null,"topics":["leetcode","leetcode-java","leetcode-python"],"latest_commit_sha":null,"homepage":"","language":null,"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/Aurelius84.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-08-15T13:54:58.000Z","updated_at":"2021-03-22T06:37:33.000Z","dependencies_parsed_at":null,"dependency_job_id":"44084b45-a113-4a8d-bcaf-2f29bffc95f3","html_url":"https://github.com/Aurelius84/LeetCode","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/Aurelius84/LeetCode","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Aurelius84%2FLeetCode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Aurelius84%2FLeetCode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Aurelius84%2FLeetCode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Aurelius84%2FLeetCode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Aurelius84","download_url":"https://codeload.github.com/Aurelius84/LeetCode/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Aurelius84%2FLeetCode/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":29147369,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-02-06T02:39:25.012Z","status":"ssl_error","status_checked_at":"2026-02-06T02:37:22.784Z","response_time":59,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.5:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"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":["leetcode","leetcode-java","leetcode-python"],"created_at":"2024-11-06T17:55:18.489Z","updated_at":"2026-02-06T03:01:18.318Z","avatar_url":"https://github.com/Aurelius84.png","language":null,"readme":"# LeetCode Is Precious deposits\r\n## A group of Bupt coders, Coding every day!！\r\n\r\n- **The overall plan is as follows：**\r\n  - One day a question\r\n  - In units of weeks, where the ratio of easy, medium, hard is 3: 2: 2\r\n  - 8 o'clock every morning to publish the question, at 11 pm given the best submission today\r\n\r\n- **Title type order：**\r\n  - The first stage：array、string、tree、linkedlist、math\r\n  - The second stage：HashTable、SortTopological Sort、Graph、Trie、MiniMax、Stack、Queue\r\n  - The third stage：Binary Search、Two Pointers、Heap、Binary Search Tree、Binary Indexed Tree、Recursion、Greedy、Union Find、Map\r\n  - The fourth stage：Depth-first Search、Breadth-first Search、Design、Backtracking、Dynamic Programming、Divide and Conquer、Segment Tree、Reservior sampling、Geometry、Memoization、Bit Manipulation\r\n\r\n## First Week (array)\r\n- [643. Maximum Average Subarray I](https://leetcode.com/problems/maximum-average-subarray-i/description/) (Easy)\r\n- [611. Valid Triangle Number I](https://leetcode.com/problems/valid-triangle-number/description/) (Medium)\r\n- [605. Can Place Flowers ](https://leetcode.com/problems/valid-triangle-number/description/) (Easy)\r\n- [565. Array Nesting ](https://leetcode.com/problems/array-nesting/description/) (Medium)\r\n- [41. First Missing Positive](https://leetcode.com/problems/first-missing-positive/description/) (Hard)\r\n- [57. Insert Interval](https://leetcode.com/problems/insert-interval/description/) (Hard)\r\n\r\n## Second Week (array)\r\n- [661. Image Smoother](https://leetcode.com/problems/image-smoother/description/)(Easy)\r\n- [495. Teemo Attacking](https://leetcode.com/problems/teemo-attacking/description/)(Medium)\r\n- [560. Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k/description/)(Medium)\r\n- [268. Missing Number](https://leetcode.com/problems/missing-number/description/)(Easy)\r\n- [442. Find All Duplicates in an Array](https://leetcode.com/problems/find-all-duplicates-in-an-array/description/)(Medium)\r\n- [537. Complex Number Multiplication ](https://leetcode.com/problems/complex-number-multiplication/description/)(Medium)\r\n- [657. Judge Route Circle ](https://leetcode.com/problems/judge-route-circle/description/)(Easy)\r\n\r\n## Third Week (string)\r\n- [647. Palindromic Substrings ](https://leetcode.com/problems/palindromic-substrings/description/)(Medium)\r\n- [632. Smallest Range ](https://leetcode.com/problems/smallest-range/description/)(Hard)\r\n- [632. Construct String from Binary Tree ](https://leetcode.com/problems/construct-string-from-binary-tree/description/)(Easy)\r\n- [551. Student Attendance Record I ](https://leetcode.com/problems/student-attendance-record-i/description/)(Easy)\r\n- [583. Delete Operation for Two Strings](https://leetcode.com/problems/delete-operation-for-two-strings/description/)(Medium)\r\n- [115. Distinct Subsequences](https://leetcode.com/problems/distinct-subsequences/description/)(Hard)\r\n- [541. Reverse String II](https://leetcode.com/problems/reverse-string-ii/description/)(Easy)\r\n\r\n## Forth Week (string)\r\n- [557. Reverse Words in a String III](https://leetcode.com/problems/reverse-words-in-a-string-iii/description/)(Easy)\r\n- [609. Find Duplicate File in System](https://leetcode.com/problems/find-duplicate-file-in-system/description/)(Medium)\r\n- [564. Find the Closest Palindrome](https://leetcode.com/problems/find-the-closest-palindrome/)(Hard)\r\n- [28. Implement strStr()](https://leetcode.com/problems/implement-strstr/description/)(Easy)\r\n- [22. Generate Parentheses](https://leetcode.com/problems/generate-parentheses/description/)(Medium)\r\n- [345. Reverse Vowels of a String](https://leetcode.com/problems/reverse-vowels-of-a-string/description/)(Easy)\r\n- [97. Interleaving String](https://leetcode.com/problems/interleaving-string/description/)(Hard)\r\n\r\n## Fifth Week (tree)\r\n- [38. Count and Say](https://leetcode.com/problems/count-and-say/hints/)(Easy)\r\n- [662. Maximum Width of Binary Tree ](https://leetcode.com/problems/maximum-width-of-binary-tree/description/)(Medium)\r\n- [654. Maximum Binary Tree ](https://leetcode.com/problems/maximum-binary-tree/description/)(Medium)\r\n- [111. Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree/description/)(easy)\r\n- [99. Recover Binary Search Tree ](https://leetcode.com/problems/recover-binary-search-tree/description/)(Hard)\r\n- [297. Serialize and Deserialize Binary Tree ](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/description/)(Hard)\r\n- [669. Trim a Binary Search Tree](https://leetcode.com/problems/trim-a-binary-search-tree/description/)(Easy)\r\n\r\n## Sixth Week (tree)\r\n- [515. Find Largest Value in Each Tree Row](https://leetcode.com/problems/find-largest-value-in-each-tree-row/description/)(Medium)\r\n- [145. Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal/description/)(Hard)\r\n- [501. Find Mode in Binary Search Tree](https://leetcode.com/problems/find-mode-in-binary-search-tree/description/)(Easy)\r\n- [513. Find Bottom Left Tree Value](https://leetcode.com/problems/find-bottom-left-tree-value/description/)(Medium)\r\n- [124. Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum/description/)(Hard)\r\n- 周六？？\r\n- [112. Path Sum](https://leetcode.com/problems/path-sum/description/)(Easy)\r\n\r\n## Seventh Week (hashtable)\r\n- 周一？？\r\n- [525. Contiguous Array](https://leetcode.com/problems/contiguous-array/description/)(Medium)\r\n- [76. Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring/description/)(Hard)\r\n- [645. Set Mismatch](https://leetcode.com/problems/set-mismatch/description/)(Easy)\r\n- [451. Sort Characters By Frequency](https://leetcode.com/problems/sort-characters-by-frequency/description/)(Medium)\r\n\r\n## Eighth Week(hashtale)\r\n- [599. Minimum Index Sum of Two Lists](https://leetcode.com/problems/minimum-index-sum-of-two-lists/description/)(Easy)\r\n- [3. Longest Substring Without Repeating Characters](https://leetcode.com/problems/minimum-index-sum-of-two-lists/description/)(Medium)\r\n- [18. 4Sum](https://leetcode.com/problems/4sum/description/)(Medium)\r\n- [15. 3Sum](https://leetcode.com/problems/3sum/description/)(Medium)\r\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Faurelius84%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Faurelius84%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Faurelius84%2Fleetcode/lists"}