{"id":16574878,"url":"https://github.com/matnoble/leetcode","last_synced_at":"2025-04-04T22:23:50.259Z","repository":{"id":159135799,"uuid":"327245028","full_name":"MatNoble/leetcode","owner":"MatNoble","description":"leetcode python3 solutions","archived":false,"fork":false,"pushed_at":"2023-06-29T16:33:21.000Z","size":119,"stargazers_count":2,"open_issues_count":4,"forks_count":0,"subscribers_count":2,"default_branch":"main","last_synced_at":"2025-02-10T07:12:41.329Z","etag":null,"topics":["algorithms","leetcode","leetcode-python3-solutions"],"latest_commit_sha":null,"homepage":"https://github.com/MatNoble/leetcode","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/MatNoble.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":"2021-01-06T08:16:57.000Z","updated_at":"2023-06-29T16:33:26.000Z","dependencies_parsed_at":"2024-12-18T02:43:06.125Z","dependency_job_id":"316d0cfb-c4a7-4fed-9798-c52915b8407e","html_url":"https://github.com/MatNoble/leetcode","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/MatNoble%2Fleetcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MatNoble%2Fleetcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MatNoble%2Fleetcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MatNoble%2Fleetcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/MatNoble","download_url":"https://codeload.github.com/MatNoble/leetcode/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247256973,"owners_count":20909382,"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","leetcode","leetcode-python3-solutions"],"created_at":"2024-10-11T21:45:55.199Z","updated_at":"2025-04-04T22:23:50.242Z","avatar_url":"https://github.com/MatNoble.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"## Leetcode Python3 solutions \n\u003e [![](https://img.shields.io/badge/Author-MatNoble-orange)]((https://matnoble.me)) ![png](https://img.shields.io/badge/language-Python%203-blue) ![](https://img.shields.io/badge/LeetCode-232%2F2021-brightgreen) ![](https://img.shields.io/badge/%E5%89%91%E6%8C%87offer-43%2F75-green)\n\n- [剑指 Offer](./剑指offer/README.md)\n- [LeetCode 题解及思路](https://matnoble.github.io/tags/%E7%BC%96%E7%A8%8B%E5%88%B7%E9%A2%98/)\n\n---\n### Tips\n\nAdvising add the extension of [HTML5 Outliner](https://chrome.google.com/webstore/detail/html5-outliner/afoibpobokebhgfnknfndkgemglggomo) to your Chrome to view a table of contents.\nAdvicing add \n\n\u003cimg src=\"https://cdn.jsdelivr.net/gh/MatNoble/Images/20210126180354.png\"/\u003e\n\n---\n\n### Recursion\n\n[Basic](https://github.com/MatNoble/leetcode/blob/main/LeetCodeSolutions/Data%20Structures%20and%20Algorithms/recursion.py)\n\n#### Reverse Linked Lists\n\n| Question Number| Official Website Link | Solution's Link |\n|:-:|-|-|\n| 025 | [reverse nodes in k group](https://leetcode-cn.com/problems/reverse-nodes-in-k-group/) |  [hard](https://github.com/MatNoble/leetcode/blob/main/Data%20Structures%20and%20Algorithms/reverse-linked-list.py) |\n| 092 | [reverse linked list II](https://leetcode-cn.com/problems/reverse-linked-list-ii/) |  [medium](https://github.com/MatNoble/leetcode/blob/main/Data%20Structures%20and%20Algorithms/reverse-linked-list.py) |\n|206| [reverse linked list](https://leetcode-cn.com/problems/reverse-linked-list/) | [easy](https://github.com/MatNoble/leetcode/blob/main/Data%20Structures%20and%20Algorithms/reverse-linked-list.py) |\n|234|[palindrome linked list](https://leetcode-cn.com/problems/palindrome-linked-list/)|[easy](https://github.com/MatNoble/leetcode/blob/main/Data%20Structures%20and%20Algorithms/palindrome_linked_list.py)|\n\n#### Binary Tree\n| Question Number| Official Website Link | Solution's Link |\n|:-:|-|-|\n|105| [construct binary tree from preorder and inorder traversal](https://leetcode-cn.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/) | [medium](https://github.com/MatNoble/leetcode/blob/main/LeetCodeSolutions/105.py) |\n|106|[construct binary tree from inorder and postorder traversal](https://leetcode-cn.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/) | [medium](https://github.com/MatNoble/leetcode/blob/main/LeetCodeSolutions/106.py) |\n|654| [maximum binary tree](https://leetcode-cn.com/problems/maximum-binary-tree/) | [medium](https://github.com/MatNoble/leetcode/blob/main/LeetCodeSolutions/654.py) |\n\n--- \n\n### Math\n\n1. [Binary Exponentiation](https://github.com/MatNoble/leetcode/blob/main/LeetCodeSolutions/050.py)\n\n---\n\n### Two Pointers\n\n| Question Number| Official Website Link | Solution's Link |\n|:-:|-|-|\n|005| [longest palindromic substring](https://leetcode-cn.com/problems/longest-palindromic-substring/) | [medium](https://github.com/MatNoble/leetcode/blob/main/LeetCodeSolutions/005.py) |\n|011| [container with most water](https://leetcode-cn.com/problems/container-with-most-water/) | [medium](https://github.com/MatNoble/leetcode/blob/main/LeetCodeSolutions/011.py) |\n| 026 | [remove duplicates from sorted array](https://leetcode-cn.com/problems/remove-duplicates-from-sorted-array/) |  [easy](https://github.com/MatNoble/leetcode/blob/main/LeetCodeSolutions/026.py) |\n| 042 | [trapping rain water](https://leetcode-cn.com/problems/trapping-rain-water/) |  [hard](https://github.com/MatNoble/leetcode/blob/main/LeetCodeSolutions/042.py) |\n|076|[minimum window substring](https://leetcode-cn.com/problems/minimum-window-substring/)|[hard](https://github.com/MatNoble/leetcode/blob/main/LeetCodeSolutions/076.py)|\n| 141 | [linked list cycle](https://leetcode-cn.com/problems/linked-list-cycle/) |  [easy](https://github.com/MatNoble/leetcode/blob/main/LeetCodeSolutions/141.py) |\n| 142 | [linked list cycle ii](https://leetcode-cn.com/problems/linked-list-cycle-ii/) |  [medium](https://github.com/MatNoble/leetcode/blob/main/LeetCodeSolutions/142.py) |\n|189|[rotate array](https://leetcode-cn.com/problems/rotate-array/)| [medium](https://github.com/MatNoble/leetcode/blob/main/LeetCodeSolutions/026.py)|\n| 283 | [move zeros](https://leetcode-cn.com/problems/move-zeroes/) | [easy](https://github.com/MatNoble/leetcode/blob/main/LeetCodeSolutions/283.py)|\n| 287 | [find the duplicate number](https://leetcode-cn.com/problems/find-the-duplicate-number/) | [medium](https://github.com/MatNoble/leetcode/blob/main/LeetCodeSolutions/287.py)|\n| 344 | [reverse string](https://leetcode-cn.com/problems/reverse-string/) | [easy](https://github.com/MatNoble/leetcode/blob/main/LeetCodeSolutions/344.py) |\n\n#### Sliding Window\n\n| Question Number| Official Website Link | Solution's Link |\n|:-:|-|-|\n|239|[sliding window maximum](https://leetcode-cn.com/problems/sliding-window-maximum/)|[hard](https://github.com/MatNoble/leetcode/blob/main/LeetCodeSolutions/239.py)|\n\n---\n\n### Binary Search\n\n| Question Number| Official Website Link | Solution's Link |\n|:-:|-|-|\n|033|[search in rotated sorted array i](https://leetcode-cn.com/problems/search-in-rotated-sorted-array-i/)|[medium](https://github.com/MatNoble/leetcode/blob/main/LeetCodeSolutions/033.py)|\n|034|[find first and last position of element in sorted array](https://leetcode-cn.com/problems/find-first-and-last-position-of-element-in-sorted-array/)|[medium](https://github.com/MatNoble/leetcode/blob/main/LeetCodeSolutions/034.py)|\n|069|[sqrtx](https://leetcode-cn.com/problems/sqrtx/)|[easy](https://github.com/MatNoble/leetcode/blob/main/LeetCodeSolutions/069.py)|\n|074|[search a 2d matrix](https://leetcode-cn.com/problems/search-a-2d-matrix/)|[medium](https://github.com/MatNoble/leetcode/blob/main/LeetCodeSolutions/074.py)|\n|081|[search in rotated sorted array ii](https://leetcode-cn.com/problems/search-in-rotated-sorted-array-ii/)|[medium](https://github.com/MatNoble/leetcode/blob/main/LeetCodeSolutions/081.py)|\n|153|[find minimum in rotated sorted array](https://leetcode-cn.com/problems/find-minimum-in-rotated-sorted-array/)|[medium](https://github.com/MatNoble/leetcode/blob/main/LeetCodeSolutions/153.py)|\n|240|[search a 2d matrix ii](https://leetcode-cn.com/problems/search-a-2d-matrix-ii/)|[medium](https://github.com/MatNoble/leetcode/blob/main/LeetCodeSolutions/240.py)|\n|540|[single element in a sorted array](https://leetcode-cn.com/problems/single-element-in-a-sorted-array/)|[medium](https://github.com/MatNoble/leetcode/blob/main/LeetCodeSolutions/540.py)|\n|704|[binary-search](https://leetcode-cn.com/problems/binary-search/)|[easy](https://github.com/MatNoble/leetcode/blob/main/LeetCodeSolutions/704.py)|\n|744|[find smallest letter greater than target](https://leetcode-cn.com/problems/find-smallest-letter-greater-than-target/submissions/)|[easy](https://github.com/MatNoble/leetcode/blob/main/LeetCodeSolutions/744.py)|\n|852|[peak index in a mountain array](https://leetcode-cn.com/problems/peak-index-in-a-mountain-array/)|[easy](https://github.com/MatNoble/leetcode/blob/main/LeetCodeSolutions/852.py)|\n|875|[koko eating bananas](https://leetcode-cn.com/problems/koko-eating-bananas/)|[medium](https://github.com/MatNoble/leetcode/blob/main/LeetCodeSolutions/875.py)|\n|1011|[capacity to ship packages within d days](https://leetcode-cn.com/problems/capacity-to-ship-packages-within-d-days/)|[medium](https://github.com/MatNoble/leetcode/blob/main/LeetCodeSolutions/1011.py)|\n\n---\n\n### Stack\n\n| Question Number| Official Website Link | Solution's Link |\n|:-:|-|-|\n|020|[valid parentheses](https://leetcode-cn.com/problems/valid-parentheses/)|[easy](https://github.com/MatNoble/leetcode/blob/main/LeetCodeSolutions/020.py)|\n|496|[next greater element i](https://leetcode-cn.com/problems/next-greater-element-i/)|[easy](https://github.com/MatNoble/leetcode/blob/main/LeetCodeSolutions/496.py)|\n|503|[next greater element ii](https://leetcode-cn.com/problems/next-greater-element-ii/)|[medium](https://github.com/MatNoble/leetcode/blob/main/LeetCodeSolutions/503.py)|\n|735|[asteroid collision](https://leetcode-cn.com/problems/asteroid-collision/)|[medium](https://github.com/MatNoble/leetcode/blob/main/LeetCodeSolutions/735.py)|\n|739|[daily temperatures](https://leetcode-cn.com/problems/daily-temperatures/)|[medium](https://github.com/MatNoble/leetcode/blob/main/LeetCodeSolutions/739.py)|\n\n---\n\n### Hash Map\n\n| Question Number| Official Website Link | Solution's Link |\n|:-:|-|-|\n|001|[Two Sum](https://leetcode-cn.com/problems/two-sum/)|[easy](https://github.com/MatNoble/leetcode/blob/main/LeetCodeSolutions/001.py)|\n|003|[longest substring without repeating characters](https://leetcode-cn.com/problems/longest-substring-without-repeating-characters/)|[medium](https://github.com/MatNoble/leetcode/blob/main/LeetCodeSolutions/003.py)|\n|560|[subarray sum equals k](https://leetcode-cn.com/problems/subarray-sum-equals-k/)|[medium](https://github.com/MatNoble/leetcode/blob/main/LeetCodeSolutions/560.py)|\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmatnoble%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmatnoble%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmatnoble%2Fleetcode/lists"}