{"id":19226729,"url":"https://github.com/huichuanli/alogritme-interview","last_synced_at":"2025-08-19T06:34:38.271Z","repository":{"id":133419429,"uuid":"206583220","full_name":"HuichuanLI/alogritme-interview","owner":"HuichuanLI","description":null,"archived":false,"fork":false,"pushed_at":"2020-12-25T14:04:52.000Z","size":3873,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":0,"default_branch":"master","last_synced_at":"2025-06-06T17:43:31.515Z","etag":null,"topics":["greedy-algorithms","linked-list","recursion"],"latest_commit_sha":null,"homepage":null,"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/HuichuanLI.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-09-05T14:25:11.000Z","updated_at":"2020-12-25T14:04:54.000Z","dependencies_parsed_at":null,"dependency_job_id":"9da5b2a8-6725-4376-a933-cba490d4cdbf","html_url":"https://github.com/HuichuanLI/alogritme-interview","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/HuichuanLI/alogritme-interview","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/HuichuanLI%2Falogritme-interview","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/HuichuanLI%2Falogritme-interview/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/HuichuanLI%2Falogritme-interview/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/HuichuanLI%2Falogritme-interview/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/HuichuanLI","download_url":"https://codeload.github.com/HuichuanLI/alogritme-interview/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/HuichuanLI%2Falogritme-interview/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":271113465,"owners_count":24701609,"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-08-19T02:00:09.176Z","response_time":63,"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":["greedy-algorithms","linked-list","recursion"],"created_at":"2024-11-09T15:19:52.308Z","updated_at":"2025-08-19T06:34:38.261Z","avatar_url":"https://github.com/HuichuanLI.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"| ** 面试leetcode题目 **  | python |\n| :---  |  :--- |\n| ** 第一章 数组基础 **  | python |\n| 1-1 BinarySearch   |[python](./Chapter01_ArrayProblem/BinarySearch.py)|\n| 1-2 即使简单的问题，也有很多优化的思路 | 283 27 26 80 |\n| 1-3 三路快排partition思路的应用 Sort Color | 75 88 215 |\n| 1-4 对撞指针 Two Sum II - Input Array is Sorted | 167 125 344 345 11 |\n| 1-5 滑动窗口 Minimum Size Subarray Sum | 209 3 438 76 |\n| **第二章 查找表相关问题** | | |\n| 2-1 set的使用 Intersection of Two Arrays | 349 |\n| 2-2 map的使用 Intersection of Two Arrays II | 350 |\n| 2-3 set和map不同底层实现的区别 | 349 350 136 242 202 290 205 451 |\n| 2-4 使用查找表的经典问题 Two Sum | 1 15 18 16 \n| 2-5 灵活选择键值 4Sum II | 454  49 |\n| 2-6 灵活选择键值 Number of Boomerangs | 447  149 719 |\n| 2-7 查找表和滑动窗口 Contain Duplicate II | 219 |\n| 2-8 二分搜索树底层实现的顺序性 Contain Duplicate III | 220 |\n| **第三章 在链表中穿针引线** | | |\n| 3-1 链表，在节点间穿针引线 Reverse Linked List | 206  92 |\n| 3-2 测试你的链表程序 | 206 83 86 328 2 445 |\n| 3-3 设立链表的虚拟头结点 Remove Linked List Elements | 203  82 21 |\n| 3-4 复杂的穿针引线 Swap Nodes in Pairs | 24  25 147 148 |\n| 3-5 不仅仅是穿针引线 Delete Node in a Linked List | 237  |\n| 3-6 链表与双指针 Remove Nth Node Form End of List | 19  61 143 234 |\n| **第四章 栈、队列、优先队列** | | |\n| 6-1 栈的基础应用 Valid Parentheses | 20  150 71 |\n| 6-2 栈和递归的紧密关系 Binary Tree Preorder, Inorder and Postorder Traversal | 144 94 145 |\n| 6-3 运用栈模拟递归 | 144 94 145  341 |\n| 6-4 队列的典型应用 Binary Tree Level Order Traversal | 102  107 103 199 346 |\n| 6-5 BFS和图的最短路径 Perfect Squares | 279  127 126 286 |\n| 6-6 优先队列 | [无] | [无] |\n| 6-7 优先队列相关的算法问题 Top K Frequent Elements | 347  23 |\n| **第五章 二叉树和递归** | | \n| 7-1 二叉树天然的递归结构 | 104  111 |\n| 7-2 一个简单的二叉树问题引发的血案 Invert Binary Tree | 226  100 101 222 110 |\n| 7-3 注意递归的终止条件 Path Sum | 112  111 404 |\n| 7-4 定义递归问题 Binary Tree Path | 257  113 129 222 |\n| 7-5 稍复杂的递归逻辑 Path Sum III | 437  |\n| 7-6 二分搜索树中的问题 Lowest Common Ancestor of a Binary Search Tree | 783 235  98 450 108 230 236 530 |\n| **第六章 递归和回溯法** | | | | |\n| 8-1 树形问题 Letter Combinations of a Phone Number | 17 | [无] \n| 8-2 什么是回溯 | 17  93 131 |\n| 8-3 排列问题 Permutations | 46  47| \n| 8-4 组合问题 Combinations | 77 | [无] |\n| 8-5 回溯法解决组合问题的优化 | 77  39 40 216 78 90 401 |\n| 8-6 二维平面上的回溯法 Word Search | 79 | [无] |\n| 8-7 floodfill算法，一类经典问题 Number of Islands | 200  130 417 |\n| 8-8 回溯法是经典人工智能的基础 N Queens | 51  52 37 |\n| **第七章 动态规划基础** | | |\n| 9-1 什么是动态规划 | [无] | [无] |\n| 9-2 第一个动态规划问题 Climbing Stairs | 70 120 64 |\n| 9-3 发现重叠子问题 Integer Break | 343  279 91 62 63 |\n| 9-4 状态的定义和状态转移 House Robber | 198  213 337 309 |\n| 9-5 0-1背包问题 | [无] | [无] |\n| 9-6 0-1背包问题的优化和变种 | [无] | [无] |\n| 9-7 面试中的0-1背包问题 Partition Equal Subset Sum | 416  322 377 474 139 494 |\n| 9-8 LIS问题 Longest Increasing Subsequence | 300  376 |\n| 9-9 LCS，最短路，求动态规划的具体解以及更多 | [无] | [无] |\n| **第八章 贪心算法** | | |\n| 10-1 贪心基础 Assign Cookies | 455  392 |\n| 10-2 贪心算法与动态规划的关系 Non-overlapping Intervals | 435 | [无] |\n| 10-3 贪心选择性质的证明 | [无] | [无] |","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhuichuanli%2Falogritme-interview","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fhuichuanli%2Falogritme-interview","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhuichuanli%2Falogritme-interview/lists"}