{"id":21024022,"url":"https://github.com/linxueyuanstdio/leetcode","last_synced_at":"2025-10-09T03:07:38.040Z","repository":{"id":97885290,"uuid":"107560928","full_name":"LinXueyuanStdio/leetcode","owner":"LinXueyuanStdio","description":"python solution for leetcode","archived":false,"fork":false,"pushed_at":"2021-09-25T07:25:03.000Z","size":145,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":0,"default_branch":"master","last_synced_at":"2025-10-09T03:03:19.583Z","etag":null,"topics":["leetcode","leetcode-practice","leetcode-python","leetcode-solutions"],"latest_commit_sha":null,"homepage":null,"language":"Python","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/LinXueyuanStdio.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-10-19T14:57:22.000Z","updated_at":"2021-09-25T07:25:06.000Z","dependencies_parsed_at":"2023-06-15T01:15:46.348Z","dependency_job_id":null,"html_url":"https://github.com/LinXueyuanStdio/leetcode","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/LinXueyuanStdio/leetcode","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/LinXueyuanStdio%2Fleetcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/LinXueyuanStdio%2Fleetcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/LinXueyuanStdio%2Fleetcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/LinXueyuanStdio%2Fleetcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/LinXueyuanStdio","download_url":"https://codeload.github.com/LinXueyuanStdio/leetcode/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/LinXueyuanStdio%2Fleetcode/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":279000775,"owners_count":26082911,"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","status":"online","status_checked_at":"2025-10-09T02:00:07.460Z","response_time":59,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"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-practice","leetcode-python","leetcode-solutions"],"created_at":"2024-11-19T11:22:15.144Z","updated_at":"2025-10-09T03:07:38.024Z","avatar_url":"https://github.com/LinXueyuanStdio.png","language":"Python","readme":"# leetcode\npython solution for leetcode\n\n## 计划\n\n| 算法  | 大厂频率 | 其他厂频率 | 难度  | 建议刷题数 | 性价比 |\n| :--- | :------: | :--------: | :---: | :--------: | :----: |:----:|\n| 字符串、模拟法 |    高    |     高     |  低   |   20-50    |   中   |\n|     二分法     |    高    |     高     |  中   |   10-20    |   高   |\n|  二叉树、链表  |    高    |     高     |  低   |   30-50    |   高   |\n|   递归、DFS    |    高    |     高     |  高   |   20-40    |   中   |\n| BFS、拓扑排序  |    高    |     高     |  中   |   5-10    |   超高   |\n|  堆、优先队列  |    低    |     低     |  中   |   5-10    |   中   |\n|     哈希表     |    高    |     高     |  中   |   10-30    |   高   |\n|     双指针     |    高    |     高     |  中   |   10-20    |   高   |\n|    动态规划    |    中    |     低     |  高   |   40-60    |   低   |\n|     字典树     |    中    |     低     |  低   |   2-5    |   高   |\n|     并查集     |    低    |     无     |  低   |   2-5    |   高   |\n\n## 任务分解\n\n计划5月内把500题刷完，平均每月100题，每天3-4题。\n\n打卡\n\n## 刷题路径\n\n1. 复习一遍教材\n    1. 数组\n    2. 栈\n    3. 队列\n    4. 链表\n    5. 树\n    6. 图\n    7. 字母树\n    8. 哈希表\n2. 算法模板\n    1.","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Flinxueyuanstdio%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Flinxueyuanstdio%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Flinxueyuanstdio%2Fleetcode/lists"}