{"id":13398689,"url":"https://github.com/azl397985856/leetcode","last_synced_at":"2025-05-12T20:42:41.084Z","repository":{"id":37270646,"uuid":"127407957","full_name":"azl397985856/leetcode","owner":"azl397985856","description":"LeetCode Solutions: A Record of My Problem Solving Journey.( leetcode题解，记录自己的leetcode解题之路。)","archived":false,"fork":false,"pushed_at":"2025-02-22T08:07:33.000Z","size":126557,"stargazers_count":55296,"open_issues_count":11,"forks_count":9483,"subscribers_count":1328,"default_branch":"master","last_synced_at":"2025-05-05T16:05:07.863Z","etag":null,"topics":["algo","algorithm","algorithms","algorithms-datastructures","computer-science","cpp","data-structures","interview","java","javascript","leetcode","leetcode-solutions","python","tree"],"latest_commit_sha":null,"homepage":"https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/","language":"JavaScript","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"other","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/azl397985856.png","metadata":{"files":{"readme":"README.en.md","changelog":null,"contributing":"CONTRIBUTING.en.md","funding":".github/FUNDING.yml","license":"LICENSE.txt","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},"funding":{"patreon":"fe_lucifer"}},"created_at":"2018-03-30T09:13:51.000Z","updated_at":"2025-05-05T11:38:31.000Z","dependencies_parsed_at":"2023-02-15T16:16:11.901Z","dependency_job_id":"2df33e67-fdc0-415c-87fe-286cba130d78","html_url":"https://github.com/azl397985856/leetcode","commit_stats":null,"previous_names":[],"tags_count":41,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/azl397985856%2Fleetcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/azl397985856%2Fleetcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/azl397985856%2Fleetcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/azl397985856%2Fleetcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/azl397985856","download_url":"https://codeload.github.com/azl397985856/leetcode/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":253818036,"owners_count":21969097,"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":["algo","algorithm","algorithms","algorithms-datastructures","computer-science","cpp","data-structures","interview","java","javascript","leetcode","leetcode-solutions","python","tree"],"created_at":"2024-07-30T19:00:30.609Z","updated_at":"2025-05-12T20:42:41.025Z","avatar_url":"https://github.com/azl397985856.png","language":"JavaScript","readme":"# LeetCode\n\n[![Travis](https://p.ipic.vip/hnzzr3.jpg)]() [![Travis](https://p.ipic.vip/3zihse.jpg)]() [![Travis](https://p.ipic.vip/hh8zzk.jpg)]() [![Travis](https://p.ipic.vip/gd28pb.jpg)]() ![Total visitor](https://visitor-count-badge.herokuapp.com/total.svg?repo_id=azl397985856.leetcode.en) ![Visitors in today](https://visitor-count-badge.herokuapp.com/today.svg?repo_id=azl397985856.leetcode.en)\n\n\u003e since 2019-09-03 19:40\n\n[简体中文](./README.md) | English\n\n---\n\n![leetcode.jpeg](https://p.ipic.vip/u6nhhh.jpg)\n\nThis essay records the course of and my emotion to this project from initialization to 10,000 stars. [Milestone for 10,000+ stars](./thanksGiving.md)\n\nIf you are interested in this project, **do not mean your star**. This project will be **supported for a long enough time** by the community. Thanks for every audience and contributor.\n\n## Introduction\n\n![leetcode.jpeg](https://p.ipic.vip/u6nhhh.jpg)\n\nLeetCode Solutions: A Journey of Problem Solving.\n\nThis repository is divided into five parts for now:\n\n- The first part is the solutions to some classic problems on LeetCode, including the idea thinkings, key points and code implementations.\n\n- The second part is a summary of data structures and algorithms.\n\n- The third part is [Anki flashcards](https://apps.ankiweb.net) that organizes the LeetCode problems in a certain way to make it easier to remember.\n\n- The fourth part is daily challenges which were held at group chat. We usually solve one problem altogether to get more feedback. Moreover, the problems can be drafted to add to the problem solving module.\n\n- The fifth part is a future planning on content that will be introduced into the above parts.\n\n\u003e Only when having mastered the basic data structures and algorithms can you solve complex problems easily.\n\n## About me\n\nI, a programmer, am all passionate about technology.\n\nUsed to write `.net` and `Java`, I am a frontend engineer and focused on the engineering, optimization and standardization for frontend.\n\nIf you want to do some contributions or collaborations, just feel free to contact me via [azl397985856@gmail.com].\n\n## Usage Instructions\n\n- For the parts that were added recently, there will be a behind.\n- For the parts that were updated recently, there will be a 🖊 behind.\n- Here will be the place to update Anki Flashcards in the future as well.\n- Here is a mind mapping graph showing the summary of categorizations of problems that are questioned frequently in interviews. We could analyze according to the information in the graph.\n\n![leetcode-zhihu](https://p.ipic.vip/58vm3a.jpg)\n\n(Picture credited by [LeetCode-cn](https://www.zhihu.com/question/24964987/answer/586425979).)\n\nThe algorithms mainly include:\n\n- Basic skills: Divide-and-Conquer; Binary; Greedy\n- Sorting algorithms: Quicksort; Merge Sort; Counting Sort\n- Searching algorithms: Backtracking; Recursion; Depth-First-Search (DFS); Breath-First-Search (BFS); Binary Search Tree; etc.\n- Graph theory: Shortest Path Problem; Minimal Spanning Tree\n- Dynamic Programming: Knapsack Problem; Longest Common Subsequence (LCS) Problem\n\nThe data structures mainly include:\n\n- Array and linked list: Singly/Doubly-Linked List\n- Stack and queue\n- Hash table\n- Heap: Min-Max Heap\n- Tree and Graph: Lowest Common Ancestor (LCA); Disjoint-Set\n- String: Prefix Tree (Trie); Suffix Tree\n\n## Previews (Translation in Progress)\n\n[0547.friend-circles](./problems/547.friend-circles-en.md) :\n\n![friend circle BFS](https://p.ipic.vip/5gg5y0.jpg)\n\n[backtrack problems](./problems/90.subsets-ii-en.md):\n\n![backtrack](https://p.ipic.vip/w5g03x.jpg)\n\n[0454.4-sum-ii](./problems/454.4-sum-ii.en.md) :\n\n![454.4-sum-ii](https://p.ipic.vip/vaniw4.jpg)\n\n## Portals\n\n### Solutions to LeetCode Classic Problems\n\n\u003e Here only lists some **representative problems** but not all.\n\n#### Easy\n\n- [Easy Collection](https://github.com/azl397985856/leetcode/blob/master/collections/easy.en.md)\n\n#### Medium (Translation in Progress)\n\n- [0002. Add Two Numbers](./problems/2.add-two-numbers.en.md)\n- [0078.subsets](./problems/78.subsets-en.md)\n- [0079.word-search](./problems/79.word-search-en.md)\n- [0086.partition-list](./problems/86.partition-list.md)\n- [0090.subsets-ii](./problems/90.subsets-ii-en.md)\n\n* [0474.ones-and-zeros](./problems/474.ones-and-zeros-en.md)\n\n* [0547.friend-circles](./problems/547.friend-circles-en.md)\n* [0560.subarray-sum-equals-k](./problems/560.subarray-sum-equals-k.en.md)\n\n* [1011.capacity-to-ship-packages-within-d-days](./problems/1011.capacity-to-ship-packages-within-d-days-en.md)\n\n* [1371.find-the-longest-substring-containing-vowels-in-even-counts](./problems/1371.find-the-longest-substring-containing-vowels-in-even-counts.en.md)\n\n#### Hard (Translation in Progress)\n\n- [0025.reverse-nodes-in-k-group](./problems/25.reverse-nodes-in-k-groups-en.md)\n- [0042.trapping-rain-water](./problems/42.trapping-rain-water.en.md)🆕\n- [1168.optimize-water-distribution-in-a-village](./problems/1168.optimize-water-distribution-in-a-village-en.md)\n\n### Summary of Data Structures and Algorithm\n\n- [Basic data structure (overview)](./thinkings/basic-data-structure.en.md)\n- [I have almost finished brushing all the linked topics of Lixu, and I found these things. 。 。](./thinkings/linked-list.en.md)\n- [I have almost finished brushing all the tree questions of Lixu, and I found these things. 。 。](./thinkings/tree.en.md)\n- [堆专题（上）](./thinkings/heap.en.md) (WIP)\n- [I have almost finished brushing all the piles of questions, and I found these things. 。 。 (Second bullet)](./thinkings/heap-2.en.md)\n- [I have almost finished brushing all the two-point questions of Lixiu, and I found these things. 。 。 (Part 1)](./thinkings/binary-search-1.en.md)\n- [I have almost finished brushing all the two-point questions of Lixiu, and I found these things. 。 。 (Part 2)](./thinkings/binary-search-2.en.md)\n\n\u003c!-- - [基础算法](./thinkings/basic-algorithm.md) --\u003e\n\n- [Dynamic Programming](./thinkings/dynamic-programming.en.md)\n- [Search Problems](./thinkings/search.en.md)\n- [Binary Tree Traversal](./thinkings/binary-tree-traversal.en.md)\n- [Backtracking](./thinkings/backtrack.en.md)\n- [Run code and Huffman code](./thinkings/run-length-encode-and-huffman-encode.en.md)\n- [Bloom filter](./thinkings/bloom-filter.en.md)🖊\n- [Trie](./thinkings/trie.en.md)🖊\n- [滑动窗口（思路 + 模板）](./thinkings/slide-window.en.md) (WIP)\n- [Bit Operation](./thinkings/bit.en.md)\n- [Kojima Question](./thinkings/island.en.md)🖊\n- [GCD Problems](./thinkings/GCD.en.md)\n- [Union Find (Disjoint Set) Problem](./thinkings/union-find.en.md)\n- [Balanced Binary Tree](./thinkings/balanced-tree.en.md)\n- [Reservoir Sampling](./thinkings/reservoid-sampling.en.md)\n- [Monotonic stack](./thinkings/monotone-stack.en.md)\n\n### Anki Flashcards\n\nAnki falshcards would be mainly two parts: the mappings from key points to problems; the mappings from problems to idea thinks, key points and code implementations.\n\nAll flashcards are put in [anki-card](./assets/anki/leetcode.apkg).\n\n\u003e Please check [here](https://apps.ankiweb.net/) for more about the usage of Anki.\n\nLatest updated flashcards (only lists the front page):\n\n- What is the key point of the binary search algorithm? Related problems?\n- How to simplify the operations using the features of stacks? Related problems?\n- The thinkings and related problems of double-pointers problems?\n- The thinkings and related problems of sliding window problems?\n- The thinkings and related problems of backtracking?\n- The thinkings and related problems of number theory?\n- The thinkings and related problems of bit operations?\n\n\u003e WIP: the translation of the flashcards are on the way.\n\n\u003e problems added：#2 #3 #11\n\n## Community Chat Groups\n\nWe're still on the early stage, so feedback from community is very welcome. For sake of reducing the costs of communication, I created some chat groups.\n\n### Telegram\n\n[http://t.me/leetcode_intl](http://t.me/leetcode_intl)\n\n### QQ (For China Region)\n\n![qq-group-chat](https://p.ipic.vip/k88y70.jpg)\n\n### WeChat (For China Region)\n\n![wechat-group-chat](https://p.ipic.vip/d621ys.jpg)\n\n(Add this bot and reply \"leetcode\" to join the group.)\n\n## Contribution\n\n- If you have any ideas, [Issues](https://github.com/azl397985856/leetcode/issues) or chat in groups.\n- If you want to commit to the repository, Pull Request is welcome. Here is the [CONTRIBUTION GUIDE](./CONTRIBUTING.en.md)\n- If you want to edit images resources in this project, [here](./assets/drawio/) lists the files that can be edited on [draw.io](https://www.draw.io/).\n\n## Thank you\n\nA big Thank you to every [contributor](https://github.com/azl397985856/leetcode/graphs/contributors) of this project.\n\n## License\n\n[Apache-2.0](./LICENSE.txt)\n","funding_links":["https://patreon.com/fe_lucifer"],"categories":["Online Programming Learning Websites","算法","algorithm","JavaScript","目录","计算机编程 数据结构与算法","数据结构与算法","Others","C/C++","Github","🛅算法","Code","Math / Algorithm","武器库"],"sub_categories":["[leetcode](https://leetcode.com)","网络服务_其他","3. Course and Code","其他书籍汇总：","zsh 插件","library/repositories","算法"],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fazl397985856%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fazl397985856%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fazl397985856%2Fleetcode/lists"}