{"id":16107168,"url":"https://github.com/againstentropy/myleetcode","last_synced_at":"2025-08-03T19:12:36.216Z","repository":{"id":187828113,"uuid":"669768975","full_name":"AgainstEntropy/myLeetCode","owner":"AgainstEntropy","description":null,"archived":false,"fork":false,"pushed_at":"2024-11-29T03:07:41.000Z","size":125,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-12T09:57:45.101Z","etag":null,"topics":[],"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/AgainstEntropy.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":"2023-07-23T11:19:35.000Z","updated_at":"2024-11-29T03:07:44.000Z","dependencies_parsed_at":"2023-11-30T04:30:15.347Z","dependency_job_id":"94fbc7a8-d765-4a7c-ac53-ed68699e3173","html_url":"https://github.com/AgainstEntropy/myLeetCode","commit_stats":null,"previous_names":["againstentropy/myleetcode"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AgainstEntropy%2FmyLeetCode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AgainstEntropy%2FmyLeetCode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AgainstEntropy%2FmyLeetCode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AgainstEntropy%2FmyLeetCode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/AgainstEntropy","download_url":"https://codeload.github.com/AgainstEntropy/myLeetCode/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247430838,"owners_count":20937873,"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":[],"created_at":"2024-10-09T19:15:24.900Z","updated_at":"2025-04-06T03:40:21.652Z","avatar_url":"https://github.com/AgainstEntropy.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# myLeetCode\n\n\u003cstyle\u003e\neasy {\n  color: LimeGreen;\n}\n\nmedium {\n  color: orange;\n}\n\nhard {\n  color: red;\n}\n\u003c/style\u003e\n\nA record of my leetcode solving in Python, Rust, C/C++, ...\n\n## Problem Lists\n\n### [100 List](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/00.Introduction/06.Interview-100-List.md)\n\n![100%](https://progress-bar.xyz/100)\n\n| No.  | Difficulty | Title | Solutions | | |\n| ---: | :--------: | :---- | :-------- | - | - |\n| 0054 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Spiral Matrix](https://leetcode.com/problems/spiral-matrix/) | [Python](./python/54.py) | [Rust](./rust/src/bin/54.rs) | |\n| 0048 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Rotate Image](https://leetcode.com/problems/rotate-image/) | [Python](./python/48.py) | | |\n| 0215 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array/) | [Python](./python/215.py) | | [C++](./cpp/215.cpp) |\n| 0912 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Sort an Array](https://leetcode.com/problems/kth-largest-element-in-an-array/) | [Python](./python/912.py) | | |\n| 0088 | \u003ceasy\u003e Easy \u003c/easy\u003e | [Merge Sorted Array](https://leetcode.com/problems/sort-an-array/) | [Python](./python/88.py) | | |\n| 0169 | \u003ceasy\u003e Easy \u003c/easy\u003e | [Majority Element](https://leetcode.com/problems/majority-element/) | [Python](./python/169.py) | | |\n| 0136 | \u003ceasy\u003e Easy \u003c/easy\u003e | [Single Number](https://leetcode.com/problems/single-number/) | [Python](./python/136.py) | | |\n| 0056 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Merge Intervals](https://leetcode.com/problems/merge-intervals/) | [Python](./python/56.py) | | |\n| 0179 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Largest Number](https://leetcode.com/problems/largest-number/) | [Python](./python/179.py) | | |\n| 0704 | \u003ceasy\u003e Easy \u003c/easy\u003e | [Binary Search](https://leetcode.com/problems/binary-search/) | [Python](./python/704.py) | | |\n| 0034 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Find First and Last Position of Element in Sorted Array](https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/) | [Python](./python/34.py) | | |\n| 0153 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/) | [Python](./python/153.py) | | |\n| 0033 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) | [Python](./python/33.py) | | |\n| 0162 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-peak-element/) | [Python](./python/162.py) | | |\n| 0004 | \u003chard\u003e Hard \u003c/hard\u003e | [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/) | [Python](./python/4.py) | | |\n| 0240 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Search a 2D Matrix II](https://leetcode.com/problems/search-a-2d-matrix-ii/) | [Python](./python/240.py) | | |\n| 0069 | \u003ceasy\u003e Easy \u003c/easy\u003e | [Sqrt(x)](https://leetcode.com/problems/sqrtx/) | [Python](./python/69.py) | | |\n| 0015 | \u003cmedium\u003e Medium \u003c/medium\u003e | [3Sum](https://leetcode.com/problems/3sum/) | [Python](./python/15.py) | | [C++](./cpp/15.cpp) |\n| 0283 | \u003ceasy\u003e Easy \u003c/easy\u003e | [Move Zeroes](https://leetcode.com/problems/move-zeroes/) | [Python](./python/283.py) | | |\n| 0415 | \u003ceasy\u003e Easy \u003c/easy\u003e | [Add Strings](https://leetcode.com/problems/add-strings/) | [Python](./python/415.py) | | |\n| 0239 | \u003chard\u003e Hard \u003c/hard\u003e | [Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum/) | [Python](./python/239.py) | | [C++](./cpp/239.cpp) |\n| 0003 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | [Python](./python/3.py) | [Rust](./rust/src/bin/3.rs) | |\n| 0076 | \u003chard\u003e Hard \u003c/hard\u003e | [Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring/) | [Python](./python/76.py) | | |\n| 0718 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Maximum Length of Repeated Subarray](https://leetcode.com/problems/maximum-length-of-repeated-subarray/) | [Python](./python/718.py) | | |\n| 0083 | \u003ceasy\u003e Easy \u003c/easy\u003e | [Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list/) | [Python](./python/83.py) | | |\n| 0082 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Remove Duplicates from Sorted List II](https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/) | [Python](./python/82.py) | | |\n| 0206 | \u003ceasy\u003e Easy \u003c/easy\u003e | [Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/) | [Python](./python/206.py) | [Rust](./rust/src/bin/206.rs) | [C++](./cpp/206.cpp) |\n| 0092 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Reverse Linked List II](https://leetcode.com/problems/reverse-linked-list-ii/) | [Python](./python/92.py) | [Rust](./rust/src/bin/92.rs) | |\n| 0025 | \u003chard\u003e Hard \u003c/hard\u003e | [Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group/) | [Python](./python/25.py) | | |\n| 0234 | \u003ceasy\u003e Easy \u003c/easy\u003e | [Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list/) | [Python](./python/234.py) | | |\n| 0148 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Sort List](https://leetcode.com/problems/sort-list/) | [Python](./python/148.py) | [Rust](./rust/src/bin/148.rs) | [C++](./cpp/148.cpp) |\n| 0021 | \u003ceasy\u003e Easy \u003c/easy\u003e | [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/) | [Python](./python/21.py) | [Rust](./rust/src/bin/21.rs) | |\n| 0023 | \u003chard\u003e Hard \u003c/hard\u003e | [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/) | [Python](./python/23.py) | | [C++](./cpp/23.cpp) |\n| 0141 | \u003ceasy\u003e Easy \u003c/easy\u003e | [Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/) | [Python](./python/141.py) | | [C++](./cpp/141.cpp) |\n| 0142 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Linked List Cycle II](https://leetcode.com/problems/linked-list-cycle-ii/) | [Python](./python/142.py) | | |\n| 0160 | \u003ceasy\u003e Easy \u003c/easy\u003e | [Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists/) | [Python](./python/160.py) | | |\n| 0019 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/) | [Python](./python/19.py) | | |\n| LCR 140 | \u003cmedium\u003e Medium \u003c/medium\u003e | [LCR 140. 训练计划 II](https://leetcode.cn/problems/lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof/description/) | [Python](./python/LCR140.py) | | |\n| 0143 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Reorder List](https://leetcode.com/problems/reorder-list/) | [Python](./python/143.py) | | |\n| 0002 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers/) | [Python](./python/2.py) | | |\n| 0155 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Min Stack](https://leetcode.com/problems/min-stack/) | [Python](./python/155.py) | | |\n| 0020 | \u003ceasy\u003e Easy \u003c/easy\u003e | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | [Python](./python/20.py) | | |\n| 0227 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Basic Calculator II](https://leetcode.com/problems/basic-calculator-ii/) | [Python](./python/227.py) | | |\n| 0232 | \u003ceasy\u003e Easy \u003c/easy\u003e | [Implement Queue using Stacks](https://leetcode.com/problems/implement-queue-using-stacks/) | [Python](./python/232.py) | | |\n| 0394 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Decode String](https://leetcode.com/problems/decode-string/) | [Python](./python/394.py) | | |\n| 0032 | \u003chard\u003e Hard \u003c/hard\u003e | [Longest Valid Parentheses](https://leetcode.com/problems/longest-valid-parentheses/) | [Python](./python/32.py) | | |\n| 0042 | \u003chard\u003e Hard \u003c/hard\u003e | [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/) | [Python](./python/42.py) | | |\n| 0225 | \u003ceasy\u003e Easy \u003c/easy\u003e | [Implement Stack using Queues](https://leetcode.com/problems/implement-stack-using-queues/) | [Python](./python/225.py) | | |\n| 0001 | \u003ceasy\u003e Easy \u003c/easy\u003e | [Two Sum](https://leetcode.com/problems/two-sum/) | [Python](./python/1.py) | | [C++](./cpp/1.cpp) |\n| 0041 | \u003chard\u003e Hard \u003c/hard\u003e | [First Missing Positive](https://leetcode.com/problems/first-missing-positive/) | [Python](./python/41.py) | [Rust](./rust/src/bin/41.rs) | |\n| 0128 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence/) | [Python](./python/128.py) | | [C++](./cpp/128.cpp) |\n| 0005 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/) | [Python](./python/5.py) | | |\n| 0151 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Reverse Words in a String](https://leetcode.com/problems/reverse-words-in-a-string/) | [Python](./python/151.py) | | |\n| 0043 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Multiply Strings](https://leetcode.com/problems/multiply-strings/) | [Python](./python/43.py) | | |\n| 0014 | \u003ceasy\u003e Easy \u003c/easy\u003e | [Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/) | [Python](./python/14.py) | | |\n| 0144 | \u003ceasy\u003e Easy \u003c/easy\u003e | [Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal/) | [Python](./python/144.py) | [Rust](./rust/src/bin/144.rs) | [C++](./cpp/144.cpp) |\n| 0094 | \u003ceasy\u003e Easy \u003c/easy\u003e | [Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal/) | [Python](./python/94.py) | [Rust](./rust/src/bin/94.rs) | [C++](./cpp/94.cpp) |\n| 0102 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/) | [Python](./python/102.py) | [Rust](./rust/src/bin/102.rs) | [C++](./cpp/102.cpp) |\n| 0103 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Binary Tree Zigzag Level Order Traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/) | [Python](./python/103.py) | | |\n| 0236 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Lowest Common Ancestor of a Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/) | [Python](./python/236.py) | | |\n| 0104 | \u003ceasy\u003e Easy \u003c/easy\u003e | [Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/) | [Python](./python/104.py) | | |\n| 0112 | \u003ceasy\u003e Easy \u003c/easy\u003e | [Path Sum](https://leetcode.com/problems/path-sum/) | [Python](./python/112.py) | | |\n| 0113 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Path Sum II](https://leetcode.com/problems/path-sum-ii/) | [Python](./python/113.py) | | |\n| 0101 | \u003ceasy\u003e Easy \u003c/easy\u003e | [Symmetric Tree](https://leetcode.com/problems/symmetric-tree/) | [Python](./python/101.py) | | |\n| 0124 | \u003chard\u003e Hard \u003c/hard\u003e | [Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum/) | [Python](./python/124.py) | | |\n| 0199 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view/) | [Python](./python/199.py) | | |\n| 0226 | \u003ceasy\u003e Easy \u003c/easy\u003e | [Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/) | [Python](./python/226.py) | | |\n| 0105 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/) | [Python](./python/105.py) | | |\n| 0098 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/) | [Python](./python/98.py) | | |\n| 0110 | \u003ceasy\u003e Easy \u003c/easy\u003e | [Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree/) | [Python](./python/110.py) | | |\n| 0200 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Number of Islands](https://leetcode.com/problems/number-of-islands/) | [Python](./python/200.py) | [Rust](./rust/src/bin/200.rs) | [C++](./cpp/200.cpp) |\n| 0695 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Max Area of Island](https://leetcode.com/problems/max-area-of-island/) | [Python](./python/695.py) | | |\n| 0129 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Sum Root to Leaf Numbers](https://leetcode.com/problems/sum-root-to-leaf-numbers/) | [Python](./python/129.py) | | |\n| 0543 | \u003ceasy\u003e Easy \u003c/easy\u003e | [Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree/) | [Python](./python/543.py) | | |\n| 0662 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Maximum Width of Binary Tree](https://leetcode.com/problems/maximum-width-of-binary-tree/) | [Python](./python/662.py) | | |\n| 0322 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Coin Change](https://leetcode.com/problems/coin-change/) | [Python](./python/322.py) | [Rust](./rust/src/bin/322.rs) | [C++](./cpp/322.cpp) |\n| 0070 | \u003ceasy\u003e Easy \u003c/easy\u003e | [Climbing Stairs](https://leetcode.com/problems/climbing-stairs/) | [Python](./python/70.py) | | |\n| 0121 | \u003ceasy\u003e Easy \u003c/easy\u003e | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | [Python](./python/121.py) | | |\n| 0300 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence/) | [Python](./python/300.py) | | |\n| 1143 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Longest Common Subsequence](https://leetcode.com/problems/longest-common-subsequence/) | [Python](./python/1143.py) | | |\n| 0064 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum/) | [Python](./python/64.py) | | |\n| 0072 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Edit Distance](https://leetcode.com/problems/edit-distance/) | [Python](./python/72.py) | | |\n| 0221 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Maximal Square](https://leetcode.com/problems/maximal-square/) | [Python](./python/221.py) | | |\n| 0062 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Unique Paths](https://leetcode.com/problems/unique-paths/) | [Python](./python/62.py) | | |\n| 0152 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray/) | [Python](./python/152.py) | | |\n| 0198 | \u003cmedium\u003e Medium \u003c/medium\u003e | [House Robber](https://leetcode.com/problems/house-robber/) | [Python](./python/198.py) | | |\n| 0078 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Subsets](https://leetcode.com/problems/subsets/) | [Python](./python/78.py) | | |\n| 0024 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs/) | [Python](./python/24.py) | | |\n| 0053 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) | [Python](./python/53.py) | | |\n| 0046 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Permutations](https://leetcode.com/problems/permutations/) | [Python](./python/46.py) | | |\n| 0022 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Generate Parentheses](https://leetcode.com/problems/generate-parentheses/) | [Python](./python/22.py) | | |\n| 0039 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Combination Sum](https://leetcode.com/problems/combination-sum/) | [Python](./python/39.py) | | |\n| 0093 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Restore IP Addresses](https://leetcode.com/problems/restore-ip-addresses/) | [Python](./python/93.py) | | |\n| 0122 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/) | [Python](./python/122.py) | | |\n| 0146 | \u003cmedium\u003e Medium \u003c/medium\u003e | [LRU Cache](https://leetcode.com/problems/lru-cache/) | [Python](./python/146.py) | | |\n| 0008 | \u003cmedium\u003e Medium \u003c/medium\u003e | [String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi/) | [Python](./python/8.py) | | |\n| 0165 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Compare Version Numbers](https://leetcode.com/problems/compare-version-numbers/) | [Python](./python/165.py) | | |\n| 0468 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Validate IP Address](https://leetcode.com/problems/validate-ip-address/) | [Python](./python/468.py) | | |\n| 0031 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Next Permutation](https://leetcode.com/problems/next-permutation/) | [Python](./python/31.py) | | |\n| 0470 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Implement Rand10() Using Rand7()](https://leetcode.com/problems/implement-rand10-using-rand7/) | [Python](./python/470.py) | | |\n\n## Leetcode Daily Questions\n\n| Date  | No. | Difficulty | Title | Solutions |\n| :---: | :---: | :--------: | :---- | :-------- |\n| 2024-11-11 | 2601 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Prime Subtraction Operation](https://leetcode.com/problems/prime-subtraction-operation/) | [Python](./python/2601.py) |\n| 2024-11-12 | 2070 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Most Beautiful Item for Each Query](https://leetcode.com/problems/most-beautiful-item-for-each-query/) | [Python](./python/2070.py) |\n| 2024-11-14 | 2064 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Minimized Maximum of Products Distributed to Any Store](https://leetcode.com/problems/minimized-maximum-of-products-distributed-to-any-store/) | [Python](./python/2064.py) |\n| 2024-11-15 | 1574 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Shortest Subarray to be Removed to Make Array Sorted](https://leetcode.com/problems/shortest-subarray-to-be-removed-to-make-array-sorted/) | [Python](./python/1574.py) |\n| 2024-11-16 | 3254 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Find the Power of K-Size Subarrays I](https://leetcode.com/problems/find-the-power-of-k-size-subarrays-i/) | [Python](./python/3254.py) |\n| 2024-11-19 | 2461 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Maximum Sum of Distinct Subarrays With Length K](https://leetcode.com/problems/maximum-sum-of-distinct-subarrays-with-length-k/description/?envType=daily-question\u0026envId=2024-11-19) | [Python](./python/2461.py) |\n| 2024-11-20 | 2516 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Take K of Each Character From Left and Right](https://leetcode.com/problems/take-k-of-each-character-from-left-and-right/description/?envType=daily-question\u0026envId=2024-11-20) | [Python](./python/2516.py) |\n| 2024-11-21 | 2257 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Count Unguarded Cells in the Grid](https://leetcode.com/problems/count-unguarded-cells-in-the-grid/description/?envType=daily-question\u0026envId=2024-11-21) | [Python](./python/2517.py) |\n| 2024-11-23 | 1861 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Rotating the Box](https://leetcode.com/problems/rotating-the-box/description/?envType=daily-question\u0026envId=2024-11-23) | [Python](./python/1861.py) |\n\u003c!-- | 2024-11-22 | 1072 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Flip Columns For Maximum Number of Equal Rows](https://leetcode.com/problems/flip-columns-for-maximum-number-of-equal-rows/description/?envType=daily-question\u0026envId=2024-11-22) | [Python](./python/1072.py) | --\u003e\n\n## Others\n\n| No.  | Difficulty | Title | Solutions | | |\n| :--- | :--------: | :---- | :-------- | - | - |\n| 0167 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Two Sum II - Input Array Is Sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/) | [Python](./python/167.py) |  |  |\n| 0516 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Longest Palindromic Subsequence](https://leetcode.com/problems/longest-palindromic-subsequence/) | [Python](./python/516.py) | [Rust](./rust/src/bin/516.rs) |  |\n| 0767 | \u003cmedium\u003e Medium \u003c/medium\u003e | [Reorganize String](https://leetcode.com/problems/reorganize-string/) | [Python](./python/767.py) | | |\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fagainstentropy%2Fmyleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fagainstentropy%2Fmyleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fagainstentropy%2Fmyleetcode/lists"}