{"id":13434780,"url":"https://github.com/tech-cow/leetcode","last_synced_at":"2025-05-16T05:08:16.667Z","repository":{"id":41243352,"uuid":"87606760","full_name":"tech-cow/leetcode","owner":"tech-cow","description":"👏🏻 leetcode solutions for Humans™","archived":false,"fork":false,"pushed_at":"2021-04-20T18:34:48.000Z","size":666,"stargazers_count":1347,"open_issues_count":26,"forks_count":305,"subscribers_count":88,"default_branch":"master","last_synced_at":"2025-05-14T18:17:11.163Z","etag":null,"topics":["algiorithimcs","algorithm","algorithm-challenges","algorithm-competitions","algorithms","algorithms-and-data-structures","algorithms-datastructures","google","interview","interview-practice","interview-preparation","interview-questions","interview-test","leetcode","leetcode-python","leetcode-solutions","python","python-leetcode"],"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/tech-cow.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}},"created_at":"2017-04-08T04:01:25.000Z","updated_at":"2025-03-26T15:39:18.000Z","dependencies_parsed_at":"2022-08-02T11:52:56.375Z","dependency_job_id":null,"html_url":"https://github.com/tech-cow/leetcode","commit_stats":null,"previous_names":["yuzhoujr/leetcode"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tech-cow%2Fleetcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tech-cow%2Fleetcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tech-cow%2Fleetcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tech-cow%2Fleetcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/tech-cow","download_url":"https://codeload.github.com/tech-cow/leetcode/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":254471058,"owners_count":22076585,"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":["algiorithimcs","algorithm","algorithm-challenges","algorithm-competitions","algorithms","algorithms-and-data-structures","algorithms-datastructures","google","interview","interview-practice","interview-preparation","interview-questions","interview-test","leetcode","leetcode-python","leetcode-solutions","python","python-leetcode"],"created_at":"2024-07-31T03:00:22.820Z","updated_at":"2025-05-16T05:08:11.658Z","avatar_url":"https://github.com/tech-cow.png","language":"Python","readme":"\u003c!---Logo---\u003e\n\u003ch1 align=\"center\"\u003e\n      \u003cbr\u003e\u003ca href=\"http://yuzhoujr.com\"\u003e\u003cimg src=\"http://yuzhoujr.com/legacy/image/logo.jpg\" alt=\"yuzhoujr\" width=\"200\"\u003e\u003c/a\u003e\n\u003c/h1\u003e\n \n\u003c!---Mentra---\u003e\n\u003cp align=\"center\"\u003e\n      公瑾现在提供以下服务哟！Contact me @ yu.zhou.jr@gmail.com \u003cbr\u003e\n      http://yuzhoujr.com/legacy/dummynode.pdf\n\u003c/p\u003e\n\u003c!---svg---\u003e\n\u003cp align=\"center\"\u003e\n  \u003ca href=\"#backers\" alt=\"sponsors on Open Collective\"\u003e\u003cimg src=\"https://opencollective.com/leetcode/backers/badge.svg\" /\u003e\u003c/a\u003e \u003ca href=\"#sponsors\" alt=\"Sponsors on Open Collective\"\u003e\u003cimg src=\"https://opencollective.com/leetcode/sponsors/badge.svg\" /\u003e\u003c/a\u003e \u003cimg src=\"https://img.shields.io/badge/language-Python-yellow.svg?style=flat-square\"\u003e\n  \u003cimg src=\"https://img.shields.io/badge/license-MIT-orange.svg?style=flat-square\"\u003e\n  \u003cimg src=\"https://img.shields.io/badge/progress-1%20%2F%20N-ff69b4.svg?style=flat-square\"\u003e\n\u003c/p\u003e\n\n\n\n\u003cbr\u003e\n\n\n## Mock Interview 经验 + 反馈 \n\n* Google面试官的反馈: [Dropbox链接](https://paper.dropbox.com/doc/GMock-Interview--AIMRqf_e~KjKAe47PIvkVrN6AQ-8teeNVpJ2oq8s6nODLKQd)\n* Yahoo电面反馈: [Dropbox链接](https://paper.dropbox.com/doc/95-Yahoo--AMA9j51_WIY9uAzybM9E0QLSAQ-t0hgbpyY11v0NvI3bcEf9)\n\n\n## Journey\n\n[时间线](https://gist.github.com/yuzhoujr/cf7c0ebdc0b3b471ddac94a862a0ecd9)\n\n\n\u003cbr\u003e\u003cbr\u003e\u003cbr\u003e\n\n\n\n## Array Easy\n|  #  | Title | Solution | Time | Space | Video|\n| --- | ----- | -------- | ---- | ----- | ---- |\n|624| [Maximum Distance in Arrays](https://leetcode.com/problems/maximum-distance-in-arrays/description/) | [Python](./array/624.py) | _O(n)_| _O(1)_ ||\n\n\n## Array Medium\n|  #  | Title | Solution | Time | Space | Video|\n| --- | ----- | -------- | ---- | ----- | ---- |\n|3| [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/#/solutions) | [Python](./array/3.py) | _O(n)_| _O(n)_ ||\n|463| [Island Perimeter](https://leetcode.com/problems/island-perimeter/#/description) | [Python](./array/463.py) | _O(n^2)_| _O(1)_||\n\n## Hash Table Easy\n|  #  | Title | Solution | Time | Space | Video|\n| --- | ----- | -------- | ---- | ----- | ---- |\n|1| [Two Sum](https://leetcode.com/problems/two-sum/) | [Python](./array/1.py) | _O(n)_| _O(n)_ |[:tv:](https://www.youtube.com/watch?v=uajne4jeGaA)|\n|242| [Valid Anagram](https://leetcode.com/problems/valid-anagram/description/) | [Python](./array/242.py) | _O(n)_| _O(n)_ ||\n\n\n\n\n\n\n\n## Linked List Easy\n|  #  | Title | Solution | Time | Space | Video|\n| --- | ----- | -------- | ---- | ----- | ---- |\n|21|[Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists) | [Python](./linkedlist/MergeTwoSortedLists.py) | _O(n)_| _O(n)_ ||\n|89|[Partition List](https://leetcode.com/problems/partition-list/) | [Python](./linkedlist/PartitionLinkedList.py) | _O(n)_ | _O(n)_ ||\n|141|[Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/#/description) | [Python](./linkedlist/LinkedListCycle.py) | _O(n)_ | _O(1)_ ||\n|160|[Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists) | [Python](./linkedlist/IntersectionOfTwoLinkedLists.py) | _O(n)_| _O(1)_  ||\n|203|[Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements/#/description) | [Python](./linkedlist/RemoveLinkedListElements.py) | _O(n)_| _O(1)_  ||\n|206|[Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/#/description) | [Python](./linkedlist/ReverseLinkedList.py) | _O(n)_| _O(1)_  || Tutorial](https://www.youtube.com/watch?v=sYcOK51hl-A\u0026t=681s) |\n|234|[Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list/) | [Python](./linkedlist/palindrome.py) | _O(n)_| _O(1)_  ||\n|83|[Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list/#/description)| [Python](./linkedlist/deleteDuplicates.py) | _O(n)_| _O(1)_  ||\n\n\n## LinkedList Medium\n|  #  | Title | Solution | Time | Space | Video|\n| --- | ----- | -------- | ---- | ----- | ---- |\n|2|[Add Two Numbers](https://leetcode.com/problems/add-two-numbers/#/description) | [Python](./linkedlist/addTwoNumbers.py) | _O(n)_| _O(n)_|\n|445| [Add Two Numbers II](https://leetcode.com/problems/add-two-numbers-ii/#/description)| [Python](./linkedlist/addTwoNumbersTwo.py) | _O(n)_| _O(n)_|\n|142|[Linked List Cycle II](https://leetcode.com/problems/linked-list-cycle-ii/#/description)| [Python](./linkedlist/detectCycleii.py) | _O(n)_| _O(1)_|[:tv:](https://www.youtube.com/watch?v=iZVBVCpmugI\u0026t=1s)|\n|328|[Odd Even Linked List](https://leetcode.com/problems/odd-even-linked-list/#/description)| [Python](./linkedlist/oddEvenList.py) | _O(n)_| _O(1)_|\n|143|[Reorder List](https://leetcode.com/problems/reorder-list/#/description)| [Python](./linkedlist/reorder.py) | _O(n)_| _O(1)_|\n|24|[Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs/#/solutions)| [Python](./linkedlist/swapPairs.py) | _O(n)_| _O(1)_|\n|148|[Sort List](https://leetcode.com/problems/sort-list/#/description)| [Python](./linkedlist/sortList.py) | _O(nlogn)_| _O(1)_|\n|61|[Rotate List](https://leetcode.com/problems/rotate-list/#/description)| [Python](./linkedlist/rotateRight.py) | _O(n)_| _O(1)_|\n|19|[Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/#/description)| [Python](./linkedlist/removeNthFromEnd.py) | _O(n)_| _O(1)_|[:tv:](https://youtu.be/8Jq8ikIeF1M)|\n|138|[Copy List with Random Pointer](https://leetcode.com/problems/copy-list-with-random-pointer/#/description)| [Python](./linkedlist/copyRandomList.py) | _O(n)_| _O(n)_|\n\n\n## Stacks Easy\n|  #  | Title | Solution | Time | Space | Video|\n| --- | ----- | -------- | ---- | ----- | ---- |\n|155|[Min Stack](https://leetcode.com/problems/min-stack/#/description)| [Python](./stack_queue/minStack.py) | _O(1)_| _O(n)_|\n|225|[Implement Stack using Queues](https://leetcode.com/problems/implement-stack-using-queues/#/description)| [Python](./stack_queue/queueStack.py) | push/pop: _O(1)_ top:_O(n)_ | _O(n)_|\n|20|[Valid Parentheses](https://leetcode.com/problems/valid-parentheses/#/description)| [Python](./stack_queue/isValid.py) | _O(n)_| _O(n)_|\n|346|[Moving Average from Data Stream](https://leetcode.com/problems/moving-average-from-data-stream/#/description)| [Python](./stack_queue/movingAverage.py) | _O(1)_| _O(n)_|\n\n\n## Tree Easy\n|  #  | Title | Solution | Time | Space | Video|\n| --- | ----- | -------- | ---- | ----- | ---- |\n|110|[Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree/#/description)| [Python ](./tree/Yu/110_isBalanced.py) | _O(N)_| _O(h)_  |\n|107|[Binary Tree Level Order Traversal II](https://leetcode.com/problems/binary-tree-level-order-traversal-ii/)| [Python ](./tree/Yu/107.py) | _O(N)_| _O(h)_  |\n|112|[Path Sum](https://leetcode.com/problems/path-sum/#/description)| [Python ](./tree/Yu/112_hasPathSum.py) | _O(N)_| _O(h)_ |[:tv:](https://www.youtube.com/watch?v=LgtcGjIuE18\u0026feature=youtu.be)|\n|100|[Same Tree](https://leetcode.com/problems/same-tree/)| [Python ](./tree/Yu/100_isSameTree.py) | _O(N)_| _O(1)_|\n|101|[Symmetric Tree](https://leetcode.com/problems/symmetric-tree/#/description)| [Python ](./tree/Yu/101_symmetricTree.py)| _O(N)_| _O(1)_|[:tv:](https://youtu.be/3Gl4F29LVpQ)|\n|104|[Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/)| [Python](./tree/Yu/104_maxDepth.py) | _O(N)_| _O(1)_ ||\n|108|[Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/#/solutions)| [Python ](./tree/Yu/108.py) | _O(N)_| _O(N)_ |[:tv:](https://www.youtube.com/watch?v=lBrb4fXPcMM)|\n|111|[Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree/#/description)| [Python ](https://github.com/yuzhoujr/LeetCode/blob/master/tree/Yu/111_minDepth.py)| _O(N)_| _O(1)_||\n|235|[Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/#/description)| [Python](./tree/Yu/235_lca_bst.py) | _O(N)_| _O(1)_ ||\n|226|[Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/#/description)| [Python ](./tree/Yu/226.py) | _O(N)_| _O(1)_ |[:tv:](https://youtu.be/oiX3mqcAK0s)|\n|543|[Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree/#/description)| [Python ](./tree/Yu/543.py) | _O(N)_| _O(h)_ |[:tv:](https://www.youtube.com/watch?v=0VnOfu2pYTo)|\n|501|[Find Mode in Binary Search Tree](https://leetcode.com/problems/find-mode-in-binary-search-tree/#/description)| [Python ](./tree/Yu/501.py) | _O(N)_| _O(N)_ |[:tv:](https://youtu.be/v4F4x_uwMb8)|\n|257|[Binary Tree Paths](https://leetcode.com/problems/binary-tree-paths/#/description)| [Python ](./tree/Yu/257.py) | _O(N)_| _O(N)_ |[:tv:](https://youtu.be/Zr_7qq2f16k)|\n|572|[Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree/#/description)| [Python ](./tree/Yu/572.py) | _O(S*T)_| _O(1)_ |[:tv:](https://youtu.be/v4F4x_uwMb8)|\n|437|[Path Sum III](https://leetcode.com/problems/path-sum-iii/#/description)| [Python ](./tree/Yu/437.py) | _O(N^2)_| _O(1)_ | |[:tv:](https://www.youtube.com/watch?v=NTyOEYYyv-o)|\n|404|[Sum of Left Leaves](https://leetcode.com/problems/sum-of-left-leaves/#/description)| [Python ](./tree/Yu/404_sum_of_Left_Leaves.py) | _O(N)_| _O(1)_|[:tv:](https://youtu.be/pH-KxPcBF_4)|\n|270|[Closest Binary Search Tree Value](https://leetcode.com/problems/closest-binary-search-tree-value/#/description)| [Python ](./tree/Yu/270.py)| _O(N)_| _O(1)_|[:tv:](https://youtu.be/RwvQyKJxHZk)|\n|563|[Binary Tree Tilt](https://leetcode.com/problems/binary-tree-tilt/#/description)| [Python ](./tree/Yu/563.py) | _O(N)_| _O(1)_ |[:tv:](https://youtu.be/47FQVP4ynk0)|\n|538|[Convert BST to Greater Tree](https://leetcode.com/problems/convert-bst-to-greater-tree/#/description)| [Python ](./tree/Yu/538.py) | _O(N)_| _O(1)_ |[:tv:](https://youtu.be/YoEPWtXmkD4)|\n|637|[Average of Levels in Binary Tree](https://leetcode.com/problems/average-of-levels-in-binary-tree/)| [Python ](./tree/Yu/637.py) | _O(N)_| _O(1)_ ||\n\n## Tree Medium\n|  #  | Title | Solution | Time | Space | Video|\n| --- | ----- | -------- | ---- | ----- | ---- |\n|144|[Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal/#/description)| [Python ](./tree/Yu/144.py) | _O(N)_| _O(N)_  |[:tv:](https://youtu.be/cHbdPonjYS0)|\n|102|[Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/#/description)| [Python ](./tree/Yu/102.py) | _O(N)_| _O(N)_  |[:tv:](https://youtu.be/IWiprpdSgzg)|\n|107|[Binary Tree Level Order Traversal II](https://leetcode.com/problems/binary-tree-level-order-traversal-ii/#/description)| [Python ](./tree/Yu/107.py) | _O(N)_| _O(N)_  ||\n|515|[Find Largest Value in Each Tree Row](https://leetcode.com/problems/find-largest-value-in-each-tree-row/#/description)| [Python ](./tree/Yu/515.py) | _O(N)_| _O(1)_  ||\n|236|[Lowest Common Ancestor of a Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/#/description)| [Python ](./tree/Yu/236.py) | _O(N)_| _O(1)_ |[:tv:](https://youtu.be/WqNULaUhPCc)|\n|199|[Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view/#/description)| [Python ](./tree/Yu/199.py) | _O(N)_| _O(N)_  |[:tv:](https://youtu.be/_iKUgRiUYKA)|\n|114|[Flatten Binary Tree to Linked List](https://leetcode.com/problems/flatten-binary-tree-to-linked-list/#/solutions)| [Python ](./tree/Yu/114.py) | _O(N)_| _O(1)_  |[:tv:](https://youtu.be/LfKRZ_qCmYQ)|\n|230|[Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst/#/description)| [Python ](./tree/Yu/230.py) | _O(N)_| _O(1)_  |[:tv:](https://youtu.be/CfNRc82ighw)|\n|582|[Kill Process](https://leetcode.com/problems/kill-process/#/description)| [Python ](./tree/Yu/582.py) | _O(N)_| _O(N)_  | [:tv:](https://youtu.be/fKR1n35Sj8s)|\n\n\n## Backtrack Medium\n|  #  | Title | Solution | Time | Space | Video|\n| --- | ----- | -------- | ---- | ----- | ---- |\n|78|[Subsets](https://leetcode.com/problems/subsets/#/description)| [Python ](./backtrack/Yu/78.py) | _O(N*(2^N))_| _O(2^N)_|[:tv:](https://youtu.be/Az3PfUep7gk)|\n|90|[Subsets II](https://leetcode.com/problems/subsets-ii/#/description)| [Python ](./backtrack/Yu/90.py) | _O(N*(2^N))_| _O(2^N)_  |  [:tv:](https://youtu.be/Az3PfUep7gk)|\n|46|[Permutations](https://leetcode.com/problems/permutations/#/description)| [Python ](./backtrack/Yu/46.py) | _O(N*(N!))_| _O(N!)_  |  [:tv:](https://www.youtube.com/watch?v=oCGMwvKUQ_I\u0026feature=youtu.be)|\n|47|[Permutations II](https://leetcode.com/problems/permutations/#/description)| [Python ](./backtrack/Yu/47.py) | _O(N*(N!))_| _O(N!)_  |  [:tv:](https://youtu.be/imLl2s9Ujis)|\n|60|[Permutation Sequence](https://leetcode.com/problems/permutation-sequence/#/description)| [Python ](./backtrack/Yu/60.py) | _O(N * (N!)_| _O(N)_  ||\n|77|[Combinations](https://leetcode.com/problems/combinations/#/description)| [Python ](./backtrack/Yu/77.py) | _O(N*(N!))_| _O(N!)_   ||\n|39|[Combination Sum](https://leetcode.com/problems/combination-sum/#/description)| [Python ](./backtrack/Yu/39.py) | _O(K * (2^N)_| _O(N)_  |  [:tv:](https://youtu.be/HdS5dOaz-mk)|\n|40|[Combination Sum II](https://leetcode.com/problems/combination-sum-ii/#/solutions)| [Python ](./backtrack/Yu/39.py) | _O(K * (2^N)_| _O(N)_  |  [:tv:](https://youtu.be/HdS5dOaz-mk)|\n|216|[Combination Sum III](https://leetcode.com/problems/combination-sum-iii/#/description)| [Python ](./backtrack/Yu/216.py) | _O(K * (2^N)_| _O(N)_  ||\n|17|[Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number/description/)| [Python ](./backtrack/Yu/17.py) | _O(N*(4^N))_| _O(N)_  |  [:tv:](https://www.youtube.com/watch?v=7KZWLM9QtRA)|\n|131|[Palindrome Partitioning](https://leetcode.com/problems/palindrome-partitioning/description/)| [Python ](./backtrack/Yu/131.py) | _O(N*(2^N))_| _O(N)_  |  [:tv:](https://youtu.be/UFdSC_ml4TQ)|\n\n## Greedy Medium\n|  #  | Title | Solution | Time | Space | Video|\n| --- | ----- | -------- | ---- | ----- | ---- |\n|452|[Minimum Number of Arrows to Burst Balloons](https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons/#/description)| [Python ](./greedy/452.py) | _O(N)_| _O(1)_  |  |\n\n## Dynamic Programming Easy\n|  #  | Title | Solution | Time | Space | Video|\n| --- | ----- | -------- | ---- | ----- | ---- |\n|70|[Climbing Stairs](https://leetcode.com/problems/climbing-stairs/#/solutions)| [Python ](./dp/70.py) | _O(N)_| _O(1)_  | Easy| |\n|53|[Maximum Subarray](https://leetcode.com/problems/maximum-subarray/#/description)| [Python ](./dp/53.py) | _O(N)_| _O(N)_  | Easy|[:tv:](https://youtu.be/4tfhDdgu76E) |\n|198|[House Robber](https://leetcode.com/problems/house-robber/#/description)| [Python ](./dp/198.py) | _O(N)_| _O(N)_  | Easy|[:tv:](https://youtu.be/QSjPkgyxCaQ) |\n\n\n\n## Dynamic Programming Medium\n|  #  | Title | Solution | Time | Space | Video|\n| --- | ----- | -------- | ---- | ----- | ---- |\n|64|[Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum/#/submissions/1)| [Python ](./dp/64.py) | _O(N^2)_| _O(M*N)_  |  [:tv:](https://youtu.be/bEcW6QqgXvM)|\n|62|[Unique Paths](https://leetcode.com/problems/unique-paths/#/description)| [Python ](./dp/62.py) | _O(N^2)_| _O(M*N)_  |  Reference #64|\n|55|[Jump Game](https://leetcode.com/problems/jump-game/)| [Python ](./dp/55.py) | _O(N^2)_| _O(1)_  |  TLE with DP/Use Greedy for O(N) Solution|\n|45|[Jump Game II](https://leetcode.com/problems/jump-game-ii/#/description)| [Python ](./dp/55.py) | _O(N^2)_| _O(1)_  |   TLE with DP/Use Greedy for O(N) Solution |\n|300|[Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence/#/description)| [Python ](./dp/300.py) | _O(N^2)_| _O(1)_  |  Use Binary-Search for NlogN Solution|\n\n## BitMap Easy\n|  #  | Title | Solution | Time | Space | Video|\n| --- | ----- | -------- | ---- | ----- | ---- |\n|136|[Single Number](https://leetcode.com/problems/single-number/description/)| [Python ](./bitmap/136.py) | _O(N)_| _O(1)_  |  [:tv:](https://www.youtube.com/watch?v=C4GWPpNivfI\u0026list=PLFp7f5kTehDlpCj5puB3WGbH1Qi3eSDat\u0026index=6\u0026t=7s)|\n\n\n## Contributors\n\nThis project exists thanks to all the people who contribute. [[Contribute](CONTRIBUTING.md)].\n\u003ca href=\"graphs/contributors\"\u003e\u003cimg src=\"https://opencollective.com/leetcode/contributors.svg?width=890\u0026button=false\" /\u003e\u003c/a\u003e\n\n\n## Backers\n\nThank you to all our backers! 🙏 [[Become a backer](https://opencollective.com/leetcode#backer)]\n\n\u003ca href=\"https://opencollective.com/leetcode#backers\" target=\"_blank\"\u003e\u003cimg src=\"https://opencollective.com/leetcode/backers.svg?width=890\"\u003e\u003c/a\u003e\n\n\n## Sponsors\n\nSupport this project by becoming a sponsor. Your logo will show up here with a link to your website. [[Become a sponsor](https://opencollective.com/leetcode#sponsor)]\n\n\u003ca href=\"https://opencollective.com/leetcode/sponsor/0/website\" target=\"_blank\"\u003e\u003cimg src=\"https://opencollective.com/leetcode/sponsor/0/avatar.svg\"\u003e\u003c/a\u003e\n\u003ca href=\"https://opencollective.com/leetcode/sponsor/1/website\" target=\"_blank\"\u003e\u003cimg src=\"https://opencollective.com/leetcode/sponsor/1/avatar.svg\"\u003e\u003c/a\u003e\n\u003ca href=\"https://opencollective.com/leetcode/sponsor/2/website\" target=\"_blank\"\u003e\u003cimg src=\"https://opencollective.com/leetcode/sponsor/2/avatar.svg\"\u003e\u003c/a\u003e\n\u003ca href=\"https://opencollective.com/leetcode/sponsor/3/website\" target=\"_blank\"\u003e\u003cimg src=\"https://opencollective.com/leetcode/sponsor/3/avatar.svg\"\u003e\u003c/a\u003e\n\u003ca href=\"https://opencollective.com/leetcode/sponsor/4/website\" target=\"_blank\"\u003e\u003cimg src=\"https://opencollective.com/leetcode/sponsor/4/avatar.svg\"\u003e\u003c/a\u003e\n\u003ca href=\"https://opencollective.com/leetcode/sponsor/5/website\" target=\"_blank\"\u003e\u003cimg src=\"https://opencollective.com/leetcode/sponsor/5/avatar.svg\"\u003e\u003c/a\u003e\n\u003ca href=\"https://opencollective.com/leetcode/sponsor/6/website\" target=\"_blank\"\u003e\u003cimg src=\"https://opencollective.com/leetcode/sponsor/6/avatar.svg\"\u003e\u003c/a\u003e\n\u003ca href=\"https://opencollective.com/leetcode/sponsor/7/website\" target=\"_blank\"\u003e\u003cimg src=\"https://opencollective.com/leetcode/sponsor/7/avatar.svg\"\u003e\u003c/a\u003e\n\u003ca href=\"https://opencollective.com/leetcode/sponsor/8/website\" target=\"_blank\"\u003e\u003cimg src=\"https://opencollective.com/leetcode/sponsor/8/avatar.svg\"\u003e\u003c/a\u003e\n\u003ca href=\"https://opencollective.com/leetcode/sponsor/9/website\" target=\"_blank\"\u003e\u003cimg src=\"https://opencollective.com/leetcode/sponsor/9/avatar.svg\"\u003e\u003c/a\u003e\n\n\n\n## License\n\n🌱 MIT @ Yu Zhou 🌱\n\n---\n\n\n\u003e ![home](http://yuzhoujr.com/legacy/emoji/home.svg)\n[yuzhoujr.com](http://www.yuzhoujr.com) \u0026nbsp;\u0026middot;\u0026nbsp;\n\u003e ![github](http://yuzhoujr.com/legacy/emoji/github.svg)  [@yuzhoujr](https://github.com/yuzhoujr) \u0026nbsp;\u0026middot;\u0026nbsp;\n\u003e ![linkedin](http://yuzhoujr.com/legacy/emoji/linkedin.svg)  [@yuzhoujr](https://linkedin.com/in/yuzhoujr)\n","funding_links":["https://opencollective.com/leetcode"],"categories":["Useful Links","Programming Language Tutorials","Python"],"sub_categories":["Python"],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftech-cow%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ftech-cow%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftech-cow%2Fleetcode/lists"}