{"id":22941824,"url":"https://github.com/zacksleo/interview_code","last_synced_at":"2025-04-01T21:17:36.534Z","repository":{"id":75724912,"uuid":"173852373","full_name":"zacksleo/interview_code","owner":"zacksleo","description":"面试手写代码题目","archived":false,"fork":false,"pushed_at":"2019-03-04T10:06:27.000Z","size":141,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":3,"default_branch":"master","last_synced_at":"2025-02-07T13:47:58.021Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":false,"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/zacksleo.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,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2019-03-05T01:48:16.000Z","updated_at":"2019-03-05T01:48:18.000Z","dependencies_parsed_at":"2023-06-07T11:45:27.404Z","dependency_job_id":null,"html_url":"https://github.com/zacksleo/interview_code","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/zacksleo%2Finterview_code","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/zacksleo%2Finterview_code/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/zacksleo%2Finterview_code/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/zacksleo%2Finterview_code/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/zacksleo","download_url":"https://codeload.github.com/zacksleo/interview_code/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":246709913,"owners_count":20821298,"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":[],"created_at":"2024-12-14T13:45:08.570Z","updated_at":"2025-04-01T21:17:36.515Z","avatar_url":"https://github.com/zacksleo.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"\n\n\n\n# 1. 初级代码\n\n## 1.1. link_list 链表相关\n\n|题目| 链接 |\n|--|--|\n| 链表的反转（递归、非递归）| [reverse_link_list](https://github.com/Jarlonyan/interview_code/blob/master/link_list/reverse_link_list.cpp) |\n| 用户自定义链表 | [user_define_link_list](https://github.com/Jarlonyan/interview_code/blob/master/link_list/user_define_link_list.cpp) |\n\n\n## 1.2. sort_algorithms\n\n6个排序算法。冒泡、插入、选择、合并、快速、堆排序\n\n|题目| 链接 |\n|--|--|\n| 冒泡 | [bubble_sort](https://github.com/Jarlonyan/interview_code/blob/master/sort_algorithms/bubble_sort.cpp) |\n| 插入 | [insert_sort](https://github.com/Jarlonyan/interview_code/blob/master/sort_algorithms/insert_sort.cpp) |\n| 选择 | [select_sort](https://github.com/Jarlonyan/interview_code/blob/master/sort_algorithms/select_sort.cpp) |\n| 合并 | [merge_sort](https://github.com/Jarlonyan/interview_code/blob/master/sort_algorithms/merge_sort.cpp) |\n| 快速 | [quick_sort](https://github.com/Jarlonyan/interview_code/blob/master/sort_algorithms/quick_sort.cpp) |\n| 堆排序 | [heap_sort](https://github.com/Jarlonyan/interview_code/blob/master/sort_algorithms/heap_sort.cpp) |\n\n\n## 1.3. binary_tree 二叉树\n\n二叉树的很多题，本质上都是考察遍历算法\n\n|题目| 链接 |\n|--|--|\n| 构造二叉树 | [build_bin_tree](https://github.com/Jarlonyan/interview_code/blob/master/sort_algorithms/build_bin_tree.cpp) |\n| 遍历二叉树：递归、非递归、先序、中序、后序 | [traverse_bin_tree](https://github.com/Jarlonyan/interview_code/blob/master/sort_algorithms/traverse_bin_tree.cpp) |\n| 二叉树高度 | [height_bin_tree](https://github.com/Jarlonyan/interview_code/blob/master/sort_algorithms/height_bin_tree.cpp) |\n\n\n\n---------------\n\n# 2. 中级代码 \n\n## 2.1. dynamic_programming\n\n动态规划\n\n## 2.2. leetcode\n\nleetcode上的题目\n\n\n# 3. 公司面试题\n\n## tencent\n|||\n\n\n\n\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fzacksleo%2Finterview_code","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fzacksleo%2Finterview_code","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fzacksleo%2Finterview_code/lists"}