{"id":13901227,"url":"https://github.com/NLP-LOVE/CodingInterviews2-ByPython","last_synced_at":"2025-07-17T21:32:41.572Z","repository":{"id":49807086,"uuid":"204951309","full_name":"NLP-LOVE/CodingInterviews2-ByPython","owner":"NLP-LOVE","description":"此项目是《剑指offer》第二版里算法面试题的Python3实现版本，作为一本经典书籍，可以时常拿出来看一看、翻一翻、记一记。同时也是为了Python程序员能够更好的通过公司的技术面试，拿到心仪的offer。","archived":false,"fork":false,"pushed_at":"2021-03-29T06:49:33.000Z","size":267,"stargazers_count":121,"open_issues_count":0,"forks_count":67,"subscribers_count":6,"default_branch":"master","last_synced_at":"2024-11-19T13:54:17.765Z","etag":null,"topics":["algorithm","interview-questions","offer","python"],"latest_commit_sha":null,"homepage":"http://mantchs.com/","language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/NLP-LOVE.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2019-08-28T14:27:35.000Z","updated_at":"2024-06-18T14:20:27.000Z","dependencies_parsed_at":"2022-09-24T11:00:19.760Z","dependency_job_id":null,"html_url":"https://github.com/NLP-LOVE/CodingInterviews2-ByPython","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/NLP-LOVE%2FCodingInterviews2-ByPython","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/NLP-LOVE%2FCodingInterviews2-ByPython/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/NLP-LOVE%2FCodingInterviews2-ByPython/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/NLP-LOVE%2FCodingInterviews2-ByPython/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/NLP-LOVE","download_url":"https://codeload.github.com/NLP-LOVE/CodingInterviews2-ByPython/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":226305279,"owners_count":17603782,"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":["algorithm","interview-questions","offer","python"],"created_at":"2024-08-06T21:01:01.959Z","updated_at":"2024-11-25T09:31:05.308Z","avatar_url":"https://github.com/NLP-LOVE.png","language":"Python","readme":"## 项目介绍\n\n- 此项目是《剑指offer》第二版里算法面试题的Python3实现版本。\n- 包括数组、字符串、链表、树、栈、队列和哈希表等数据结构的面试题。\n- 查找、排序、动态规划、贪心等算法题。\n- 收录的都是各大公司常考的题目。\n\n扎实的基本功是成为优秀程序员的前提条件，而这些体现在编程语言、数据结构和算法上，这也是此项目的初衷。帮助自己的同时也帮助各位同学在各自的道路上能够走得更远。\n\n**有意向一起完成此项目或者有问题、有补充的可以加入《剑指offer》讨论群【818185620】\u003ca target=\"_blank\" href=\"//shang.qq.com/wpa/qunwpa?idkey=8c188e86e0eac4a214861c2c706a9c0baf75176e16e52f07b8a64d1a13f99a0d\"\u003e\u003cimg border=\"0\" src=\"http://pub.idqqimg.com/wpa/images/group.png\" alt=\"《剑指offer》讨论群\" title=\"《剑指offer》讨论群\"\u003e\u003c/a\u003e**\n\n- **请关注 AIArea 公众号：算法工程师**\n\n- ![](https://github.com/NLP-LOVE/Introduction-NLP/raw/master/img/2020-2-3_16-0-25.png?raw=true)\n\n\n## 目录\n\n**项目持续更新中......**\n\n| 类型     | 题型                                                         |\n| -------- | ------------------------------------------------------------ |\n| 数据结构 | [Interview-3：数组中重复的数字](https://github.com/NLP-LOVE/CodingInterviews2-ByPython/blob/master/Algorithm/Interview-3.md) |\n| 数据结构 | [Interview-4：二维数组中的查找](https://github.com/NLP-LOVE/CodingInterviews2-ByPython/blob/master/Algorithm/Interview-4.md) |\n| 数据结构 | [Interview-5：字符串替换空格](https://github.com/NLP-LOVE/CodingInterviews2-ByPython/blob/master/Algorithm/Interview-5.md) |\n| 数据结构 | [Interview-6：从尾到头打印链表](https://github.com/NLP-LOVE/CodingInterviews2-ByPython/blob/master/Algorithm/Interview-6.md) |\n| 数据结构 | [Interview-7：重建二叉树](https://github.com/NLP-LOVE/CodingInterviews2-ByPython/blob/master/Algorithm/Interview-7.md) |\n| 数据结构 | [Interview-8：二叉树中序遍历的下一个节点](https://github.com/NLP-LOVE/CodingInterviews2-ByPython/blob/master/Algorithm/Interview-8.md) |\n| 数据结构 | [Interview-9：用两个栈实现队列](https://github.com/NLP-LOVE/CodingInterviews2-ByPython/blob/master/Algorithm/Interview-9.md) |\n| 数据结构 | [Interview-10：斐波那契数列](https://github.com/NLP-LOVE/CodingInterviews2-ByPython/blob/master/Algorithm/Interview-10.md) |\n| 数据结构 | [Inverview-59：队列的最大值](https://github.com/NLP-LOVE/CodingInterviews2-ByPython/blob/master/Algorithm/Inverview-59.md) |\n| 数据结构 | [Inverview-62：圆圈中最后剩下的数字](https://github.com/NLP-LOVE/CodingInterviews2-ByPython/blob/master/Algorithm/Interview-62.md) |\n| 查找     | [LeetCode-704：二分查找](https://github.com/NLP-LOVE/CodingInterviews2-ByPython/blob/master/Algorithm/LeetCode-704_binary_search.md) |\n\n\n\n\n\n\n\n\n\n\n\n","funding_links":[],"categories":["Python"],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2FNLP-LOVE%2FCodingInterviews2-ByPython","html_url":"https://awesome.ecosyste.ms/projects/github.com%2FNLP-LOVE%2FCodingInterviews2-ByPython","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2FNLP-LOVE%2FCodingInterviews2-ByPython/lists"}