{"id":15030639,"url":"https://github.com/doocs/coding-interview","last_synced_at":"2025-05-14T05:10:47.697Z","repository":{"id":39351470,"uuid":"154913182","full_name":"doocs/coding-interview","owner":"doocs","description":"😀 代码面试题集，包括剑指 Offer、编程之美等","archived":false,"fork":false,"pushed_at":"2025-04-23T12:53:53.000Z","size":11709,"stargazers_count":2229,"open_issues_count":1,"forks_count":534,"subscribers_count":70,"default_branch":"main","last_synced_at":"2025-05-08T18:44:01.750Z","etag":null,"topics":["algorithms","coding-interviews","doocs","notes","offer"],"latest_commit_sha":null,"homepage":"https://interview.doocs.org","language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"cc-by-sa-4.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/doocs.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,"zenodo":null},"funding":{"github":null,"patreon":null,"open_collective":"doocs","ko_fi":null,"tidelift":null,"community_bridge":null,"liberapay":null,"issuehunt":null,"otechie":null,"custom":null}},"created_at":"2018-10-27T01:50:49.000Z","updated_at":"2025-05-07T14:52:30.000Z","dependencies_parsed_at":"2023-12-25T21:44:28.320Z","dependency_job_id":"e3de898b-6873-40b6-a471-85eb97eeb583","html_url":"https://github.com/doocs/coding-interview","commit_stats":{"total_commits":204,"total_committers":6,"mean_commits":34.0,"dds":"0.12745098039215685","last_synced_commit":"56cccf0e5296c03849d313a327a9c7b7fcb87be7"},"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/doocs%2Fcoding-interview","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/doocs%2Fcoding-interview/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/doocs%2Fcoding-interview/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/doocs%2Fcoding-interview/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/doocs","download_url":"https://codeload.github.com/doocs/coding-interview/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":254076850,"owners_count":22010611,"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","coding-interviews","doocs","notes","offer"],"created_at":"2024-09-24T20:13:56.151Z","updated_at":"2025-05-14T05:10:47.646Z","avatar_url":"https://github.com/doocs.png","language":"Java","funding_links":["https://opencollective.com/doocs"],"categories":[],"sub_categories":[],"readme":"# 互联网公司 IT 技术面试题集\n\n[![license](https://badgen.net/github/license/doocs/leetcode?color=green)](https://github.com/doocs/coding-interview/blob/main/LICENSE)\n[![stars](https://badgen.net/github/stars/doocs/coding-interview)](https://github.com/doocs/coding-interview/stargazers)\n[![issues](https://badgen.net/github/open-issues/doocs/coding-interview)](https://github.com/doocs/coding-interview/issues)\n[![forks](https://img.shields.io/github/forks/doocs/coding-interview.svg)](https://github.com/doocs/coding-interview/network/members)\n[![PRs Welcome](https://badgen.net/badge/PRs/welcome/green)](http://makeapullrequest.com)\n\n## 项目介绍\n\n本仓库用于记录各大互联网公司 IT 技术面试高频题以及经典书籍读书笔记，包括《剑指 Offer》、《编程之美》、《代码整洁之道》等，抽空更新中。\n\n## 站点\n\nhttps://interview.doocs.org\n\n## 书籍笔记\n\n### [《剑指 Offer》](/docs/coding-interview.md)\n\n这本书选取的[题目](/docs/coding-interview.md)都是被各大公司面试官反复采用的编程题，极具实战意义。当然，如果一开始觉得这些题目比较难，也是很正常的，因为大公司的面试本身就不简单。我们逐步掌握书中总结的解题方法之后，再去面试大公司，将会轻松很多。\n\n推荐三个在线刷《剑指 Offer》的平台，个人比较倾向于 [LeetCode 中国](https://leetcode.cn/problemset/lcof/) 。\n\n- [LeetCode 中国](https://leetcode.cn/problemset/lcof/)：近期上线，支持多种编程语言，墙裂推荐。\n- [AcWing](https://www.acwing.com/problem/)：支持 Java11。团队成员来自北大清华，剑指 Offer 第二版题目都有。\n- [NowCoder](https://www.nowcoder.com/ta/coding-interviews)：这个应该大多数人都知道，但是没有剑指 Offer 第二版新增的题目。\n\n### [《代码整洁之道》](/docs/clean-code.md)\n\n这本书名为 _Clean Code_，乃是 Object Mentor（鲍勃大叔开办的技术咨询和培训公司）一干大牛在编程方面的经验累积。写整洁代码，需要遵循大量的小技巧，贯彻刻苦习得的“整洁感”。\n\n作者 Robert C. Martin 在书中阐述了代码各个方面如何做到整洁的经验与最佳实践。我们若能长期遵照这些经验编写代码，所谓“代码感”也就自然而然滋生出来。\n\n### [《阿里巴巴 Java 开发手册》](/docs/effective-coding.md)\n\n别人都说我们是搬砖的码农，但我们知道自己是追求个性的艺术家。也许我们不会过多在意自己的外表和穿着，但在我们不羁的外表下，骨子里追求着代码的美、系统的美、设计的美，代码规范其实就是一个对程序美的定义。\n\n### [《枕边算法书》](/docs/algorithm-stories.md)\n\n这本书，我是把它当作一本故事书来读的，里面的部分知识点还挺有意思。\n\n### [《Effective Java》](/docs/effective-java.md)\n\n这本书共包含了 78 个条目，每个条目讨论一条规则。它适用于任何具有实际 Java 工作经验的工程师，对于高级工程师，也能够提供一些发人深思的东西，是所有 Java 工程师必读书籍之一。\n\n---\n\n## Doocs 社区优质项目\n\nDoocs 技术社区，致力于打造一个内容完整、持续成长的互联网开发者学习生态圈！以下是 Doocs 旗下的一些优秀项目，欢迎各位开发者朋友持续保持关注。\n\n| #   | 项目                                                              | 描述                                                                                             | 热度                                                                                                                            |\n| --- | ----------------------------------------------------------------- | ------------------------------------------------------------------------------------------------ | ------------------------------------------------------------------------------------------------------------------------------- |\n| 1   | [advanced-java](https://github.com/doocs/advanced-java)           | 互联网 Java 工程师进阶知识完全扫盲：涵盖高并发、分布式、高可用、微服务、海量数据处理等领域知识。 | ![](https://badgen.net/github/stars/doocs/advanced-java) \u003cbr\u003e![](https://badgen.net/github/forks/doocs/advanced-java)           |\n| 2   | [leetcode](https://github.com/doocs/leetcode)                     | 多种编程语言实现 LeetCode、《剑指 Offer（第 2 版）》、《程序员面试金典（第 6 版）》题解。        | ![](https://badgen.net/github/stars/doocs/leetcode) \u003cbr\u003e![](https://badgen.net/github/forks/doocs/leetcode)                     |\n| 3   | [source-code-hunter](https://github.com/doocs/source-code-hunter) | 互联网常用组件框架源码分析。                                                                     | ![](https://badgen.net/github/stars/doocs/source-code-hunter) \u003cbr\u003e![](https://badgen.net/github/forks/doocs/source-code-hunter) |\n| 4   | [jvm](https://github.com/doocs/jvm)                               | Java 虚拟机底层原理知识总结。                                                                    | ![](https://badgen.net/github/stars/doocs/jvm) \u003cbr\u003e![](https://badgen.net/github/forks/doocs/jvm)                               |\n| 5   | [coding-interview](https://github.com/doocs/coding-interview)     | 代码面试题集，包括《剑指 Offer》、《编程之美》等。                                               | ![](https://badgen.net/github/stars/doocs/coding-interview) \u003cbr\u003e![](https://badgen.net/github/forks/doocs/coding-interview)     |\n| 6   | [md](https://github.com/doocs/md)                                 | 一款高度简洁的微信 Markdown 编辑器。                                                             | ![](https://badgen.net/github/stars/doocs/md) \u003cbr\u003e![](https://badgen.net/github/forks/doocs/md)                                 |\n| 7   | [technical-books](https://github.com/doocs/technical-books)       | 值得一看的技术书籍列表。                                                                         | ![](https://badgen.net/github/stars/doocs/technical-books) \u003cbr\u003e![](https://badgen.net/github/forks/doocs/technical-books)       |\n\n## 贡献者\n\n感谢以下所有朋友对 [Doocs 技术社区](https://github.com/doocs) 所做出的贡献，[参与项目维护请戳这儿](https://doocs.github.io/#/?id=how-to-join)。\n\n\u003c!-- ALL-CONTRIBUTORS-LIST: START - Do not remove or modify this section --\u003e\n\n\u003ca href=\"https://opencollective.com/doocs/contributors.svg?width=890\u0026button=true\"\u003e\u003cimg src=\"https://opencollective.com/doocs/contributors.svg?width=890\u0026button=false\" /\u003e\u003c/a\u003e\n\n\u003c!-- ALL-CONTRIBUTORS-LIST: END --\u003e\n\n## 公众号\n\n[Doocs](https://github.com/doocs) 技术社区旗下唯一公众号「**Doocs**」​，欢迎扫码关注，**专注分享技术领域相关知识及行业最新资讯**。当然，也可以加我个人微信（备注：GitHub），拉你进技术交流群。\n\n\u003ctable\u003e\n  \u003ctr\u003e\n    \u003ctd align=\"center\" style=\"width: 260px;\"\u003e\n      \u003cimg src=\"https://cdn-doocs.oss-cn-shenzhen.aliyuncs.com/gh/doocs/images/qrcode-for-doocs.png\" style=\"width: 400px;\"\u003e\u003cbr\u003e\n    \u003c/td\u003e\n    \u003ctd align=\"center\" style=\"width: 260px;\"\u003e\n      \u003cimg src=\"https://cdn-doocs.oss-cn-shenzhen.aliyuncs.com/gh/doocs/images/qrcode-for-yanglbme.png\" style=\"width: 400px;\"\u003e\u003cbr\u003e\n    \u003c/td\u003e\n  \u003c/tr\u003e\n\u003c/table\u003e\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdoocs%2Fcoding-interview","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fdoocs%2Fcoding-interview","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdoocs%2Fcoding-interview/lists"}