{"id":25255110,"url":"https://github.com/kaka-lin/leetcode","last_synced_at":"2025-07-27T04:35:23.088Z","repository":{"id":37472547,"uuid":"480508765","full_name":"kaka-lin/leetcode","owner":"kaka-lin","description":"My LeetCode solution collections","archived":false,"fork":false,"pushed_at":"2023-03-03T05:49:47.000Z","size":1988,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":0,"default_branch":"main","last_synced_at":"2025-04-05T23:42:55.766Z","etag":null,"topics":["algorithms","data-structures-and-algorithms","leetcode","leetcode-solutions","leethub"],"latest_commit_sha":null,"homepage":"","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/kaka-lin.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":"2022-04-11T18:44:37.000Z","updated_at":"2022-09-06T13:52:12.000Z","dependencies_parsed_at":"2025-02-12T05:52:17.168Z","dependency_job_id":"de87d05e-228a-46dc-baf6-e9b5bf4d0136","html_url":"https://github.com/kaka-lin/leetcode","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/kaka-lin/leetcode","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kaka-lin%2Fleetcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kaka-lin%2Fleetcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kaka-lin%2Fleetcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kaka-lin%2Fleetcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/kaka-lin","download_url":"https://codeload.github.com/kaka-lin/leetcode/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kaka-lin%2Fleetcode/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":267299962,"owners_count":24066071,"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-07-27T02:00:11.917Z","response_time":82,"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":["algorithms","data-structures-and-algorithms","leetcode","leetcode-solutions","leethub"],"created_at":"2025-02-12T05:52:12.139Z","updated_at":"2025-07-27T04:35:23.064Z","avatar_url":"https://github.com/kaka-lin.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Leetcode\n\n**Problem Solved: 88** (\u003cspan style=\"color:green\"\u003eEasy: 38\u003c/span\u003e, \u003cspan style=\"color:orange\"\u003eMedium: 49\u003c/span\u003e, \u003cspan style=\"color:red\"\u003eHard: 1\u003c/span\u003e)\n\n| # | Title | Solutions | Difficulty |\n| - | - | - | - |\n| 00001 | [Two Sum](https://leetcode.com/problems/two-sum/) | \u003ca href='leetcode/00001_two-sum/1-two-sum.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Easy |\n| 00003 | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | \u003ca href='leetcode/00003_longest-substring-without-repeating-characters/3-longest-substring-without-repeating-characters.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Medium |\n| 00005 | [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/) | \u003ca href='leetcode/00005_longest-palindromic-substring/5-longest-palindromic-substring.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Medium |\n| 00011 | [Container With Most Water](https://leetcode.com/problems/container-with-most-water/) | \u003ca href='leetcode/00011_container-with-most-water/11-container-with-most-water.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Medium |\n| 00015 | [3Sum](https://leetcode.com/problems/3sum/) | \u003ca href='leetcode/00015_3sum/15-3sum.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Medium |\n| 00019 | [Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/) | \u003ca href='leetcode/00019_remove-nth-node-from-end-of-list/19-remove-nth-node-from-end-of-list.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Medium |\n| 00020 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | \u003ca href='leetcode/00020_valid-parentheses/20-valid-parentheses.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Easy |\n| 00021 | [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/) | \u003ca href='leetcode/00021_merge-two-sorted-lists/21-merge-two-sorted-lists.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Easy |\n| 00024 | [Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs/) | \u003ca href='leetcode/00024_swap-nodes-in-pairs/24-swap-nodes-in-pairs.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Medium |\n| 00025 | [Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group/) | \u003ca href='leetcode/00025_reverse-nodes-in-k-group/25-reverse-nodes-in-k-group.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Hard |\n| 00033 | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) | \u003ca href='leetcode/00033_search-in-rotated-sorted-array/33-search-in-rotated-sorted-array.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Medium |\n| 00038 | [Count and Say](https://leetcode.com/problems/count-and-say/) | \u003ca href='leetcode/00038_count-and-say/38-count-and-say.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Medium |\n| 00048 | [Rotate Image](https://leetcode.com/problems/rotate-image/) | \u003ca href='leetcode/00048_rotate-image/48-rotate-image.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Medium |\n| 00050 | [Pow(x, n)](https://leetcode.com/problems/powx-n/) | \u003ca href='leetcode/00050_powx-n/50-powx-n.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Medium |\n| 00053 | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) | \u003ca href='leetcode/00053_maximum-subarray/53-maximum-subarray.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Medium |\n| 00067 | [Add Binary](https://leetcode.com/problems/add-binary/) | \u003ca href='leetcode/00067_add-binary/67-add-binary.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Easy |\n| 00070 | [Climbing Stairs](https://leetcode.com/problems/climbing-stairs/) | \u003ca href='leetcode/00070_climbing-stairs/70-climbing-stairs.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Easy |\n| 00071 | [Simplify Path](https://leetcode.com/problems/simplify-path/) | \u003ca href='leetcode/00071_simplify-path/71-simplify-path.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Medium |\n| 00075 | [Sort Colors](https://leetcode.com/problems/sort-colors/) | \u003ca href='leetcode/00075_sort-colors/75-sort-colors.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Medium |\n| 00094 | [Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal/) | \u003ca href='leetcode/00094_binary-tree-inorder-traversal/94-binary-tree-inorder-traversal.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Easy |\n| 00095 | [Unique Binary Search Trees II](https://leetcode.com/problems/unique-binary-search-trees-ii/) | \u003ca href='leetcode/00095_unique-binary-search-trees-ii/95-unique-binary-search-trees-ii.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e\u003ca href='leetcode/00095_unique-binary-search-trees-ii/95-unique-binary-search-trees-ii.cpp'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/cplusplus/cplusplus-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Medium |\n| 00098 | [Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/) | \u003ca href='leetcode/00098_validate-binary-search-tree/98-validate-binary-search-tree.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Medium |\n| 00100 | [Same Tree](https://leetcode.com/problems/same-tree/) | \u003ca href='leetcode/00100_same-tree/100-same-tree.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Easy |\n| 00101 | [Symmetric Tree](https://leetcode.com/problems/symmetric-tree/) | \u003ca href='leetcode/00101_symmetric-tree/101-symmetric-tree.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Easy |\n| 00102 | [Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/) | \u003ca href='leetcode/00102_binary-tree-level-order-traversal/102-binary-tree-level-order-traversal.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Medium |\n| 00104 | [Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/) | \u003ca href='leetcode/00104_maximum-depth-of-binary-tree/104-maximum-depth-of-binary-tree.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Easy |\n| 00105 | [Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/) | \u003ca href='leetcode/00105_construct-binary-tree-from-preorder-and-inorder-traversal/105-construct-binary-tree-from-preorder-and-inorder-traversal.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Medium |\n| 00106 | [Construct Binary Tree from Inorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/) | \u003ca href='leetcode/00106_construct-binary-tree-from-inorder-and-postorder-traversal/106-construct-binary-tree-from-inorder-and-postorder-traversal.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Medium |\n| 00108 | [Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/) | \u003ca href='leetcode/00108_convert-sorted-array-to-binary-search-tree/108-convert-sorted-array-to-binary-search-tree.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Easy |\n| 00111 | [Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree/) | \u003ca href='leetcode/00111_minimum-depth-of-binary-tree/111-minimum-depth-of-binary-tree.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Easy |\n| 00116 | [Populating Next Right Pointers in Each Node](https://leetcode.com/problems/populating-next-right-pointers-in-each-node/) | \u003ca href='leetcode/00116_populating-next-right-pointers-in-each-node/116-populating-next-right-pointers-in-each-node.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Medium |\n| 00118 | [Pascal's Triangle](https://leetcode.com/problems/pascals-triangle/) | \u003ca href='leetcode/00118_pascals-triangle/118-pascals-triangle.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Easy |\n| 00119 | [Pascal's Triangle II](https://leetcode.com/problems/pascals-triangle-ii/) | \u003ca href='leetcode/00119_pascals-triangle-ii/119-pascals-triangle-ii.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Easy |\n| 00128 | [Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence/) | \u003ca href='leetcode/00128_longest-consecutive-sequence/128-longest-consecutive-sequence.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Medium |\n| 00133 | [Clone Graph](https://leetcode.com/problems/clone-graph/) | \u003ca href='leetcode/00133_clone-graph/133-clone-graph.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Medium |\n| 00134 | [Gas Station](https://leetcode.com/problems/gas-station/) | \u003ca href='leetcode/00134_gas-station/134-gas-station.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Medium |\n| 00144 | [Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal/) | \u003ca href='leetcode/00144_binary-tree-preorder-traversal/144-binary-tree-preorder-traversal.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Easy |\n| 00145 | [Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal/) | \u003ca href='leetcode/00145_binary-tree-postorder-traversal/145-binary-tree-postorder-traversal.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Easy |\n| 00146 | [LRU Cache](https://leetcode.com/problems/lru-cache/) | \u003ca href='leetcode/00146_lru-cache/146-lru-cache.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Medium |\n| 00150 | [Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation/) | \u003ca href='leetcode/00150_evaluate-reverse-polish-notation/150-evaluate-reverse-polish-notation.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Medium |\n| 00155 | [Min Stack](https://leetcode.com/problems/min-stack/) | \u003ca href='leetcode/00155_min-stack/155-min-stack.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Easy |\n| 00200 | [Number of Islands](https://leetcode.com/problems/number-of-islands/) | \u003ca href='leetcode/00200_number-of-islands/200-number-of-islands.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Medium |\n| 00203 | [Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements/) | \u003ca href='leetcode/00203_remove-linked-list-elements/203-remove-linked-list-elements.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Easy |\n| 00206 | [Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/) | \u003ca href='leetcode/00206_reverse-linked-list/206-reverse-linked-list.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Easy |\n| 00215 | [Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array/) | \u003ca href='leetcode/00215_kth-largest-element-in-an-array/215-kth-largest-element-in-an-array.cpp'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/cplusplus/cplusplus-original.svg' width='20' height='20'\u003e\u003c/a\u003e\u003ca href='leetcode/00215_kth-largest-element-in-an-array/215-kth-largest-element-in-an-array.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Medium |\n| 00217 | [Contains Duplicate](https://leetcode.com/problems/contains-duplicate/) | \u003ca href='leetcode/00217_contains-duplicate/217-contains-duplicate.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Easy |\n| 00225 | [Implement Stack using Queues](https://leetcode.com/problems/implement-stack-using-queues/) | \u003ca href='leetcode/00225_implement-stack-using-queues/225-implement-stack-using-queues.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Easy |\n| 00230 | [Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst/) | \u003ca href='leetcode/00230_kth-smallest-element-in-a-bst/230-kth-smallest-element-in-a-bst.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Medium |\n| 00232 | [Implement Queue using Stacks](https://leetcode.com/problems/implement-queue-using-stacks/) | \u003ca href='leetcode/00232_implement-queue-using-stacks/232-implement-queue-using-stacks.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Easy |\n| 00235 | [Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/) | \u003ca href='leetcode/00235_lowest-common-ancestor-of-a-binary-search-tree/235-lowest-common-ancestor-of-a-binary-search-tree.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Easy |\n| 00236 | [Lowest Common Ancestor of a Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/) | \u003ca href='leetcode/00236_lowest-common-ancestor-of-a-binary-tree/236-lowest-common-ancestor-of-a-binary-tree.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Medium |\n| 00240 | [Search a 2D Matrix II](https://leetcode.com/problems/search-a-2d-matrix-ii/) | \u003ca href='leetcode/00240_search-a-2d-matrix-ii/240-search-a-2d-matrix-ii.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Medium |\n| 00257 | [Binary Tree Paths](https://leetcode.com/problems/binary-tree-paths/) | \u003ca href='leetcode/00257_binary-tree-paths/257-binary-tree-paths.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Easy |\n| 00279 | [Perfect Squares](https://leetcode.com/problems/perfect-squares/) | \u003ca href='leetcode/00279_perfect-squares/279-perfect-squares.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Medium |\n| 00283 | [Move Zeroes](https://leetcode.com/problems/move-zeroes/) | \u003ca href='leetcode/00283_move-zeroes/283-move-zeroes.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Easy |\n| 00344 | [Reverse String](https://leetcode.com/problems/reverse-string/) | \u003ca href='leetcode/00344_reverse-string/344-reverse-string.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Easy |\n| 00347 | [Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements/) | \u003ca href='leetcode/00347_top-k-frequent-elements/347-top-k-frequent-elements.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Medium |\n| 00350 | [Intersection of Two Arrays II](https://leetcode.com/problems/intersection-of-two-arrays-ii/) | \u003ca href='leetcode/00350_intersection-of-two-arrays-ii/350-intersection-of-two-arrays-ii.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Easy |\n| 00371 | [Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers/) | \u003ca href='leetcode/00371_sum-of-two-integers/371-sum-of-two-integers.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Medium |\n| 00387 | [First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string/) | \u003ca href='leetcode/00387_first-unique-character-in-a-string/387-first-unique-character-in-a-string.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Easy |\n| 00389 | [Find the Difference](https://leetcode.com/problems/find-the-difference/) | \u003ca href='leetcode/00389_find-the-difference/389-find-the-difference.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Easy |\n| 00394 | [Decode String](https://leetcode.com/problems/decode-string/) | \u003ca href='leetcode/00394_decode-string/394-decode-string.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Medium |\n| 00429 | [N-ary Tree Level Order Traversal](https://leetcode.com/problems/n-ary-tree-level-order-traversal/) | \u003ca href='leetcode/00429_n-ary-tree-level-order-traversal/429-n-ary-tree-level-order-traversal.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Medium |\n| 00450 | [Delete Node in a BST](https://leetcode.com/problems/delete-node-in-a-bst/) | \u003ca href='leetcode/00450_delete-node-in-a-bst/450-delete-node-in-a-bst.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Medium |\n| 00494 | [Target Sum](https://leetcode.com/problems/target-sum/) | \u003ca href='leetcode/00494_target-sum/494-target-sum.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Medium |\n| 00509 | [Fibonacci Number](https://leetcode.com/problems/fibonacci-number/) | \u003ca href='leetcode/00509_fibonacci-number/509-fibonacci-number.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Easy |\n| 00542 | [01 Matrix](https://leetcode.com/problems/01-matrix/) | \u003ca href='leetcode/00542_01-matrix/542-01-matrix.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Medium |\n| 00572 | [Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree/) | \u003ca href='leetcode/00572_subtree-of-another-tree/572-subtree-of-another-tree.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Easy |\n| 00575 | [Distribute Candies](https://leetcode.com/problems/distribute-candies/) | \u003ca href='leetcode/00575_distribute-candies/575-distribute-candies.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Easy |\n| 00606 | [Construct String from Binary Tree](https://leetcode.com/problems/construct-string-from-binary-tree/) | \u003ca href='leetcode/00606_construct-string-from-binary-tree/606-construct-string-from-binary-tree.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Easy |\n| 00617 | [Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees/) | \u003ca href='leetcode/00617_merge-two-binary-trees/617-merge-two-binary-trees.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Easy |\n| 00622 | [Design Circular Queue](https://leetcode.com/problems/design-circular-queue/) | \u003ca href='leetcode/00622_design-circular-queue/622-design-circular-queue.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Medium |\n| 00637 | [Average of Levels in Binary Tree](https://leetcode.com/problems/average-of-levels-in-binary-tree/) | \u003ca href='leetcode/00637_average-of-levels-in-binary-tree/637-average-of-levels-in-binary-tree.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Easy |\n| 00692 | [Top K Frequent Words](https://leetcode.com/problems/top-k-frequent-words/) | \u003ca href='leetcode/00692_top-k-frequent-words/692-top-k-frequent-words.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e\u003ca href='leetcode/00692_top-k-frequent-words/692-top-k-frequent-words.cpp'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/cplusplus/cplusplus-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Medium |\n| 00700 | [Search in a Binary Search Tree](https://leetcode.com/problems/search-in-a-binary-search-tree/) | \u003ca href='leetcode/00700_search-in-a-binary-search-tree/700-search-in-a-binary-search-tree.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Easy |\n| 00721 | [Accounts Merge](https://leetcode.com/problems/accounts-merge/) | \u003ca href='leetcode/00721_accounts-merge/721-accounts-merge.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Medium |\n| 00733 | [Flood Fill](https://leetcode.com/problems/flood-fill/) | \u003ca href='leetcode/00733_flood-fill/733-flood-fill.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Easy |\n| 00739 | [Daily Temperatures](https://leetcode.com/problems/daily-temperatures/) | \u003ca href='leetcode/00739_daily-temperatures/739-daily-temperatures.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Medium |\n| 00752 | [Open the Lock](https://leetcode.com/problems/open-the-lock/) | \u003ca href='leetcode/00752_open-the-lock/752-open-the-lock.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Medium |\n| 00783 | [Minimum Distance Between BST Nodes](https://leetcode.com/problems/minimum-distance-between-bst-nodes/) | \u003ca href='leetcode/00783_minimum-distance-between-bst-nodes/783-minimum-distance-between-bst-nodes.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Easy |\n| 00797 | [All Paths From Source to Target](https://leetcode.com/problems/all-paths-from-source-to-target/) | \u003ca href='leetcode/00797_all-paths-from-source-to-target/797-all-paths-from-source-to-target.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Medium |\n| 00814 | [Binary Tree Pruning](https://leetcode.com/problems/binary-tree-pruning/) | \u003ca href='leetcode/00814_binary-tree-pruning/814-binary-tree-pruning.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Medium |\n| 00841 | [Keys and Rooms](https://leetcode.com/problems/keys-and-rooms/) | \u003ca href='leetcode/00841_keys-and-rooms/841-keys-and-rooms.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Medium |\n| 00863 | [All Nodes Distance K in Binary Tree](https://leetcode.com/problems/all-nodes-distance-k-in-binary-tree/) | \u003ca href='leetcode/00863_all-nodes-distance-k-in-binary-tree/863-all-nodes-distance-k-in-binary-tree.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Medium |\n| 00912 | [Sort an Array](https://leetcode.com/problems/sort-an-array/) | \u003ca href='leetcode/00912_sort-an-array/912-sort-an-array.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Medium |\n| 00994 | [Rotting Oranges](https://leetcode.com/problems/rotting-oranges/) | \u003ca href='leetcode/00994_rotting-oranges/994-rotting-oranges.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Medium |\n| 01091 | [Shortest Path in Binary Matrix](https://leetcode.com/problems/shortest-path-in-binary-matrix/) | \u003ca href='leetcode/01091_shortest-path-in-binary-matrix/1091-shortest-path-in-binary-matrix.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Medium |\n| 01971 | [Find if Path Exists in Graph](https://leetcode.com/problems/find-if-path-exists-in-graph/) | \u003ca href='leetcode/01971_find-if-path-exists-in-graph/1971-find-if-path-exists-in-graph.py'\u003e\u003cimg src='https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg' width='20' height='20'\u003e\u003c/a\u003e | Easy |\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fkaka-lin%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fkaka-lin%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fkaka-lin%2Fleetcode/lists"}