{"id":24550095,"url":"https://github.com/wenjin1997/rust-leetcode","last_synced_at":"2025-10-15T17:40:51.338Z","repository":{"id":45790988,"uuid":"509358239","full_name":"wenjin1997/rust-leetcode","owner":"wenjin1997","description":"用rust刷LeetCode代码及笔记。","archived":false,"fork":false,"pushed_at":"2022-10-26T05:08:56.000Z","size":363,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"main","last_synced_at":"2025-03-16T12:46:33.243Z","etag":null,"topics":["leetcode"],"latest_commit_sha":null,"homepage":"","language":"Rust","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/wenjin1997.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":"2022-07-01T07:18:04.000Z","updated_at":"2022-08-13T11:38:29.000Z","dependencies_parsed_at":"2023-01-20T16:47:28.866Z","dependency_job_id":null,"html_url":"https://github.com/wenjin1997/rust-leetcode","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/wenjin1997/rust-leetcode","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/wenjin1997%2Frust-leetcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/wenjin1997%2Frust-leetcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/wenjin1997%2Frust-leetcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/wenjin1997%2Frust-leetcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/wenjin1997","download_url":"https://codeload.github.com/wenjin1997/rust-leetcode/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/wenjin1997%2Frust-leetcode/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":279096740,"owners_count":26102644,"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-10-15T02:00:07.814Z","response_time":56,"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":["leetcode"],"created_at":"2025-01-23T00:28:22.837Z","updated_at":"2025-10-15T17:40:51.295Z","avatar_url":"https://github.com/wenjin1997.png","language":"Rust","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Rust算法\n- [ ] 总进度条 72/183 剩余 111\n\n  ✅✅✅✅✅✅✅✅✅✅✅✅✅✅✅✅✅✅✅✅✅✅✅✅✅✅✅✅✅✅\n\n  ✅✅✅✅✅✅✅✅✅✅✅✅✅✅✅✅✅✅✅✅✅✅✅✅✅✅✅✅✅✅\n\n  ✅✅✅✅✅✅✅✅✅✅✅✅⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️\n\n  ⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️\n\n  ⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️\n\n  ⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️\n\n  ⬜️⬜️⬜️\n\n- [x] 数组 5/5\n\n  - [x] [704. Binary Search](https://leetcode.com/problems/binary-search) 🌸\n  - [x] [27. Remove Element](https://leetcode.com/problems/remove-element)  🌟\n  - [x] [977. Squares of a Sorted Array](https://leetcode.com/problems/squares-of-a-sorted-array) 🌟\n  - [x] [209. Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum) 🌟\n  - [x] [59. Spiral Matrix II](https://leetcode.com/problems/spiral-matrix-ii)  🌟\n\n- [ ] 链表 8/9\n\n  - [x] [203. Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements) 🌟🌟\n  - [x] [707. Design Linked List](https://leetcode.com/problems/design-linked-list) 🌟\n  - [x] [206. Reverse Linked List ](https://leetcode.com/problems/reverse-linked-list) ⭐️🌟\n  - [x] [24. Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs)  ⭐️\n  - [x] [19. Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list) 🌟\n  - [ ] [面试题 02.07. 链表相交](https://leetcode.cn/problems/intersection-of-two-linked-lists-lcci/)\n  - [x] [142. Linked List Cycle II](https://leetcode.com/problems/linked-list-cycle-ii) 🌟\n  - [x] [141. Linked List Cycle](https://leetcode.com/problems/linked-list-cycle)  🌸\n  - [x] [92. Reverse Linked List II](https://leetcode.com/problems/reverse-linked-list-ii/description/) ✨\n\n- [ ] 哈希表 5/8\n\n  - [x] [242. Valid Anagram](https://leetcode.com/problems/valid-anagram) ✨\n  - [x] [349. Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays) 🌥\n  - [x] [202. Happy Number](https://leetcode.com/problems/happy-number) 🌸\n  - [x] [1. Two Sum](https://leetcode.com/problems/two-sum)  🌟\n  - [ ] [454. 4Sum II](https://leetcode.com/problems/4sum-ii)\n  - [ ] [383. Ransom Note](https://leetcode.com/problems/ransom-note)\n  - [x] [15. 3Sum](https://leetcode.com/problems/3sum)🌟\n  - [ ] [18. 4Sum](https://leetcode.com/problems/4sum)\n\n- [ ] 字符串 1/7\n\n  - [x] [344. Reverse String](https://leetcode.com/problems/reverse-string) 🌸\n  - [x] [541. Reverse String II](https://leetcode.com/problems/reverse-string-ii)\n  - [ ] [剑指 Offer 05. 替换空格](https://leetcode.cn/problems/ti-huan-kong-ge-lcof/)\n  - [ ] [151. Reverse Words in a String](https://leetcode.com/problems/reverse-words-in-a-string)\n  - [ ] [剑指 Offer 58 - II. 左旋转字符串](https://leetcode.cn/problems/zuo-xuan-zhuan-zi-fu-chuan-lcof/)\n  - [ ] [28. Implement strStr()](https://leetcode.com/problems/implement-strstr)\n  - [ ] [459. Repeated Substring Pattern](https://leetcode.com/problems/repeated-substring-pattern)\n\n- [ ] 双指针法 1/10\n\n  - [ ] [27. Remove Element](https://leetcode.com/problems/remove-element)\n  - [x] [344. Reverse String](https://leetcode.com/problems/reverse-string)\n  - [ ] [剑指 Offer 05. 替换空格](https://leetcode.cn/problems/ti-huan-kong-ge-lcof/)\n  - [ ] [151. Reverse Words in a String](https://leetcode.com/problems/reverse-words-in-a-string)\n  - [x] [206. Reverse Linked List ](https://leetcode.com/problems/reverse-linked-list) ⭐️\n  - [ ] [19. Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list)\n  - [ ] [面试题 02.07. 链表相交](https://leetcode.cn/problems/intersection-of-two-linked-lists-lcci/)\n  - [ ] [142. Linked List Cycle II](https://leetcode.com/problems/linked-list-cycle-ii)\n  - [ ] [15. 3Sum](https://leetcode.com/problems/3sum)\n  - [ ] [18. 4Sum](https://leetcode.com/problems/4sum)\n\n- [ ] 栈与队列 3/7🌟\n\n  - [ ] [232. Implement Queue using Stacks](https://leetcode.com/problems/implement-queue-using-stacks)\n  - [ ] [225. Implement Stack using Queues](https://leetcode.com/problems/implement-stack-using-queues)\n  - [x] [20. Valid Parentheses](https://leetcode.com/problems/valid-parentheses) 🌟🌸\n  - [ ] [1047. Remove All Adjacent Duplicates In String](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string)\n  - [ ] [150. Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation)\n  - [x] [239. Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum)\n  - [x] [347. Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements)  ✨\n  - [x] [215. Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array/) 🌟\n\n- [ ] [二叉树](/algorithms-summary/binary_tree.md) 8/42\n\n  - [x] [144. Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal) 🌟🌟\n  - [x] [94. Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal) 🔥🌟\n  - [x] [145. Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal) 🌟\n  - [x] [102. Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/description/) 🔥🌟\n  - [x] [107. Binary Tree Level Order Traversal II](https://leetcode.com/problems/binary-tree-level-order-traversal-ii/description/) 🌸\n  - [x] [199. Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view/description/) 🔥🌸\n  - [x] [637. Average of Levels in Binary Tree](https://leetcode.com/problems/average-of-levels-in-binary-tree/) 🌸\n  - [ ] 429\n  - [ ] 515\n  - [ ] 116\n  - [ ] 117\n  - [ ] 104 🔥\n  - [ ] 111\n  - [x] [226. Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/) 🔥🌟\n  - [ ] 101 🔥\n  - [ ] 222\n  - [ ] 110\n  - [ ] 257\n  - [ ] 404\n  - [ ] 513\n  - [ ] 112\n  - [ ] 106\n  - [ ] 654\n  - [ ] 617\n  - [ ] 700\n  - [ ] 98 🔥\n  - [ ] 530\n  - [ ] 501\n  - [ ] 236 🔥\n  - [ ] 235\n  - [ ] 701\n  - [ ] 450\n  - [ ] 669\n  - [ ] 108\n  - [ ] 538\n  - [ ] 543 🔥\n  - [ ] 96 🔥\n  - [ ] 105 🔥\n  - [ ] 114 🔥\n  - [ ] 230 🔥\n  - [ ] 437 🔥\n  - [ ] 124 🔥\n\n- [ ] 回溯算法 1/16\n\n  - [ ] [77. Combinations](https://leetcode.com/problems/combinations)\n  - [ ] [216. Combination Sum III](https://leetcode.com/problems/combination-sum-iii)\n  - [ ] [17. Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number)\n  - [ ] [39. Combination Sum](https://leetcode.com/problems/combination-sum)\n  - [ ] [40. Combination Sum II](https://leetcode.com/problems/combination-sum-ii)\n  - [ ] [131. Palindrome Partitioning](https://leetcode.com/problems/palindrome-partitioning)\n  - [ ] [93. Restore IP Addresses](https://leetcode.com/problems/restore-ip-addresses)\n  - [ ] [78. Subsets](https://leetcode.com/problems/subsets)\n  - [ ] [90. Subsets II](https://leetcode.com/problems/subsets-ii)\n  - [ ] [491. Increasing Subsequences](https://leetcode.com/problems/increasing-subsequences)\n  - [ ] [46. Permutations](https://leetcode.com/problems/permutations)\n  - [ ] [47. Permutations II](https://leetcode.com/problems/permutations-ii)\n  - [ ] [332. Reconstruct Itinerary](https://leetcode.com/problems/reconstruct-itinerary)\n  - [ ] [51. N-Queens](https://leetcode.com/problems/n-queens)\n  - [ ] [37. Sudoku Solver](https://leetcode.com/problems/sudoku-solver)\n  - [x] [22. Generate Parentheses](https://leetcode.com/problems/generate-parentheses)\n\n- [ ] 贪心算法 2/18\n\n  - [ ] [455. Assign Cookies](https://leetcode.com/problems/assign-cookies)\n  - [ ] [376. Wiggle Subsequence](https://leetcode.com/problems/wiggle-subsequence)\n  - [ ] [53. Maximum Subarray](https://leetcode.com/problems/maximum-subarray)\n  - [ ] [122. Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/description/)\n  - [x] [55. Jump Game](https://leetcode.com/problems/jump-game)\n  - [x] [45. Jump Game II](https://leetcode.com/problems/jump-game-ii)\n  - [ ] [1005. Maximize Sum Of Array After K Neg](https://leetcode.com/problems/maximize-sum-of-array-after-k-negations)\n  - [ ] [134. Gas Station](https://leetcode.com/problems/gas-station)\n  - [ ] [135. Candy](https://leetcode.com/problems/candy)\n  - [ ] [860. Lemonade Change](https://leetcode.com/problems/lemonade-change)\n  - [ ] [406. Queue Reconstruction by Height](https://leetcode.com/problems/queue-reconstruction-by-height)\n  - [ ] [452. Minimum Number of Arrows to Burst Balloons](https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons)\n  - [ ] [435. Non-overlapping Intervals](https://leetcode.com/problems/non-overlapping-intervals)\n  - [ ] [763. Partition Labels](https://leetcode.com/problems/partition-labels)\n  - [ ] [56. Merge Intervals](https://leetcode.com/problems/merge-intervals)\n  - [ ] [738. Monotone Increasing Digits](https://leetcode.com/problems/monotone-increasing-digits)\n  - [ ] [714. Best Time to Buy and Sell Stock with Transaction Fee](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee)\n  - [ ] [968. Binary Tree Cameras](https://leetcode.com/problems/binary-tree-cameras)\n\n- [ ] 动态规划 18/42\n\n  - [ ] [509. Fibonacci Number](https://leetcode.com/problems/fibonacci-number)\n  - [x] [70. Climbing Stairs](https://leetcode.com/problems/climbing-stairs)\n  - [ ] [746. Min Cost Climbing Stairs](https://leetcode.com/problems/min-cost-climbing-stairs)\n  - [x] [62. Unique Paths](https://leetcode.com/problems/unique-paths)\n  - [ ] [63. Unique Paths II](https://leetcode.com/problems/unique-paths-ii)\n  - [ ] [343. Integer Break](https://leetcode.com/problems/integer-break)\n  - [ ] [96. Unique Binary Search Trees](https://leetcode.com/problems/unique-binary-search-trees)\n  - [ ] [416. Partition Equal Subset Sum](https://leetcode.com/problems/partition-equal-subset-sum)\n  - [ ] [1049. Last Stone Weight II](https://leetcode.com/problems/last-stone-weight-ii)\n  - [ ] [494. Target Sum](https://leetcode.com/problems/target-sum)\n  - [ ] [474. Ones and Zeroes](https://leetcode.com/problems/ones-and-zeroes)\n  - [ ] [518. Coin Change 2](https://leetcode.com/problems/coin-change-2)\n  - [ ] [377. Combination Sum IV](https://leetcode.com/problems/combination-sum-iv)\n  - [x] [322. Coin Change](https://leetcode.com/problems/coin-change) 🌸\n  - [ ] [279. Perfect Squares](https://leetcode.com/problems/perfect-squares)\n  - [ ] [139. Word Break](https://leetcode.com/problems/word-break)\n  - [x] [198. House Robber](https://leetcode.com/problems/house-robber)  🌸\n  - [ ] [213. House Robber II](https://leetcode.com/problems/house-robber-ii)\n  - [ ] [337. House Robber III](https://leetcode.com/problems/house-robber-iii)\n  - [x] 股票买卖问题 6/6\n\n    - [x] [121. Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock)\n    - [x] [122. Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/description/)\n    - [x] [123. Best Time to Buy and Sell Stock III](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/description/)\n    - [x] [188. Best Time to Buy and Sell Stock IV](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/description/)\n    - [x] [309. Best Time to Buy and Sell Stock with Cooldown](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/description/)\n    - [x] [714. Best Time to Buy and Sell Stock with Transaction Fee](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee)\n  - [x] [300. Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence)  \n  - [ ] [674. Longest Continuous Increasing Sub](https://leetcode.com/problems/longest-continuous-increasing-subsequence)\n  - [ ] [718. Maximum Length of Repeated Sub](https://leetcode.com/problems/maximum-length-of-repeated-subarray)\n  - [ ] [1143. Longest Common Subsequence](https://leetcode.com/problems/longest-common-subsequence)\n  - [ ] [1035. Uncrossed Lines](https://leetcode.com/problems/uncrossed-lines)\n  - [x] [53. Maximum Subarray](https://leetcode.com/problems/maximum-subarray)\n  - [ ] [392. Is Subsequence](https://leetcode.com/problems/is-subsequence)\n  - [ ] [115. Distinct Subsequences](https://leetcode.com/problems/distinct-subsequences)\n  - [ ] [583. Delete Operation for Two Strings](https://leetcode.com/problems/delete-operation-for-two-strings)\n  - [x] [72. Edit Distance](https://leetcode.com/problems/edit-distance)  \n  - [ ] [647. Palindromic Substrings](https://leetcode.com/problems/palindromic-substrings)\n  - [ ] [516. Longest Palindromic Subsequence](https://leetcode.com/problems/longest-palindromic-subsequence)\n  - [x] [5. Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring)\n  - [x] [120. Triangle](https://leetcode.com/problems/triangle/description/)\n  - [x] [64. Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum) 🌸\n  - [x] [152. Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray)\n  - [x] [91. Decode Ways](https://leetcode.com/problems/decode-ways/) 🌟\n\n- [ ] 单调栈 0/5\n\n  - [ ] [739. Daily Temperatures](https://leetcode.com/problems/daily-temperatures)\n  - [ ] [496. Next Greater Element I](https://leetcode.com/problems/next-greater-element-i)\n  - [ ] [503. Next Greater Element II](https://leetcode.com/problems/next-greater-element-ii)\n  - [ ] [42. Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water)\n  - [ ] [84. Largest Rectangle in Histogram](https://leetcode.com/problems/largest-rectangle-in-histogram)\n\n- [x] [二分搜索](/algorithms-summary/binary%20search.md) 9/9\n\n  - [x] [4. Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays)\n  - [x] [33. Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array)\n  - [x] [34. Find First and Last Position of Element in So](https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array)\n  - [x] [35. Search Insert Position](https://leetcode.com/problems/search-insert-position)  \n  - [x] [74. Search a 2D Matrix](https://leetcode.com/problems/search-a-2d-matrix)\n  - [x] [153. Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/)\n  - [x] [240. Search a 2D Matrix II](https://leetcode.com/problems/search-a-2d-matrix-ii)\n  - [x] [287. Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number)\n  - [x] [704. Binary Search](https://leetcode.com/problems/binary-search)\n\n- [x] 滑动窗口 3/3\n  - [x] [3. Longest Substring Without Repeating Characters](/leetcode/notes/3.%20Longest%20Substring%20Without%20Repeating%20Characters.md)\n  - [x] [438. Find All Anagrams in a String](/leetcode/notes/438.%20Find%20All%20Anagrams%20in%20a%20String.md)\n  - [x] [239. Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum/)\n\n- [x] 图 1/1\n  - [x] 环检测算法 1/1\n    - [x] [287. Find the Duplicate Number](/leetcode/notes/287.%20Find%20the%20Duplicate%20Number.md)\n\n- [x] Negative marking 1/1\n  - [x] [287. Find the Duplicate Number](/leetcode/notes/287.%20Find%20the%20Duplicate%20Number.md)\n\n- [x] 记忆化搜索 1/1\n\n  - [x] [397. Integer Replacement](https://leetcode.com/problems/integer-replacement/) ✨\n\n\n符号说明：\n\n* 🔥 [Top 100 Liked Questions](https://leetcode.com/problem-list/top-100-liked-questions/?sorting=W3t9XQ%3D%3D)\n* 🌟 还需掌握\n* 🌸 已独立写出\n\n## LeetCode\n\n| 🔗                                           | 📒           | Rust                                                                                   | Python3 | Java |\n| ----------- | ----------- |----------------------------------------------------------------------------------------| ----------- | ----------- |\n| [1](https://leetcode.com/problems/two-sum/) | [Two Sum](/leetcode/notes/0001~0099/0001.%20Two%20Sum.md) | [Rust](/leetcode/src/rust/1.two-sum.rs)                                                | [Python3](/leetcode/src/python3/1.two-sum.py) | [Java](/leetcode/src/java/1.two-sum.java) |\n| [2](https://leetcode.com/problems/add-two-numbers/) | Add Two Numbers |  |  | [Java]() |\n| [3](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | [Longest Substring Without Repeating Characters](/leetcode/notes/0001~0099/0003.%20Longest%20Substring%20Without%20Repeating%20Characters.md) |                                                                                        |  |  |\n| [4](https://leetcode.com/problems/median-of-two-sorted-arrays/) | [Median of Two Sorted Arrays](/leetcode/notes/0001~0099/0004.%20Median%20of%20Two%20Sorted%20Arrays.md) |                                                                                        |  |  |\n| [5](https://leetcode.com/problems/longest-palindromic-substring) | Longest Palindromic Substring | [Rust](/leetcode/src/rust/5.longest-palindromic-substring.rs)                          |  | |\n| [15](https://leetcode.com/problems/3sum) | [3Sum](/leetcode/notes/0001~0099/0015.%203Sum.md) | [Rust](/leetcode/src/rust/15.3-sum.rs)                                                 | | |\n| [19](https://leetcode.com/problems/remove-nth-node-from-end-of-list/description/) | Remove Nth Node From End of List | [Rust](/leetcode/src/rust/19.remove-nth-node-from-end-of-list.rs)                      | [Python3](/leetcode/src/python3/19.remove-nth-node-from-end-of-list.py) | |\n| [20](https://leetcode.com/problems/valid-parentheses/description/) | [Valid Parentheses](/leetcode/notes/0001~0099/0020.%20Valid%20Parentheses.md) | [Rust](/leetcode/src/rust/20.valid-parentheses.rs)                                     |  | |\n| [22](https://leetcode.com/problems/generate-parentheses/) | Generate Parentheses | [Rust]()                                                                               |  | |\n| [24](https://leetcode.com/problems/swap-nodes-in-pairs) | Swap Nodes in Pairs | [Rust](/leetcode/src/rust/24.swap-nodes-in-pairs.rs)                                   | [Python3](/leetcode/src/python3/24.swap-nodes-in-pairs.py) | [Java](/leetcode/src/java/24.swap-nodes-in-pairs.java) |\n| [25](https://leetcode.com/problems/reverse-nodes-in-k-group/description/) | Reverse Nodes in k-Group |  |  | [Java](/leetcode/src/java/25.reverse-nodes-in-k-group.java) |\n| [26](https://leetcode.com/problems/remove-duplicates-from-sorted-array/description/) | Remove Duplicates from Sorted Array |  |  | [Java](/leetcode/src/java/26.remove-duplicates-from-sorted-array.java) |\n| [27](https://leetcode.com/problems/remove-element) | Remove Element | [Rust](/leetcode/src/rust/27.remove-element.rs)                                        |  |[Java](/leetcode/src/java/27.remove-element.java)  |\n| [33](https://leetcode.com/problems/search-in-rotated-sorted-array/) | [Search in Rotated Sorted Array](/leetcode/notes/0001~0099/0033.%20Search%20in%20Rotated%20Sorted%20Array.md) |                                                                                        |  |  |\n| [34](https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/) | [Find First and Last Position of Element in Sorted Array](/leetcode/notes/0001~0099/0034.%20Find%20First%20and%20Last%20Position%20of%20Element%20in%20Sorted%20Array.md) |                                                                                        |  |  |\n| [35](https://leetcode.com/problems/search-insert-position/) | [ Search Insert Position](/leetcode/notes/0001~0099/0035.%20Search%20Insert%20Position.md) | [Rust](/leetcode/src/rust/35.search-insert-position.rs)                                |  |  |\n| [45]() | Jump Game II | [Rust](/leetcode/src/rust/45.jump-game-ii.rs)                                          |  | |\n| [53](https://leetcode.com/problems/maximum-subarray/description/) | Maximum Subarray | [Rust](/leetcode/src/rust/53.maximum-subarray.rs)                                      |  | |\n| [55](https://leetcode.com/problems/jump-game/description/) | Jump Game | [Rust](/leetcode/src/rust/55.jump-game.rs)                                             |  | |\n| [59](https://leetcode.com/problems/spiral-matrix-ii) | Spiral Matrix II | [Rust](/leetcode/src/rust/59.spiral-matrix-ii.rs)                                      |  | |\n| [62](https://leetcode.com/problems/unique-paths/description/) | Unique Paths | [Rust](/leetcode/src/rust/62.unique-paths.rs)                                          |  | |\n| [64](https://leetcode.com/problems/minimum-path-sum/description/) | Minimum Path Sum | [Rust](/leetcode/src/rust/64.minimum-path-sum.rs)                                      |  | |\n| [70](https://leetcode.com/problems/climbing-stairs/) | Climbing Stairs | [Rust](/leetcode/src/rust/70.climbing-stairs.rs)                                       |  | |\n| [72](https://leetcode.com/problems/edit-distance) | Edit Distance | [Rust](/leetcode/src/rust/72.edit-distance.rs)                                         |  | |\n| [74](https://leetcode.com/problems/search-a-2d-matrix/) | [Search a 2D Matrix](/leetcode/notes/0001~0099/0074.%20Search%20a%202D%20Matrix.md) |                                                                                        |  |  |\n| [83](https://leetcode.com/problems/remove-duplicates-from-sorted-list/description/) | Remove Duplicates from Sorted List | | | [Java](/leetcode/src/java/83.remove-duplicates-from-sorted-list.java) |\n| [91](https://leetcode.com/problems/decode-ways/) | Decode Ways | | | [Java](/leetcode/src/java/91.decode-ways.java) |\n| [92](https://leetcode.com/problems/reverse-linked-list-ii/description/) | Reverse Linked List II | | | [Java](/leetcode/src/java/92.reverse-linked-list-ii.java) |\n| [94](https://leetcode.com/problems/binary-tree-inorder-traversal) | Binary Tree Inorder Traversal | [Rust](/leetcode/src/rust/94.binary-tree-inorder-traversal.rs)                         | | |\n| [102](https://leetcode.com/problems/binary-tree-level-order-traversal/description/) | Binary Tree Level Order Traversal | [Rust](/leetcode/src/rust/102.binary-tree-level-order-traversal.rs)                    | | |\n| [107](https://leetcode.com/problems/binary-tree-level-order-traversal-ii/description/) | Binary Tree Level Order Traversal II | [Rust](/leetcode/src/rust/107.binary-tree-level-order-traversal-ii.rs)                 | | |\n| [120](https://leetcode.com/problems/triangle/description/) | Triangle | [Rust](/leetcode/src/rust/120.triangle.rs)                                             |  | |\n| [121](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | [Best Time to Buy and Sell Stock](/leetcode/notes/0100~0199/0121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.md) | [Rust](/leetcode/src/rust/121.best-time-to-buy-and-sell-stock.rs)                      |  |  |\n| [122](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/description/) | Best Time to Buy and Sell Stock II | [Rust](/leetcode/src/rust/122.best-time-to-buy-and-sell-stock-ii.rs)                   |  | |\n| [123](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/description/) | Best Time to Buy and Sell Stock III | [Rust](/leetcode/src/rust/123.best-time-to-buy-and-sell-stock-iii.rs)                  |  | |\n| [141](https://leetcode.com/problems/linked-list-cycle) | Linked List Cycle |                                                                                        | [Python3](/leetcode/src/python3/141.linked-list-cycle.py) | [Java](/leetcode/src/java/141.linked-list-cycle.java) |\n| [142](https://leetcode.com/problems/linked-list-cycle-ii/description/) | Linked List Cycle II |                                                                                        | [Python3](/leetcode/src/python3/142.linked-list-cycle-ii.py) |  |\n| [144](https://leetcode.com/problems/binary-tree-preorder-traversal) | Binary Tree Preorder Traversal | [Rust](/leetcode/src/rust/144.binary-tree-preorder-traversal.rs)                       |  | |\n| [145](https://leetcode.com/problems/binary-tree-postorder-traversal) | Binary Tree Postorder Traversal | [Rust](/leetcode/src/rust/145.binary-tree-postorder-traversal.rs)                      | | |\n| [152](https://leetcode.com/problems/maximum-product-subarray/description/) | Maximum Product Subarray | [Rust](/leetcode/src/rust/152.maximum-product-subarray.rs)                             |  | |\n| [153](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/) | [Find Minimum in Rotated Sorted Array](/leetcode/notes/0100~0199/0153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.md) |                                                                                        |  |  |\n| [188](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/description/) | Best Time to Buy and Sell Stock IV | [Rust]()                                                                               |  | |\n| [198](https://leetcode.com/problems/house-robber/description/) | House Robber | [Rust](/leetcode/src/rust/198.house-robber.rs)                                         |  | |\n| [199](https://leetcode.com/problems/binary-tree-right-side-view/description/) | Binary Tree Right Side View | [Rust](/leetcode/src/rust/199.binary-tree-right-side-view.rs)                          | | |\n| [202](https://leetcode.com/problems/happy-number/) | Happy Number | [Rust](/leetcode/src/rust/202.happy-number.rs)                                         | | |\n| [203](https://leetcode.com/problems/remove-linked-list-elements/) | Remove Linked List Elements | [Rust](/leetcode/src/rust/203.remove-linked-list-elements.rs)                          | |[Java](leetcode/src/java/203.remove-linked-list-elements.java) |\n| [206](https://leetcode.com/problems/reverse-linked-list/description/) | Reverse Linked List | [Rust](/leetcode/src/rust/206.reverse-linked-list.rs)                                  |  |[Java](leetcode/src/java/206.reverse-linked-list.java) |\n| [209](https://leetcode.com/problems/minimum-size-subarray-sum) | Minimum Size Subarray Sum | [Rust](/leetcode/src/rust/209.minimum-size-subarray-sum.rs)                            |  | |\n| [215](https://leetcode.com/problems/kth-largest-element-in-an-array/) | Kth Largest Element in an Array |  | | [Java](/leetcode/src/java/215.kth-largest-element-in-an-array.java) |\n| [226](https://leetcode.com/problems/invert-binary-tree/) | Invert Binary Tree | [Rust](/leetcode/src/rust/226.%20Invert%20Binary%20Tree.rs)                                                                              | | |\n| [239](https://leetcode.com/problems/sliding-window-maximum/) | Sliding Window Maximum | [Rust](/leetcode/src/rust/239.sliding-window-maximum.rs)                               |  |  |\n| [240](https://leetcode.com/problems/search-a-2d-matrix-ii/) | [Search a 2D Matrix II](/leetcode/notes/0200~0299/0240.%20Search%20a%202D%20Matrix%20II.md) |                                                                                        |  |  |\n| [242](https://leetcode.com/problems/valid-anagram/) | Valid Anagram | [Rust](/leetcode/src/rust/242.valid-anagram.rs)                                        | | |\n| [283](https://leetcode.com/problems/move-zeroes/) | Move Zeroes |  | | [Java](/leetcode/src/java/283.move-zeroes.java) |\n| [287](https://leetcode.com/problems/find-the-duplicate-number/) | [Find the Duplicate Number](/leetcode/notes/0200~0299/0287.%20Find%20the%20Duplicate%20Number.md) |                                                                                        |  |  |\n| [300](https://leetcode.com/problems/longest-increasing-subsequence/description/) | Longest Increasing Subsequence | [Rust](/leetcode/src/rust/300.longest-increasing-subsequence.rs)                       |  | |\n| [303](https://leetcode.com/problems/range-sum-query-immutable/description/) | Range Sum Query - Immutable |  | | [Java](/leetcode/src/java/303.range-sum-query-immutable.java) |\n| [304](https://leetcode.com/problems/range-sum-query-2d-immutable/description/) | Range Sum Query 2D - Immutable | | | [Java](/leetcode/src/java/304.range-sum-query-2-d-immutable.java) |\n| [309](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/description/) | Best Time to Buy and Sell Stock with Cooldown | [Rust](/leetcode/src/rust/309.best-time-to-buy-and-sell-stock-with-cooldown.rs)        |  | |\n| [322](https://leetcode.com/problems/coin-change/description/) | Coin Change | [Rust](/leetcode/src/rust/322.coin-change.rs)                                          |  | |\n| [344](https://leetcode.com/problems/reverse-string/description/) | Reverse String | [Rust](/leetcode/src/rust/344.reverse-string.rs)                                       | | [Java](/leetcode/src/java/344.reverse-string.java) |\n| [347](https://leetcode.com/problems/top-k-frequent-elements/) | [Top K Frequent Elements](/leetcode/notes/0300~0399/0347.%20Top%20K%20Frequent%20Elements.md) | [Rust](/leetcode/src/rust/347.top-k-frequent-elements.rs)                              | | |\n| [349](https://leetcode.com/problems/intersection-of-two-arrays/) | Intersection of Two Arrays | [Rust](/leetcode/src/rust/349.intersection-of-two-arrays.rs)                           | | |\n| [397](https://leetcode.com/problems/integer-replacement/) | Integer Replacement |  | | [Java](/leetcode/src/java/397.integer-replacement.java) |\n| [438](https://leetcode.com/problems/find-all-anagrams-in-a-string/) | [Find All Anagrams in a String](/leetcode/notes/0400~0499/0438.%20Find%20All%20Anagrams%20in%20a%20String.md) |                                                                                        |  |  |\n| [541](https://leetcode.com/problems/reverse-string-ii) | Reverse String II | | | [Java](/leetcode/src/java/541.reverse-string-ii.java) |\n| [637](https://leetcode.com/problems/average-of-levels-in-binary-tree/) | Average of Levels in Binary Tree | [Rust](/leetcode/src/rust/637.%20Average%20of%20Levels%20in%20Binary%20Tree.rs) | | |\n| [704](https://leetcode.com/problems/binary-search) | Binary Search | [Rust](/leetcode/src/rust/704.binary-search.rs)                                        |  | |\n| [707](https://leetcode.com/problems/design-linked-list/) | Design Linked List | [Rust](/leetcode/src/rust/707.design-linked-list.rs)                                   | | |\n| [714](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/description/) | Best Time to Buy and Sell Stock with Transaction Fee | [Rust](/leetcode/src/rust/714.best-time-to-buy-and-sell-stock-with-transaction-fee.rs) |  | |\n| [977](https://leetcode.com/problems/squares-of-a-sorted-array) | Squares of a Sorted Array | [Rust](/leetcode/src/rust/977.squares-of-a-sorted-array.rs)                            |  | |\n| [1094](https://leetcode.com/problems/car-pooling/description/) | Car Pooling |  | | [Java](/leetcode/src/java/1094.car-pooling.java) |\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fwenjin1997%2Frust-leetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fwenjin1997%2Frust-leetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fwenjin1997%2Frust-leetcode/lists"}