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