每日一題，有益身心健康。
歡迎加入[Discord](https://discord.gg/XA3rHMzQJF)群一起討論。

:::warning
因為HackMD單篇有字數限制，2023/8/11之後開始更新至[每日一題](https://marsgoat.github.io/XNnote/coding/leetcodeEveryDay.html)
:::

## 日期
### 2022/11
:::spoiler 題目列表
| 日期 | 題目 |
| ------ | ----------- |
| 11/21 | [1926. Nearest Exit from Entrance in Maze](https://hackmd.io/@Marsgoat/leetcode1926) |
| 11/22 | [279. Perfect Squares](https://hackmd.io/@Marsgoat/leetcode279) |
| 11/23 | [36. Valid Sudoku](https://hackmd.io/@Marsgoat/leetcode36) |
| | [148. Sort List](https://hackmd.io/@RonChen0927/leetcode148) |
| | [409. Longest Palindrome](https://hackmd.io/@RonChen0927/leetcode409) |
| 11/24 | [79. Word Search](https://hackmd.io/@Marsgoat/leetcode79) |
| 11/25 | [907. Sum of Subarray Minimums](https://hackmd.io/@Marsgoat/leetcode907) |
| | [687. Longest Univalue Path](https://hackmd.io/@RonChen0927/leetcode687) |
| 11/26 | [1235. Maximum Profit in Job Scheduling](https://hackmd.io/@Marsgoat/leetcode1235) |
| 11/27 | [446. Arithmetic Slices II - Subsequence](https://hackmd.io/@Marsgoat/leetcode446) |
| 11/28 | [2225. Find Players With Zero or One Losses](https://hackmd.io/@Marsgoat/leetcode2225) |
| 11/29 | [380. Insert Delete GetRandom O(1)](https://hackmd.io/@Marsgoat/leetcode380) |
| 11/30 | [1207. Unique Number of Occurrences](https://hackmd.io/@Marsgoat/leetcode1207) |
:::

### 2022/12
:::spoiler 題目列表
| 日期 | 題目 |
| ------ | ----------- |
| 12/1 | [1704. Determine if String Halves Are Alike](https://hackmd.io/@Marsgoat/leetcode1704) |
| | [371. Sum of Two Integers](https://hackmd.io/@Marsgoat/leetcode371) |
| 12/2 | [1657. Determine if Two Strings Are Close](https://hackmd.io/@Marsgoat/leetcode1657) |
| | [859. Buddy Strings](https://hackmd.io/@Marsgoat/leetcode859) |
| 12/3 | [451. Sort Characters By Frequency](https://hackmd.io/@Marsgoat/leetcode451) |
| 12/4 | [2256. Minimum Average Difference](https://hackmd.io/@Marsgoat/leetcode2256) |
| 12/5 | [876. Middle of the Linked List](https://hackmd.io/@Marsgoat/leetcode876) |
| 12/6 | [328. Odd Even Linked List](https://hackmd.io/@Marsgoat/leetcode328) |
| 12/7 | [938. Range Sum of BST](https://hackmd.io/@Marsgoat/leetcode938) |
| | [98. Validate Binary Search Tree](https://hackmd.io/@Marsgoat/leetcode98) |
| 12/8 | [872. Leaf-Similar Trees](https://hackmd.io/@Marsgoat/leetcode872) |
| 12/9 | [1026. Maximum Difference Between Node and Ancestor](https://hackmd.io/@Marsgoat/leetcode1026) |
| 12/10 | [1339. Maximum Product of Splitted Binary Tree](https://hackmd.io/@Marsgoat/leetcode1339) |
| 12/11 | [124. Binary Tree Maximum Path Sum](https://hackmd.io/@Marsgoat/leetcode124) |
| 12/12 | [70. Climbing Stairs](https://hackmd.io/@Marsgoat/leetcode70) |
| | [2498. Frog Jump II](https://hackmd.io/@Marsgoat/leetcode2498) |
| 12/13 | [931. Minimum Falling Path Sum](https://hackmd.io/@Marsgoat/leetcode931) |
| | [1289. Minimum Falling Path Sum II](https://hackmd.io/@Marsgoat/leetcode1289) |
| 12/14 | [198. House Robber](https://hackmd.io/@Marsgoat/leetcode198) |
| 12/15 | [1143. Longest Common Subsequence](https://hackmd.io/@Marsgoat/leetcode1143) |
| 12/16 | [232. Implement Queue using Stacks](https://hackmd.io/@Marsgoat/leetcode232) |
| 12/17 | [150. Evaluate Reverse Polish Notation](https://hackmd.io/@Marsgoat/leetcode150) |
| 12/18 | [739. Daily Temperatures](https://hackmd.io/@Marsgoat/leetcode739) |
| 12/19 | [1971. Find if Path Exists in Graph](https://hackmd.io/@Marsgoat/leetcode1971) |
| 12/20 | [841. Keys and Rooms](https://hackmd.io/@Marsgoat/leetcode841) |
| 12/21 | [886. Possible Bipartition](https://hackmd.io/@Marsgoat/leetcode886) |
| 12/22 | [834. Sum of Distances in Tree](https://hackmd.io/@Marsgoat/leetcode834) |
| 12/23 | [309. Best Time to Buy and Sell Stock with Cooldown](https://hackmd.io/@Marsgoat/leetcode309) |
| | [121. Best Time to Buy and Sell Stock](https://hackmd.io/@Marsgoat/leetcode121) |
| | [122. Best Time to Buy and Sell Stock II](https://hackmd.io/@Marsgoat/leetcode122) |
| 12/24 | [790. Domino and Tromino Tiling](https://hackmd.io/@Marsgoat/leetcode790) |
| 12/25 | [2389. Longest Subsequence With Limited Sum](https://hackmd.io/@RonChen0927/leetcode2389)
| | [791. Custom Sort String](https://hackmd.io/@skylanly/leetcode791)|
| 12/26 | [55. Jump Game](https://hackmd.io/@Marsgoat/leetcode55)|
| 12/27 | [2279. Maximum Bags With Full Capacity of Rocks](https://hackmd.io/@Marsgoat/leetcode2279)|
| 12/28 | [1962. Remove Stones to Minimize the Total](https://hackmd.io/@Marsgoat/leetcode1962)|
| 12/29 | [1834. Single-Threaded CPU](https://hackmd.io/@Marsgoat/leetcode1834)|
| 12/30 | [797. All Paths From Source to Target](https://hackmd.io/@RonChen0927/leetcode797)|
| 12/31 | [980. Unique Paths III](https://hackmd.io/@Marsgoat/leetcode980)|
:::

### 2023/1
:::spoiler 題目列表
| 日期 | 題目 |
| ------ | ----------- |
| 1/1 | [290. Word Pattern](https://hackmd.io/@Marsgoat/leetcode290) |
| 1/2 | [520. Detect Capital](https://hackmd.io/@Marsgoat/leetcode520) |
| 1/3 | [944. Delete Columns to Make Sorted](https://hackmd.io/@Marsgoat/leetcode944) |
| 1/4 | [2244. Minimum Rounds to Complete All Tasks](https://hackmd.io/@Marsgoat/leetcode2244) |
| 1/5 | [452. Minimum Number of Arrows to Burst Balloons](https://hackmd.io/@Marsgoat/leetcode452) |
| 1/6 | [1833. Maximum Ice Cream Bars](https://hackmd.io/@Marsgoat/leetcode1833) |
| 1/7 | [134. Gas Station](https://hackmd.io/@Marsgoat/leetcode134) |
| 1/8 | [149. Max Points on a Line](https://hackmd.io/@Marsgoat/leetcode149) |
| 1/9 | [144. Binary Tree Preorder Traversal](https://hackmd.io/@Marsgoat/leetcode144) |
| 1/10 | [100. Same Tree](https://hackmd.io/@Marsgoat/leetcode100) |
| 1/11 | [1443. Minimum Time to Collect All Apples in a Tree](https://hackmd.io/@Marsgoat/leetcode1443) |
| 1/12 | [1519. Number of Nodes in the Sub-Tree With the Same Label](https://hackmd.io/@Marsgoat/leetcode1519) |
| 1/13 | [2246. Longest Path With Different Adjacent Characters](https://hackmd.io/@Marsgoat/leetcode2246) |
| 1/14 | [1061. Lexicographically Smallest Equivalent String](https://hackmd.io/@Marsgoat/leetcode1061) |
| 1/15 | [2421. Number of Good Paths](https://hackmd.io/@Marsgoat/leetcode2421) |
| 1/16 | [57. Insert Interval](https://hackmd.io/@Marsgoat/leetcode57) |
| 1/17 | [926. Flip String to Monotone Increasing](https://hackmd.io/@Marsgoat/leetcode926) |
| 1/18 | [918. Maximum Sum Circular Subarray](https://hackmd.io/@Marsgoat/leetcode918) |
| 1/19 | [974. Subarray Sums Divisible by K](https://hackmd.io/@Marsgoat/leetcode974) |
| 1/20 | [491. Non-decreasing Subsequences](https://hackmd.io/@Marsgoat/leetcode491) |
| 1/21 | [93. Restore IP Addresses](https://hackmd.io/@Marsgoat/leetcode93) |
| 1/22 | [131. Palindrome Partitioning](https://hackmd.io/@Marsgoat/leetcode131) |
| 1/23 | [997. Find the Town Judge](https://hackmd.io/@Marsgoat/leetcode997) |
| 1/24 | [909. Snakes and Ladders](https://hackmd.io/@Marsgoat/leetcode909) |
| 1/25 | [2359. Find Closest Node to Given Two Nodes](https://hackmd.io/@Marsgoat/leetcode2359) |
| 1/26 | [787. Cheapest Flights Within K Stops](https://hackmd.io/@Marsgoat/leetcode787) |
| 1/27 | [472. Concatenated Words](https://hackmd.io/@Marsgoat/leetcode472) |
| 1/28 | [352. Data Stream as Disjoint Intervals](https://hackmd.io/@Marsgoat/leetcode352) |
| 1/29 | [460. LFU Cache](https://hackmd.io/@Marsgoat/leetcode460) |
| 1/30 | [1137. N-th Tribonacci Number](https://hackmd.io/@Marsgoat/leetcode1137) |
| 1/31 | [1626. Best Team With No Conflicts](https://hackmd.io/@Marsgoat/leetcode1626) |
:::
### 2023/2
:::spoiler 題目列表
| 日期 | 題目 |
| ------ | ----------- |
| 2/1 | [1071. Greatest Common Divisor of Strings](https://hackmd.io/@Marsgoat/leetcode1071) |
| 2/2 | [953. Verifying an Alien Dictionary](https://hackmd.io/@Marsgoat/leetcode953) |
| 2/3 | [6. Zigzag Conversion](https://hackmd.io/@Marsgoat/leetcode6) |
| 2/4 | [567. Permutation in String](https://hackmd.io/@Marsgoat/leetcode567) |
| 2/5 | [438. Find All Anagrams in a String](https://hackmd.io/@Marsgoat/leetcode438) |
| 2/6 | [1470. Shuffle the Array](https://hackmd.io/@Marsgoat/leetcode1470) |
| 2/7 | [904. Fruit Into Baskets](https://hackmd.io/@Marsgoat/leetcode904) |
| 2/8 | [45. Jump Game II](https://hackmd.io/@Marsgoat/leetcode45) |
| 2/9 | [2306. Naming a Company](https://hackmd.io/@Marsgoat/leetcode2306) |
| 2/10 | [1162. As Far from Land as Possible](https://hackmd.io/@Marsgoat/leetcode1162) |
| 2/11 | [1129. Shortest Path with Alternating Colors](https://hackmd.io/@Marsgoat/leetcode1129) |
| 2/12 | [2477. Minimum Fuel Cost to Report to the Capital](https://hackmd.io/@Marsgoat/leetcode2477) |
| 2/13 | [1523. Count Odd Numbers in an Interval Range](https://hackmd.io/@Marsgoat/leetcode1523) |
| 2/14 | [67. Add Binary](https://hackmd.io/@Marsgoat/leetcode67) |
| 2/15 | [989. Add to Array-Form of Integer](https://hackmd.io/@Marsgoat/leetcode989) |
| 2/16 | [104. Maximum Depth of Binary Tree](https://hackmd.io/@Marsgoat/leetcode104) |
| 2/17 | [783. Minimum Distance Between BST Nodes](https://hackmd.io/@Marsgoat/leetcode783) |
| 2/18 | [226. Invert Binary Tree](https://hackmd.io/@Marsgoat/leetcode226) |
| 2/19 | [103. Binary Tree Zigzag Level Order Traversal](https://hackmd.io/@Marsgoat/leetcode103) |
| 2/20 | [35. Search Insert Position](https://hackmd.io/@Marsgoat/leetcode35) |
| 2/21 | [540. Single Element in a Sorted Array](https://hackmd.io/@Marsgoat/leetcode540) |
| 2/22 | [1011. Capacity To Ship Packages Within D Days](https://hackmd.io/@Marsgoat/leetcode1011) |
| 2/23 | [502. IPO](https://hackmd.io/@Marsgoat/leetcode502) |
| 2/24 | [1675. Minimize Deviation in Array](https://hackmd.io/@Marsgoat/leetcode1675) |
| 2/25 | [121. Best Time to Buy and Sell Stock](https://hackmd.io/@Marsgoat/leetcode121) |
| 2/26 | [72. Edit Distance](https://hackmd.io/@Marsgoat/leetcode72) |
| 2/27 | [427. Construct Quad Tree](https://hackmd.io/@Marsgoat/leetcode427) |
| 2/28 | [652. Find Duplicate Subtrees](https://hackmd.io/@Marsgoat/leetcode652) |
:::

### 2023/3
:::spoiler 題目列表
| 日期 | 題目 |
| ------ | ----------- |
| 3/1 | [912. Sort an Array](https://hackmd.io/@Marsgoat/leetcode912) |
| 3/2 | [443. String Compression](https://hackmd.io/@Marsgoat/leetcode443) |
| 3/3 | [28. Find the Index of the First Occurrence in a String](https://hackmd.io/@Marsgoat/leetcode28) |
| 3/4 | [2444. Count Subarrays With Fixed Bounds](https://hackmd.io/@Marsgoat/leetcode2444) |
| 3/5 | [1345. Jump Game IV](https://hackmd.io/@Marsgoat/leetcode1345) |
| 3/6 | [1539. Kth Missing Positive Number](https://hackmd.io/@Marsgoat/leetcode1539) |
| 3/7 | [2187. Minimum Time to Complete Trips](https://hackmd.io/@Marsgoat/leetcode2187) |
| 3/8 | [875. Koko Eating Bananas](https://hackmd.io/@Marsgoat/leetcode875) |
| 3/9 | [142. Linked List Cycle II](https://hackmd.io/@Marsgoat/leetcode142) |
| 3/10 | [382. Linked List Random Node](https://hackmd.io/@Marsgoat/leetcode382) |
| 3/11 | [109. Convert Sorted List to Binary Search Tree](https://hackmd.io/@Marsgoat/leetcode109) |
| 3/12 | [23. Merge k Sorted Lists](https://hackmd.io/@Marsgoat/leetcode23) |
| 3/13 | [101. Symmetric Tree](https://hackmd.io/@Marsgoat/leetcode101) |
| 3/14 | [129. Sum Root to Leaf Numbers](https://hackmd.io/@Marsgoat/leetcode129) |
| 3/15 | [958. Check Completeness of a Binary Tree](https://hackmd.io/@Marsgoat/leetcode958) |
| 3/16 | [106. Construct Binary Tree from Inorder and Postorder Traversal](https://hackmd.io/@Marsgoat/leetcode106) |
| 3/17 | [208. Implement Trie (Prefix Tree)](https://hackmd.io/@Marsgoat/leetcode208) |
| 3/18 | [1472. Design Browser History](https://hackmd.io/@Marsgoat/leetcode1472) |
| 3/19 | [211. Design Add and Search Words Data Structure](https://hackmd.io/@Marsgoat/leetcode211) |
| 3/20 | [605. Can Place Flowers](https://hackmd.io/@Marsgoat/leetcode605) |
| 3/21 | [2348. Number of Zero-Filled Subarrays](https://hackmd.io/@Marsgoat/leetcode2348) |
| 3/22 | [2492. Minimum Score of a Path Between Two Cities](https://hackmd.io/@Marsgoat/leetcode2492) |
| 3/23 | [1319. Number of Operations to Make Network Connected](https://hackmd.io/@Marsgoat/leetcode1319) |
| 3/24 | [1466. Reorder Routes to Make All Paths Lead to the City Zero](https://hackmd.io/@Marsgoat/leetcode1466) |
| 3/25 | [2316. Count Unreachable Pairs of Nodes in an Undirected Graph](https://hackmd.io/@Marsgoat/leetcode2316) |
| 3/26 | [2360. Longest Cycle in a Graph](https://hackmd.io/@Marsgoat/leetcode2360) |
| 3/27 | [64. Minimum Path Sum](https://hackmd.io/@Marsgoat/leetcode64) |
| 3/28 | [983. Minimum Cost For Tickets](https://hackmd.io/@Marsgoat/leetcode983) |
| 3/29 | [1402. Reducing Dishes](https://hackmd.io/@Marsgoat/leetcode1402) |
| 3/30 | [87. Scramble String](https://hackmd.io/@Marsgoat/leetcode87) |
| 3/31 | [1444. Number of Ways of Cutting a Pizza](https://hackmd.io/@Marsgoat/leetcode1444) |
:::

### 2023/4
:::spoiler 題目列表
| 日期 | 題目 |
| ------ | ----------- |
| 4/1 | [704. Binary Search](https://hackmd.io/@Marsgoat/leetcode704) |
| 4/2 | [2300. Successful Pairs of Spells and Potions](https://hackmd.io/@Marsgoat/leetcode2300) |
| 4/3 | [881. Boats to Save People](https://hackmd.io/@Marsgoat/leetcode881) |
| 4/4 | [2405. Optimal Partition of String](https://hackmd.io/@Marsgoat/leetcode2405) |
| 4/5 | [2439. Minimize Maximum of Array](https://hackmd.io/@Marsgoat/leetcode2439) |
| 4/6 | [1254. Number of Closed Islands](https://hackmd.io/@Marsgoat/leetcode1254) |
| 4/7 | [1020. Number of Enclaves](https://hackmd.io/@Marsgoat/leetcode1020) |
| 4/8 | [133. Clone Graph](https://hackmd.io/@Marsgoat/leetcode133) |
| 4/9 | [1857. Largest Color Value in a Directed Graph](https://hackmd.io/@Marsgoat/leetcode1857) |
| 4/10 | [20. Valid Parentheses](https://hackmd.io/@Marsgoat/leetcode20) |
| 4/11 | [2390. Removing Stars From a String](https://hackmd.io/@Marsgoat/leetcode2390) |
| 4/12 | [71. Simplify Path](https://hackmd.io/@Marsgoat/leetcode71) |
| 4/13 | [946. Validate Stack Sequences](https://hackmd.io/@Marsgoat/leetcode946) |
| 4/14 | [516. Longest Palindromic Subsequence](https://hackmd.io/@Marsgoat/leetcode516) |
| 4/15 | [2218. Maximum Value of K Coins From Piles](https://hackmd.io/@Marsgoat/leetcode2218) |
| 4/16 | [1639. Number of Ways to Form a Target String Given a Dictionary](https://hackmd.io/@Marsgoat/leetcode1693) |
| 4/17 | [1431. Kids With the Greatest Number of Candies](https://hackmd.io/@Marsgoat/leetcode1431) |
| 4/18 | [1768. Merge Strings Alternately](https://hackmd.io/@Marsgoat/leetcode1768) |
| 4/19 | [1372. Longest ZigZag Path in a Binary Tree](https://hackmd.io/@Marsgoat/leetcode1372) |
| 4/20 | [662. Maximum Width of Binary Tree](https://hackmd.io/@Marsgoat/leetcode662) |
| 4/21 | [879. Profitable Schemes](https://hackmd.io/@Marsgoat/leetcode879) |
| 4/22 | [1312. Minimum Insertion Steps to Make a String Palindrome](https://hackmd.io/@Marsgoat/leetcode1312) |
| 4/23 | [1416. Restore The Array](https://hackmd.io/@Marsgoat/leetcode1416) |
| 4/24 | [1046. Last Stone Weight](https://hackmd.io/@Marsgoat/leetcode1046) |
| 4/25 | [2336. Smallest Number in Infinite Set](https://hackmd.io/@Marsgoat/leetcode2336) |
| 4/26 | [258. Add Digits](https://hackmd.io/@Marsgoat/leetcode258) |
| 4/27 | [319. Bulb Switcher](https://hackmd.io/@Marsgoat/leetcode319) |
| 4/28 | [839. Similar String Groups](https://hackmd.io/@Marsgoat/leetcode839) |
| 4/29 | [1697. Checking Existence of Edge Length Limited Paths](https://hackmd.io/@Marsgoat/leetcode1697) |
| 4/30 | [1579. Remove Max Number of Edges to Keep Graph Fully Traversable](https://hackmd.io/@Marsgoat/leetcode1579) |
:::

### 2023/5
:::spoiler 題目列表
| 日期 | 題目 |
| ------ | ----------- |
| 5/1 | [1491. Average Salary Excluding the Minimum and Maximum Salary](https://hackmd.io/@Marsgoat/leetcode1491) |
| 5/2 | [1822. Sign of the Product of an Array](https://hackmd.io/@Marsgoat/leetcode1822) |
| 5/3 | [2215. Find the Difference of Two Arrays](https://hackmd.io/@Marsgoat/leetcode2215) |
| 5/4 | [649. Dota2 Senate](https://hackmd.io/@Marsgoat/leetcode649) |
| 5/5 | [1456. Maximum Number of Vowels in a Substring of Given Length](https://hackmd.io/@Marsgoat/leetcode1456) |
| 5/6 | [1498. Number of Subsequences That Satisfy the Given Sum Condition](https://hackmd.io/@Marsgoat/leetcode1498) |
| 5/7 | [1964. Find the Longest Valid Obstacle Course at Each Position](https://hackmd.io/@Marsgoat/leetcode1964) |
| 5/8 | [1572. Matrix Diagonal Sum](https://hackmd.io/@Marsgoat/leetcode1572) |
| 5/9 | [54. Spiral Matrix](https://hackmd.io/@Marsgoat/leetcode54) |
| 5/10 | [59. Spiral Matrix II](https://hackmd.io/@Marsgoat/leetcode59) |
| 5/11 | [1035. Uncrossed Lines](https://hackmd.io/@Marsgoat/leetcode1035) |
| 5/12 | [2140. Solving Questions With Brainpower](https://hackmd.io/@Marsgoat/leetcode2140) |
| 5/13 | [2466. Count Ways To Build Good Strings](https://hackmd.io/@Marsgoat/leetcode2466) |
| 5/14 | [1799. Maximize Score After N Operations](https://hackmd.io/@Marsgoat/leetcode1799) |
| 5/15 | [1721. Swapping Nodes in a Linked List](https://hackmd.io/@Marsgoat/leetcode1721) |
| 5/16 | [24. Swap Nodes in Pairs](https://hackmd.io/@Marsgoat/leetcode24) |
| 5/17 | [2130. Maximum Twin Sum of a Linked List](https://hackmd.io/@Marsgoat/leetcode2130) |
| 5/18 | [1557. Minimum Number of Vertices to Reach All Nodes](https://hackmd.io/@Marsgoat/leetcode1557) |
| 5/19 | [785. Is Graph Bipartite?](https://hackmd.io/@Marsgoat/leetcode785) |
| 5/20 | [399. Evaluate Division](https://hackmd.io/@Marsgoat/leetcode399) |
| 5/21 | [934. Shortest Bridge](https://hackmd.io/@Marsgoat/leetcode934) |
| 5/22 | [347. Top K Frequent Elements](https://hackmd.io/@Marsgoat/leetcode347) |
| 5/23 | [703. Kth Largest Element in a Stream](https://hackmd.io/@Marsgoat/leetcode703) |
| 5/24 | [2542. Maximum Subsequence Score](https://hackmd.io/@Marsgoat/leetcode2542) |
| 5/25 | [837. New 21 Game](https://hackmd.io/@Marsgoat/leetcode837) |
| 5/26 | [1140. Stone Game II](https://hackmd.io/@Marsgoat/leetcode1140) |
| | [877. Stone Game](https://hackmd.io/@Marsgoat/leetcode877) |
| 5/27 | [1406. Stone Game III](https://hackmd.io/@Marsgoat/leetcode1406) |
| 5/28 | [1547. Minimum Cost to Cut a Stick](https://hackmd.io/@Marsgoat/leetcode1547) |
| 5/29 | [1603. Design Parking System](https://hackmd.io/@Marsgoat/leetcode1603) |
| 5/30 | [705. Design HashSet](https://hackmd.io/@Marsgoat/leetcode705) |
| 5/31 | [1396. Design Underground System](https://hackmd.io/@Marsgoat/leetcode1396) |
:::

### 2023/6
:::spoiler 題目列表
| 日期 | 題目 |
| ------ | ----------- |
| 6/1 | [1091. Shortest Path in Binary Matrix](https://hackmd.io/@Marsgoat/leetcode1091) |
| 6/2 | [2101. Detonate the Maximum Bombs](https://hackmd.io/@Marsgoat/leetcode2101) |
| 6/3 | [1376. Time Needed to Inform All Employees](https://hackmd.io/@Marsgoat/leetcode1376) |
| 6/4 | [547. Number of Provinces](https://hackmd.io/@Marsgoat/leetcode547) |
| 6/5 | [1232. Check If It Is a Straight Line](https://hackmd.io/@Marsgoat/leetcode1232) |
| 6/6 | [1502. Can Make Arithmetic Progression From Sequence](https://hackmd.io/@Marsgoat/leetcode1502) |
| 6/7 | [1318. Minimum Flips to Make a OR b Equal to c](https://hackmd.io/@Marsgoat/leetcode1318) |
| 6/8 | [1351. Count Negative Numbers in a Sorted Matrix](https://hackmd.io/@Marsgoat/leetcode1351) |
| 6/9 | [744. Find Smallest Letter Greater Than Target](https://hackmd.io/@Marsgoat/leetcode744) |
| 6/10 | [1802. Maximum Value at a Given Index in a Bounded Array](https://hackmd.io/@Marsgoat/leetcode1802) |
| 6/11 | [1146. Snapshot Array](https://hackmd.io/@Marsgoat/leetcode1146) |
| 6/12 | [228. Summary Ranges](https://hackmd.io/@Marsgoat/leetcode228) |
| 6/13 | [2352. Equal Row and Column Pairs](https://hackmd.io/@Marsgoat/leetcode2352) |
| 6/14 | [530. Minimum Absolute Difference in BST](https://hackmd.io/@Marsgoat/leetcode530) |
| 6/15 | [1161. Maximum Level Sum of a Binary Tree](https://hackmd.io/@Marsgoat/leetcode1161) |
| 6/16 | [1569. Number of Ways to Reorder Array to Get Same BST](https://hackmd.io/@Marsgoat/leetcode1569) |
| 6/17 | [1187. Make Array Strictly Increasing](https://hackmd.io/@Marsgoat/BJdXkOEOh) |
| 6/18 | [2328. Number of Increasing Paths in a Grid](https://hackmd.io/@Marsgoat/H1fUbOVOh) |
| 6/19 | [1732. Find the Highest Altitude](https://hackmd.io/@skylanly/leetcode1732) |
| 6/20 | [2090. K Radius Subarray Averages](https://hackmd.io/@Marsgoat/leetcode2090) |
| 6/21 | [2448. Minimum Cost to Make Array Equal](https://hackmd.io/@Marsgoat/rJbfHA1d2) |
| 6/22 | [714. Best Time to Buy and Sell Stock with Transaction Fee](https://hackmd.io/@Marsgoat/H1YZ9l7dn) |
| 6/23 | [1027. Longest Arithmetic Subsequence](https://hackmd.io/@Marsgoat/rknSogQ_h) |
| 6/24 | [956. Tallest Billboard](https://hackmd.io/@Marsgoat/BkUrCP4dn) |
| 6/25 | [1575. Count All Possible Routes](https://hackmd.io/@Marsgoat/BJpu4arO3) |
| 6/26 | [2462. Total Cost to Hire K Workers](https://hackmd.io/@Marsgoat/B1kR8dUOh) |
| 6/27 | [373. Find K Pairs with Smallest Sums](https://hackmd.io/@Marsgoat/rkNbuavO3) |
| 6/28 | [1514. Path with Maximum Probability](https://hackmd.io/@Marsgoat/B15eOMt_h) |
| 6/29 | [864. Shortest Path to Get All Keys](https://hackmd.io/@Marsgoat/B1cKMP5u2) |
| 6/30 | [1970. Last Day Where You Can Still Cross](https://hackmd.io/@Marsgoat/B1cTI3iOh) |
:::

### 2023/7
:::spoiler 題目列表
| 日期 | 題目 |
| ------ | ----------- |
| 7/1 | [2305. Fair Distribution of Cookies](https://hackmd.io/@Marsgoat/leetcode2305) |
| 7/2 | [1601. Maximum Number of Achievable Transfer Requests](https://hackmd.io/@Marsgoat/leetcode1601) |
| 7/3 | [859. Buddy Strings](https://hackmd.io/@Marsgoat/leetcode859) |
| 7/4 | [137. Single Number II](https://hackmd.io/@Marsgoat/leetcode137) |
| 7/5 | [1493. Longest Subarray of 1's After Deleting One Element](https://hackmd.io/@Marsgoat/leetcode1493) |
| 7/6 | [209. Minimum Size Subarray Sum](https://hackmd.io/@Marsgoat/leetcode209) |
| 7/7 | [2024. Maximize the Confusion of an Exam](https://hackmd.io/@Marsgoat/leetcode2024) |
| 7/8 | [2551. Put Marbles in Bags](https://hackmd.io/@Marsgoat/leetcode2551) |
| 7/9 | [2272. Substring With Largest Variance](https://hackmd.io/@Marsgoat/leetcode2272) |
| 7/10 | [111. Minimum Depth of Binary Tree](https://hackmd.io/@Marsgoat/leetcode111) |
| 7/11 | [863. All Nodes Distance K in Binary Tree](https://hackmd.io/@Marsgoat/leetcode863) |
| 7/12 | [802. Find Eventual Safe States](https://hackmd.io/@Marsgoat/leetcode802) |
| 7/13 | [207. Course Schedule](https://hackmd.io/@Marsgoat/leetcode207) |
| 7/14 | [1218. Longest Arithmetic Subsequence of Given Difference](https://hackmd.io/@Marsgoat/leetcode1218) |
| 7/15 | [1751. Maximum Number of Events That Can Be Attended II](https://hackmd.io/@Marsgoat/leetcode1751) |
| 7/16 | [1125. Smallest Sufficient Team](https://hackmd.io/@Marsgoat/leetcode1125) |
| 7/17 | [445. Add Two Numbers II](https://hackmd.io/@Marsgoat/leetcode445) |
| 7/18 | [146. LRU Cache](https://hackmd.io/@Marsgoat/leetcode146) |
| 7/19 | [435. Non-overlapping Intervals](https://hackmd.io/@Marsgoat/leetcode435) |
| 7/20 | [735. Asteroid Collision](https://hackmd.io/@Marsgoat/leetcode735) |
| 7/21 | [673. Number of Longest Increasing Subsequence](https://hackmd.io/@Marsgoat/leetcode673) |
| 7/22 | [688. Knight Probability in Chessboard](https://hackmd.io/@Marsgoat/leetcode688) |
| 7/23 | [894. All Possible Full Binary Trees](https://hackmd.io/@Marsgoat/leetcode894) |
| 7/24 | [50. Pow(x, n)](https://hackmd.io/@Marsgoat/leetcode50) |
| 7/25 | [852. Peak Index in a Mountain Array](https://hackmd.io/@Marsgoat/leetcode852) |
| 7/26 | [1870. Minimum Speed to Arrive on Time](https://hackmd.io/@Marsgoat/leetcode1870) |
| 7/27 | [2141. Maximum Running Time of N Computers](https://hackmd.io/@Marsgoat/leetcode2141) |
| 7/28 | [486. Predict the Winner](https://hackmd.io/@Marsgoat/leetcode486) |
| 7/29 | [808. Soup Servings](https://hackmd.io/@Marsgoat/leetcode808) |
| 7/30 | [664. Strange Printer](https://hackmd.io/@Marsgoat/leetcode664) |
| 7/31 | [712. Minimum ASCII Delete Sum for Two Strings](https://hackmd.io/@Marsgoat/leetcode712) |
:::

### 2023/8
| 日期 | 題目 |
| ------ | ----------- |
| 8/1 | [77. Combinations](https://hackmd.io/@Marsgoat/leetcode77) |
| 8/2 | [46. Permutations](https://hackmd.io/@Marsgoat/leetcode46) |
| 8/3 | [17. Letter Combinations of a Phone Number](https://hackmd.io/@Marsgoat/leetcode17) |
| 8/4 | [139. Word Break](https://hackmd.io/@Marsgoat/leetcode139) |
| 8/5 | [95. Unique Binary Search Trees II](https://hackmd.io/@Marsgoat/leetcode95) |
| 8/6 | [920. Number of Music Playlists](https://hackmd.io/@Marsgoat/leetcode920) |
| 8/7 | [74. Search a 2D Matrix](https://hackmd.io/@Marsgoat/leetcode74) |
| 8/8 | [33. Search in Rotated Sorted Array](https://hackmd.io/@Marsgoat/leetcode33) |
| 8/9 | [2616. Minimize the Maximum Difference of Pairs](https://hackmd.io/@Marsgoat/leetcode2616) |
| 8/10 | [81. Search in Rotated Sorted Array II](https://hackmd.io/@Marsgoat/leetcode81) |

## 30 Days of LC JavaScript Challenge

:::spoiler 題目列表
| Day | Topic | Problem |
| --- | --- | --- |
| 1 (5/5) | Closure | [Create Hello World Function](https://hackmd.io/@sheep0914/lc-js-30-day1) |
| 2 (5/6) | Closure | [Counter](https://hackmd.io/@sheep0914/lc-js-30-day2) |
| 3 (5/7) | Closure | [Counter II](https://hackmd.io/@sheep0914/lc-js-30-day3) |
| 4 (5/8) | Basic Array Transforms | [Apply Transform Over Each Element in Array](https://hackmd.io/@sheep0914/lc-js-30-day4) |
| 5 (5/9) | Basic Array Transforms | [Filter Elements from Array](https://hackmd.io/@sheep0914/lc-js-30-day5) |
| 6 (5/10) | Basic Array Transforms | [Array Reduce Transformation](https://hackmd.io/@sheep0914/lc-js-30-day6) |
| 7 (5/11) | Function input and Output | [Function Composition](https://hackmd.io/@sheep0914/lc-js-30-day7) |
| 8 (5/12) | Function input and Output | [Allow One Function Call](https://hackmd.io/@sheep0914/lc-js-30-day8) |
| 9 (5/13) | Function input and Output | [Memoize](https://hackmd.io/@sheep0914/lc-js-30-day9) |
| 10 (5/14) | Function input and Output | [Curry](https://hackmd.io/@sheep0914/lc-js-30-day10) |
| 11 (5/15) | Promise | [Sleep](https://hackmd.io/@sheep0914/lc-js-30-day11) |
| 12 (5/16) | Promise | [Promise Time Limit](https://hackmd.io/@sheep0914/lc-js-30-day12) |
| 13 (5/17) | Promise | [Promise Pool](https://hackmd.io/@sheep0914/lc-js-30-day13) |
| 14 (5/18) | Time (setTimeout) | [Cache With Time Limit](https://hackmd.io/@sheep0914/lc-js-30-day14) |
| 15 (5/19) | Time (setTimeout) | [Debounce](https://hackmd.io/@sheep0914/lc-js-30-day15) |
| 16 (5/20) | Time (setTimeout) | [Throttle](https://hackmd.io/@sheep0914/lc-js-30-day16) |
| 17 (5/21) | JSON / Recursion / Important Utilities | [JSON Deep Equal](https://hackmd.io/@sheep0914/lc-js-30-day17) |
| 18 (5/22) | JSON / Recursion / Important Utilities | [Convert Object to JSON String](https://hackmd.io/@sheep0914/lc-js-30-day18) |
| 19 (5/23) | JSON / Recursion / Important Utilities | [Array of Objects to Matrix](https://hackmd.io/@sheep0914/lc-js-30-day19) |
| 20 (5/24) | JSON / Recursion / Important Utilities | [Differences Between Two Objects](https://hackmd.io/@sheep0914/lc-js-30-day20) |
| 21 (5/25) | JSON / Recursion / Important Utilities | [Chunk Array](https://hackmd.io/@sheep0914/lc-js-30-day21) |
| 22 (5/26) | JSON / Recursion / Important Utilities | [Flatten Deeply Nested Array](https://hackmd.io/@sheep0914/lc-js-30-day22) |
| 23 (5/27) | This | [Array Prototype Last](https://hackmd.io/@sheep0914/lc-js-30-day23) |
| 24 (5/28) | This | [Group By](https://hackmd.io/@sheep0914/lc-js-30-day24) |
| 25 (5/29) | This | [Check if Object Instance of Class](https://hackmd.io/@sheep0914/lc-js-30-day25) |
| 26 (5/30) | This | [Call Function with Custom Context](https://hackmd.io/@sheep0914/lc-js-30-day26) |
| 27 (5/31) | Classes | [Event Emitter](https://hackmd.io/@sheep0914/lc-js-30-day27) |
| 28 (6/1) | Classes | [Array Wrapper](https://hackmd.io/@sheep0914/lc-js-30-day28) |
| 29 (6/2) | Generators | [Generate Fibonacci Sequence](https://hackmd.io/@sheep0914/lc-js-30-day29) |
| 30 (6/3) | Generators | [Nested Array Generator](https://hackmd.io/@sheep0914/lc-js-30-day30) |
:::

## 難度
### Easy
:::spoiler 題目列表
* [20. Valid Parentheses](https://hackmd.io/@Marsgoat/leetcode20)
* [35. Search Insert Position](https://hackmd.io/@Marsgoat/leetcode35)
* [67. Add Binary](https://hackmd.io/@Marsgoat/leetcode67)
* [70. Climbing Stairs](https://hackmd.io/@Marsgoat/leetcode70)
* [100. Same Tree](https://hackmd.io/@Marsgoat/leetcode100)
* [101. Symmetric Tree](https://hackmd.io/@Marsgoat/leetcode101)
* [104. Maximum Depth of Binary Tree](https://hackmd.io/@Marsgoat/leetcode104)
* [111. Minimum Depth of Binary Tree](https://hackmd.io/@Marsgoat/leetcode111)
* [121. Best Time to Buy and Sell Stock](https://hackmd.io/@Marsgoat/leetcode121)
* [144. Binary Tree Preorder Traversal](https://hackmd.io/@Marsgoat/leetcode144)
* [226. Invert Binary Tree](https://hackmd.io/@Marsgoat/leetcode226)
* [228. Summary Ranges](https://hackmd.io/@Marsgoat/leetcode228)
* [232. Implement Queue using Stacks](https://hackmd.io/@Marsgoat/leetcode232)
* [258. Add Digits](https://hackmd.io/@Marsgoat/leetcode258)
* [290. Word Pattern](https://hackmd.io/@Marsgoat/leetcode290)
* [409. Longest Palindrome](https://hackmd.io/@RonChen0927/leetcode409)
* [520. Detect Capital](https://hackmd.io/@Marsgoat/leetcode520)
* [530. Minimum Absolute Difference in BST](https://hackmd.io/@Marsgoat/leetcode530)
* [605. Can Place Flowers](https://hackmd.io/@Marsgoat/leetcode605)
* [703. Kth Largest Element in a Stream](https://hackmd.io/@Marsgoat/leetcode703)
* [704. Binary Search](https://hackmd.io/@Marsgoat/leetcode704)
* [705. Design HashSet](https://hackmd.io/@Marsgoat/leetcode705)
* [744. Find Smallest Letter Greater Than Target](https://hackmd.io/@Marsgoat/leetcode744)
* [783. Minimum Distance Between BST Nodes](https://hackmd.io/@Marsgoat/leetcode783)
* [859. Buddy Strings](https://hackmd.io/@Marsgoat/leetcode859)
* [872. Leaf-Similar Trees](https://hackmd.io/@Marsgoat/leetcode872)
* [876. Middle of the Linked List](https://hackmd.io/@Marsgoat/leetcode876)
* [938. Range Sum of BST](https://hackmd.io/@Marsgoat/leetcode938)
* [953. Verifying an Alien Dictionary](https://hackmd.io/@Marsgoat/leetcode953)
* [997. Find the Town Judge](https://hackmd.io/@Marsgoat/leetcode997)
* [1046. Last Stone Weight](https://hackmd.io/@Marsgoat/leetcode1046)
* [1137. N-th Tribonacci Number](https://hackmd.io/@Marsgoat/leetcode1137)
* [1207. Unique Number of Occurrences](https://hackmd.io/@Marsgoat/leetcode1207)
* [1232. Check If It Is a Straight Line](https://hackmd.io/@Marsgoat/leetcode1232)
* [1431. Kids With the Greatest Number of Candies](https://hackmd.io/@Marsgoat/leetcode1431)
* [1470. Shuffle the Array](https://hackmd.io/@Marsgoat/leetcode1470)
* [1491. Average Salary Excluding the Minimum and Maximum Salary](https://hackmd.io/@Marsgoat/leetcode1491)
* [1502. Can Make Arithmetic Progression From Sequence](https://hackmd.io/@Marsgoat/leetcode1502)
* [1523. Count Odd Numbers in an Interval Range](https://hackmd.io/@Marsgoat/leetcode1523)
* [1539. Kth Missing Positive Number](https://hackmd.io/@Marsgoat/leetcode1539)
* [1603. Design Parking System](https://hackmd.io/@Marsgoat/leetcode1603)
* [1704. Determine if String Halves Are Alike](https://hackmd.io/@Marsgoat/leetcode1704)
* [1732. Find the Highest Altitude](https://hackmd.io/@skylanly/leetcode1732)
* [1768. Merge Strings Alternately](https://hackmd.io/@Marsgoat/leetcode1768)
* [1822. Sign of the Product of an Array](https://hackmd.io/@Marsgoat/leetcode1822)
* [2389. Longest Subsequence With Limited Sum](https://hackmd.io/@RonChen0927/leetcode2389)
:::
### Medium
:::spoiler 題目列表
* [6. Zigzag Conversion](https://hackmd.io/@Marsgoat/leetcode6)
* [17. Letter Combinations of a Phone Number](https://hackmd.io/@Marsgoat/leetcode17)
* [28. Find the Index of the First Occurrence in a String](https://hackmd.io/@Marsgoat/leetcode28)
* [36. Valid Sudoku](https://hackmd.io/@Marsgoat/leetcode36)
* [45. Jump Game II](https://hackmd.io/@Marsgoat/leetcode45)
* [46. Permutations](https://hackmd.io/@Marsgoat/leetcode46)
* [54. Spiral Matrix](https://hackmd.io/@Marsgoat/leetcode54)
* [55. Jump Game](https://hackmd.io/@Marsgoat/leetcode55)
* [57. Insert Interval](https://hackmd.io/@Marsgoat/leetcode57)
* [64. Minimum Path Sum](https://hackmd.io/@Marsgoat/leetcode64)
* [71. Simplify Path](https://hackmd.io/@Marsgoat/leetcode71)
* [77. Combinations](https://hackmd.io/@Marsgoat/leetcode77)
* [79. Word Search](https://hackmd.io/@Marsgoat/leetcode79)
* [81. Search in Rotated Sorted Array II](https://hackmd.io/@Marsgoat/leetcode81)
* [93. Restore IP Addresses](https://hackmd.io/@Marsgoat/leetcode93)
* [95. Unique Binary Search Trees II](https://hackmd.io/@Marsgoat/leetcode95)
* [98. Validate Binary Search Tree](https://hackmd.io/@Marsgoat/leetcode98)
* [103. Binary Tree Zigzag Level Order Traversal](https://hackmd.io/@Marsgoat/leetcode103)
* [106. Construct Binary Tree from Inorder and Postorder Traversal](https://hackmd.io/@Marsgoat/leetcode106)
* [109. Convert Sorted List to Binary Search Tree](https://hackmd.io/@Marsgoat/leetcode109)
* [122. Best Time to Buy and Sell Stock II](https://hackmd.io/@Marsgoat/leetcode122)
* [129. Sum Root to Leaf Numbers](https://hackmd.io/@Marsgoat/leetcode129)
* [131. Palindrome Partitioning](https://hackmd.io/@Marsgoat/leetcode131)
* [133. Clone Graph](https://hackmd.io/@Marsgoat/leetcode133)
* [134. Gas Station](https://hackmd.io/@Marsgoat/leetcode134)
* [137. Single Number II](https://hackmd.io/@Marsgoat/leetcode137)
* [139. Word Break](https://hackmd.io/@Marsgoat/leetcode139)
* [142. Linked List Cycle II](https://hackmd.io/@Marsgoat/leetcode142)
* [146. LRU Cache](https://hackmd.io/@Marsgoat/leetcode146)
* [148. Sort List](https://hackmd.io/@RonChen0927/leetcode148)
* [150. Evaluate Reverse Polish Notation](https://hackmd.io/@Marsgoat/leetcode150)
* [198. House Robber](https://hackmd.io/@Marsgoat/leetcode198)
* [207. Course Schedule](https://hackmd.io/@Marsgoat/leetcode207)
* [208. Implement Trie (Prefix Tree)](https://hackmd.io/@Marsgoat/leetcode208)
* [209. Minimum Size Subarray Sum](https://hackmd.io/@Marsgoat/leetcode209)
* [211. Design Add and Search Words Data Structure](https://hackmd.io/@Marsgoat/leetcode211)
* [279. Perfect Squares](https://hackmd.io/@Marsgoat/leetcode279)
* [309. Best Time to Buy and Sell Stock with Cooldown](https://hackmd.io/@Marsgoat/leetcode309)
* [319. Bulb Switcher](https://hackmd.io/@Marsgoat/leetcode319)
* [328. Odd Even Linked List](https://hackmd.io/@Marsgoat/leetcode328)
* [347. Top K Frequent Elements](https://hackmd.io/@Marsgoat/leetcode347)
* [371. Sum of Two Integers](https://hackmd.io/@Marsgoat/leetcode371)
* [373. Find K Pairs with Smallest Sums](https://hackmd.io/@Marsgoat/rkNbuavO3)
* [380. Insert Delete GetRandom O(1)](https://hackmd.io/@Marsgoat/leetcode380)
* [382. Linked List Random Node](https://hackmd.io/@Marsgoat/leetcode382)
* [399. Evaluate Division](https://hackmd.io/@Marsgoat/leetcode399)
* [427. Construct Quad Tree](https://hackmd.io/@Marsgoat/leetcode427)
* [435. Non-overlapping Intervals](https://hackmd.io/@Marsgoat/leetcode435)
* [438. Find All Anagrams in a String](https://hackmd.io/@Marsgoat/leetcode438)
* [443. String Compression](https://hackmd.io/@Marsgoat/leetcode443)
* [445. Add Two Numbers II](https://hackmd.io/@Marsgoat/leetcode445)
* [451. Sort Characters By Frequency](https://hackmd.io/@Marsgoat/leetcode451)
* [452. Minimum Number of Arrows to Burst Balloons](https://hackmd.io/@Marsgoat/leetcode452)
* [486. Predict the Winner](https://hackmd.io/@Marsgoat/leetcode486)
* [491. Non-decreasing Subsequences](https://hackmd.io/@Marsgoat/leetcode491)
* [540. Single Element in a Sorted Array](https://hackmd.io/@Marsgoat/leetcode540)
* [547. Number of Provinces](https://hackmd.io/@Marsgoat/leetcode547)
* [567. Permutation in String](https://hackmd.io/@Marsgoat/leetcode567)
* [649. Dota2 Senate](https://hackmd.io/@Marsgoat/leetcode649)
* [652. Find Duplicate Subtrees](https://hackmd.io/@Marsgoat/leetcode652)
* [662. Maximum Width of Binary Tree](https://hackmd.io/@Marsgoat/leetcode662)
* [673. Number of Longest Increasing Subsequence](https://hackmd.io/@Marsgoat/leetcode673)
* [687. Longest Univalue Path](https://hackmd.io/@RonChen0927/leetcode687)
* [688. Knight Probability in Chessboard](https://hackmd.io/@Marsgoat/leetcode688)
* [712. Minimum ASCII Delete Sum for Two Strings](https://hackmd.io/@Marsgoat/leetcode712)
* [714. Best Time to Buy and Sell Stock with Transaction Fee](https://hackmd.io/@Marsgoat/H1YZ9l7dn)
* [735. Asteroid Collision](https://hackmd.io/@Marsgoat/leetcode735)
* [739. Daily Temperatures](https://hackmd.io/@Marsgoat/leetcode739)
* [787. Cheapest Flights Within K Stops](https://hackmd.io/@Marsgoat/leetcode787)
* [790. Domino and Tromino Tiling](https://hackmd.io/@Marsgoat/leetcode790)
* [791. Custom Sort String](https://hackmd.io/@skylanly/leetcode791)
* [797. All Paths From Source to Target](https://hackmd.io/@RonChen0927/leetcode797)
* [802. Find Eventual Safe States](https://hackmd.io/@Marsgoat/leetcode802)
* [808. Soup Servings](https://hackmd.io/@Marsgoat/leetcode808)
* [837. New 21 Game](https://hackmd.io/@Marsgoat/leetcode837)
* [841. Keys and Rooms](https://hackmd.io/@Marsgoat/leetcode841)
* [852. Peak Index in a Mountain Array](https://hackmd.io/@Marsgoat/leetcode852)
* [875. Koko Eating Bananas](https://hackmd.io/@Marsgoat/leetcode875)
* [877. Stone Game](https://hackmd.io/@Marsgoat/leetcode877)
* [881. Boats to Save People](https://hackmd.io/@Marsgoat/leetcode881)
* [886. Possible Bipartition](https://hackmd.io/@Marsgoat/leetcode886)
* [894. All Possible Full Binary Trees](https://hackmd.io/@Marsgoat/leetcode894)
* [904. Fruit Into Baskets](https://hackmd.io/@Marsgoat/leetcode904)
* [907. Sum of Subarray Minimums](https://hackmd.io/@Marsgoat/leetcode907)
* [909. Snakes and Ladders](https://hackmd.io/@Marsgoat/leetcode909)
* [912. Sort an Array](https://hackmd.io/@Marsgoat/leetcode912)
* [918. Maximum Sum Circular Subarray](https://hackmd.io/@Marsgoat/leetcode918)
* [926. Flip String to Monotone Increasing](https://hackmd.io/@Marsgoat/leetcode926)
* [931. Minimum Falling Path Sum](https://hackmd.io/@Marsgoat/leetcode931)
* [934. Shortest Bridge](https://hackmd.io/@Marsgoat/leetcode934)
* [946. Validate Stack Sequences](https://hackmd.io/@Marsgoat/leetcode946)
* [958. Check Completeness of a Binary Tree](https://hackmd.io/@Marsgoat/leetcode958)
* [974. Subarray Sums Divisible by K](https://hackmd.io/@Marsgoat/leetcode974)
* [983. Minimum Cost For Tickets](https://hackmd.io/@Marsgoat/leetcode983)
* [1011. Capacity To Ship Packages Within D Days](https://hackmd.io/@Marsgoat/leetcode1011)
* [1020. Number of Enclaves](https://hackmd.io/@Marsgoat/leetcode1020)
* [1026. Maximum Difference Between Node and Ancestor](https://hackmd.io/@Marsgoat/leetcode1026)
* [1027. Longest Arithmetic Subsequence](https://hackmd.io/@Marsgoat/rknSogQ_h)
* [1061. Lexicographically Smallest Equivalent String](https://hackmd.io/@Marsgoat/leetcode1061)
* [1091. Shortest Path in Binary Matrix](https://hackmd.io/@Marsgoat/leetcode1091)
* [1129. Shortest Path with Alternating Colors](https://hackmd.io/@Marsgoat/leetcode1129)
* [1140. Stone Game II](https://hackmd.io/@Marsgoat/leetcode1140)
* [1143. Longest Common Subsequence](https://hackmd.io/@Marsgoat/leetcode1143)
* [1146. Snapshot Array](https://hackmd.io/@Marsgoat/leetcode1146)
* [1161. Maximum Level Sum of a Binary Tree](https://hackmd.io/@Marsgoat/leetcode1161)
* [1162. As Far from Land as Possible](https://hackmd.io/@Marsgoat/leetcode1162)
* [1218. Longest Arithmetic Subsequence of Given Difference](https://hackmd.io/@Marsgoat/leetcode1218)
* [1318. Minimum Flips to Make a OR b Equal to c](https://hackmd.io/@Marsgoat/leetcode1318)
* [1319. Number of Operations to Make Network Connected](https://hackmd.io/@Marsgoat/leetcode1319)
* [1339. Maximum Product of Splitted Binary Tree](https://hackmd.io/@Marsgoat/leetcode1339)
* [1372. Longest ZigZag Path in a Binary Tree](https://hackmd.io/@Marsgoat/leetcode1372)
* [1376. Time Needed to Inform All Employees](https://hackmd.io/@Marsgoat/leetcode1376)
* [1396. Design Underground System](https://hackmd.io/@Marsgoat/leetcode1396)
* [1402. Reducing Dishes](https://hackmd.io/@Marsgoat/leetcode1402)
* [1443. Minimum Time to Collect All Apples in a Tree](https://hackmd.io/@Marsgoat/leetcode1443)
* [1456. Maximum Number of Vowels in a Substring of Given Length](https://hackmd.io/@Marsgoat/leetcode1456)
* [1466. Reorder Routes to Make All Paths Lead to the City Zero](https://hackmd.io/@Marsgoat/leetcode1466)
* [1472. Design Browser History](https://hackmd.io/@Marsgoat/leetcode1472)
* [1493. Longest Subarray of 1's After Deleting One Element](https://hackmd.io/@Marsgoat/leetcode1493)
* [1498. Number of Subsequences That Satisfy the Given Sum Condition](https://hackmd.io/@Marsgoat/leetcode1498)
* [1514. Path with Maximum Probability](https://hackmd.io/@Marsgoat/B15eOMt_h)
* [1519. Number of Nodes in the Sub-Tree With the Same Label](https://hackmd.io/@Marsgoat/leetcode1519)
* [1557. Minimum Number of Vertices to Reach All Nodes](https://hackmd.io/@Marsgoat/leetcode1557)
* [1626. Best Team With No Conflicts](https://hackmd.io/@Marsgoat/leetcode1626)
* [1657. Determine if Two Strings Are Close](https://hackmd.io/@Marsgoat/leetcode1657)
* [1721. Swapping Nodes in a Linked List](https://hackmd.io/@Marsgoat/leetcode1721)
* [1802. Maximum Value at a Given Index in a Bounded Array](https://hackmd.io/@Marsgoat/leetcode1802)
* [1833. Maximum Ice Cream Bars](https://hackmd.io/@Marsgoat/leetcode1833)
* [1834. Single-Threaded CPU](https://hackmd.io/@Marsgoat/leetcode1834)
* [1870. Minimum Speed to Arrive on Time](https://hackmd.io/@Marsgoat/leetcode1870)
* [1926. Nearest Exit from Entrance in Maze](https://hackmd.io/@Marsgoat/leetcode1926)
* [1962. Remove Stones to Minimize the Total](https://hackmd.io/@Marsgoat/leetcode1962)
* [2024. Maximize the Confusion of an Exam](https://hackmd.io/@Marsgoat/leetcode2024)
* [2090. K Radius Subarray Averages](https://hackmd.io/@Marsgoat/leetcode2090)
* [2101. Detonate the Maximum Bombs](https://hackmd.io/@Marsgoat/leetcode2101)
* [2130. Maximum Twin Sum of a Linked List](https://hackmd.io/@Marsgoat/leetcode2130)
* [2140. Solving Questions With Brainpower](https://hackmd.io/@Marsgoat/leetcode2140)
* [2187. Minimum Time to Complete Trips](https://hackmd.io/@Marsgoat/leetcode2187)
* [2225. Find Players With Zero or One Losses](https://hackmd.io/@Marsgoat/leetcode2225)
* [2244. Minimum Rounds to Complete All Tasks](https://hackmd.io/@Marsgoat/leetcode2244)
* [2256. Minimum Average Difference](https://hackmd.io/@Marsgoat/leetcode2256)
* [2279. Maximum Bags With Full Capacity of Rocks](https://hackmd.io/@Marsgoat/leetcode2279)
* [2300. Successful Pairs of Spells and Potions](https://hackmd.io/@Marsgoat/leetcode2300)
* [2305. Fair Distribution of Cookies](https://hackmd.io/@Marsgoat/leetcode2305)
* [2316. Count Unreachable Pairs of Nodes in an Undirected Graph](https://hackmd.io/@Marsgoat/leetcode2316)
* [2336. Smallest Number in Infinite Set](https://hackmd.io/@Marsgoat/leetcode2336)
* [2348. Number of Zero-Filled Subarrays](https://hackmd.io/@Marsgoat/leetcode2348)
* [2352. Equal Row and Column Pairs](https://hackmd.io/@Marsgoat/leetcode2352)
* [2359. Find Closest Node to Given Two Nodes](https://hackmd.io/@Marsgoat/leetcode2359)
* [2390. Removing Stars From a String](https://hackmd.io/@Marsgoat/leetcode2390)
* [2405. Optimal Partition of String](https://hackmd.io/@Marsgoat/leetcode2405)
* [2439. Minimize Maximum of Array](https://hackmd.io/@Marsgoat/leetcode2439)
* [2462. Total Cost to Hire K Workers](https://hackmd.io/@Marsgoat/B1kR8dUOh)
* [2466. Count Ways To Build Good Strings](https://hackmd.io/@Marsgoat/leetcode2466)
* [2477. Minimum Fuel Cost to Report to the Capital](https://hackmd.io/@Marsgoat/leetcode2477)
* [2492. Minimum Score of a Path Between Two Cities](https://hackmd.io/@Marsgoat/leetcode2492)
* [2498. Frog Jump II](https://hackmd.io/@Marsgoat/leetcode2498)
* [2542. Maximum Subsequence Score](https://hackmd.io/@Marsgoat/leetcode2542)
* [2616. Minimize the Maximum Difference of Pairs](https://hackmd.io/@Marsgoat/leetcode2616)
:::
### Hard
:::spoiler 題目列表
* [23. Merge k Sorted Lists](https://hackmd.io/@Marsgoat/leetcode23)
* [72. Edit Distance](https://hackmd.io/@Marsgoat/leetcode72)
* [87. Scramble String](https://hackmd.io/@Marsgoat/leetcode87)
* [124. Binary Tree Maximum Path Sum](https://hackmd.io/@Marsgoat/leetcode124)
* [149. Max Points on a Line](https://hackmd.io/@Marsgoat/leetcode149)
* [352. Data Stream as Disjoint Intervals](https://hackmd.io/@Marsgoat/leetcode352)
* [446. Arithmetic Slices II - Subsequence](https://hackmd.io/@Marsgoat/leetcode446)
* [460. LFU Cache](https://hackmd.io/@Marsgoat/leetcode460)
* [472. Concatenated Words](https://hackmd.io/@Marsgoat/leetcode472)
* [502. IPO](https://hackmd.io/@Marsgoat/leetcode502)
* [664. Strange Printer](https://hackmd.io/@Marsgoat/leetcode664)
* [834. Sum of Distances in Tree](https://hackmd.io/@Marsgoat/leetcode834)
* [839. Similar String Groups](https://hackmd.io/@Marsgoat/leetcode839)
* [879. Profitable Schemes](https://hackmd.io/@Marsgoat/leetcode879)
* [920. Number of Music Playlists](https://hackmd.io/@Marsgoat/leetcode920)
* [956. Tallest Billboard](https://hackmd.io/@Marsgoat/BkUrCP4dn)
* [980. Unique Paths III](https://hackmd.io/@Marsgoat/leetcode980)
* [1125. Smallest Sufficient Team](https://hackmd.io/@Marsgoat/leetcode1125)
* [1187. Make Array Strictly Increasing](https://hackmd.io/@Marsgoat/BJdXkOEOh)
* [1235. Maximum Profit in Job Scheduling](https://hackmd.io/@Marsgoat/leetcode1235)
* [1289. Minimum Falling Path Sum II](https://hackmd.io/@Marsgoat/leetcode1289)
* [1312. Minimum Insertion Steps to Make a String Palindrome](https://hackmd.io/@Marsgoat/leetcode1312)
* [1345. Jump Game IV](https://hackmd.io/@Marsgoat/leetcode1345)
* [1406. Stone Game III](https://hackmd.io/@Marsgoat/leetcode1406)
* [1416. Restore The Array](https://hackmd.io/@Marsgoat/leetcode1416)
* [1444. Number of Ways of Cutting a Pizza](https://hackmd.io/@Marsgoat/leetcode1444)
* [1547. Minimum Cost to Cut a Stick](https://hackmd.io/@Marsgoat/leetcode1547)
* [1569. Number of Ways to Reorder Array to Get Same BST](https://hackmd.io/@Marsgoat/leetcode1569)
* [1575. Count All Possible Routes](https://hackmd.io/@Marsgoat/BJpu4arO3)
* [1579. Remove Max Number of Edges to Keep Graph Fully Traversable](https://hackmd.io/@Marsgoat/leetcode1579)
* [1601. Maximum Number of Achievable Transfer Requests](https://hackmd.io/@Marsgoat/leetcode1601)
* [1639. Number of Ways to Form a Target String Given a Dictionary](https://hackmd.io/@Marsgoat/leetcode1693)
* [1675. Minimize Deviation in Array](https://hackmd.io/@Marsgoat/leetcode1675)
* [1697. Checking Existence of Edge Length Limited Paths](https://hackmd.io/@Marsgoat/leetcode1697)
* [1751. Maximum Number of Events That Can Be Attended II](https://hackmd.io/@Marsgoat/leetcode1751)
* [1799. Maximize Score After N Operations](https://hackmd.io/@Marsgoat/leetcode1799)
* [1857. Largest Color Value in a Directed Graph](https://hackmd.io/@Marsgoat/leetcode1857)
* [1964. Find the Longest Valid Obstacle Course at Each Position](https://hackmd.io/@Marsgoat/leetcode1964)
* [2141. Maximum Running Time of N Computers](https://hackmd.io/@Marsgoat/leetcode2141)
* [2218. Maximum Value of K Coins From Piles](https://hackmd.io/@Marsgoat/leetcode2218)
* [2246. Longest Path With Different Adjacent Characters](https://hackmd.io/@Marsgoat/leetcode2246)
* [2272. Substring With Largest Variance](https://hackmd.io/@Marsgoat/leetcode2272)
* [2306. Naming a Company](https://hackmd.io/@Marsgoat/leetcode2306)
* [2328. Number of Increasing Paths in a Grid](https://hackmd.io/@Marsgoat/H1fUbOVOh)
* [2360. Longest Cycle in a Graph](https://hackmd.io/@Marsgoat/leetcode2360)
* [2421. Number of Good Paths](https://hackmd.io/@Marsgoat/leetcode2421)
* [2444. Count Subarrays With Fixed Bounds](https://hackmd.io/@Marsgoat/leetcode2444)
* [2551. Put Marbles in Bags](https://hackmd.io/@Marsgoat/leetcode2551)
:::

## 題型

### Array
:::spoiler 題目列表
* [35. Search Insert Position](https://hackmd.io/@Marsgoat/leetcode35)
* [36. Valid Sudoku](https://hackmd.io/@Marsgoat/leetcode36)
* [45. Jump Game II](https://hackmd.io/@Marsgoat/leetcode45)
* [46. Permutations](https://hackmd.io/@Marsgoat/leetcode46)
* [54. Spiral Matrix](https://hackmd.io/@Marsgoat/leetcode54)
* [55. Jump Game](https://hackmd.io/@Marsgoat/leetcode55)
* [57. Insert Interval](https://hackmd.io/@Marsgoat/leetcode57)
* [64. Minimum Path Sum](https://hackmd.io/@Marsgoat/leetcode64)
* [79. Word Search](https://hackmd.io/@Marsgoat/leetcode79)
* [81. Search in Rotated Sorted Array II](https://hackmd.io/@Marsgoat/leetcode81)
* [106. Construct Binary Tree from Inorder and Postorder Traversal](https://hackmd.io/@Marsgoat/leetcode106)
* [121. Best Time to Buy and Sell Stock](https://hackmd.io/@Marsgoat/leetcode121)
* [122. Best Time to Buy and Sell Stock II](https://hackmd.io/@Marsgoat/leetcode122)
* [134. Gas Station](https://hackmd.io/@Marsgoat/leetcode134)
* [137. Single Number II](https://hackmd.io/@Marsgoat/leetcode137)
* [139. Word Break](https://hackmd.io/@Marsgoat/leetcode139)
* [149. Max Points on a Line](https://hackmd.io/@Marsgoat/leetcode149)
* [150. Evaluate Reverse Polish Notation](https://hackmd.io/@Marsgoat/leetcode150)
* [198. House Robber](https://hackmd.io/@Marsgoat/leetcode198)
* [209. Minimum Size Subarray Sum](https://hackmd.io/@Marsgoat/leetcode209)
* [228. Summary Ranges](https://hackmd.io/@Marsgoat/leetcode228)
* [309. Best Time to Buy and Sell Stock with Cooldown](https://hackmd.io/@Marsgoat/leetcode309)
* [347. Top K Frequent Elements](https://hackmd.io/@Marsgoat/leetcode347)
* [373. Find K Pairs with Smallest Sums](https://hackmd.io/@Marsgoat/rkNbuavO3)
* [380. Insert Delete GetRandom O(1)](https://hackmd.io/@Marsgoat/leetcode380)
* [399. Evaluate Division](https://hackmd.io/@Marsgoat/leetcode399)
* [427. Construct Quad Tree](https://hackmd.io/@Marsgoat/leetcode427)
* [435. Non-overlapping Intervals](https://hackmd.io/@Marsgoat/leetcode435)
* [446. Arithmetic Slices II - Subsequence](https://hackmd.io/@Marsgoat/leetcode446)
* [452. Minimum Number of Arrows to Burst Balloons](https://hackmd.io/@Marsgoat/leetcode452)
* [472. Concatenated Words](https://hackmd.io/@Marsgoat/leetcode472)
* [486. Predict the Winner](https://hackmd.io/@Marsgoat/leetcode486)
* [491. Non-decreasing Subsequences](https://hackmd.io/@Marsgoat/leetcode491)
* [502. IPO](https://hackmd.io/@Marsgoat/leetcode502)
* [540. Single Element in a Sorted Array](https://hackmd.io/@Marsgoat/leetcode540)
* [605. Can Place Flowers](https://hackmd.io/@Marsgoat/leetcode605)
* [673. Number of Longest Increasing Subsequence](https://hackmd.io/@Marsgoat/leetcode673)
* [704. Binary Search](https://hackmd.io/@Marsgoat/leetcode704)
* [705. Design HashSet](https://hackmd.io/@Marsgoat/leetcode705)
* [714. Best Time to Buy and Sell Stock with Transaction Fee](https://hackmd.io/@Marsgoat/H1YZ9l7dn)
* [735. Asteroid Collision](https://hackmd.io/@Marsgoat/leetcode735)
* [739. Daily Temperatures](https://hackmd.io/@Marsgoat/leetcode739)
* [744. Find Smallest Letter Greater Than Target](https://hackmd.io/@Marsgoat/leetcode744)
* [839. Similar String Groups](https://hackmd.io/@Marsgoat/leetcode839)
* [852. Peak Index in a Mountain Array](https://hackmd.io/@Marsgoat/leetcode852)
* [875. Koko Eating Bananas](https://hackmd.io/@Marsgoat/leetcode875)
* [877. Stone Game](https://hackmd.io/@Marsgoat/leetcode877)
* [879. Profitable Schemes](https://hackmd.io/@Marsgoat/leetcode879)
* [881. Boats to Save People](https://hackmd.io/@Marsgoat/leetcode881)
* [904. Fruit Into Baskets](https://hackmd.io/@Marsgoat/leetcode904)
* [907. Sum of Subarray Minimums](https://hackmd.io/@Marsgoat/leetcode907)
* [909. Snakes and Ladders](https://hackmd.io/@Marsgoat/leetcode909)
* [912. Sort an Array](https://hackmd.io/@Marsgoat/leetcode912)
* [918. Maximum Sum Circular Subarray](https://hackmd.io/@Marsgoat/leetcode918)
* [931. Minimum Falling Path Sum](https://hackmd.io/@Marsgoat/leetcode931)
* [934. Shortest Bridge](https://hackmd.io/@Marsgoat/leetcode934)
* [946. Validate Stack Sequences](https://hackmd.io/@Marsgoat/leetcode946)
* [953. Verifying an Alien Dictionary](https://hackmd.io/@Marsgoat/leetcode953)
* [956. Tallest Billboard](https://hackmd.io/@Marsgoat/BkUrCP4dn)
* [974. Subarray Sums Divisible by K](https://hackmd.io/@Marsgoat/leetcode974)
* [980. Unique Paths III](https://hackmd.io/@Marsgoat/leetcode980)
* [983. Minimum Cost For Tickets](https://hackmd.io/@Marsgoat/leetcode983)
* [997. Find the Town Judge](https://hackmd.io/@Marsgoat/leetcode997)
* [1011. Capacity To Ship Packages Within D Days](https://hackmd.io/@Marsgoat/leetcode1011)
* [1020. Number of Enclaves](https://hackmd.io/@Marsgoat/leetcode1020)
* [1027. Longest Arithmetic Subsequence](https://hackmd.io/@Marsgoat/rknSogQ_h)
* [1046. Last Stone Weight](https://hackmd.io/@Marsgoat/leetcode1046)
* [1091. Shortest Path in Binary Matrix](https://hackmd.io/@Marsgoat/leetcode1091)
* [1125. Smallest Sufficient Team](https://hackmd.io/@Marsgoat/leetcode1125)
* [1140. Stone Game II](https://hackmd.io/@Marsgoat/leetcode1140)
* [1146. Snapshot Array](https://hackmd.io/@Marsgoat/leetcode1146)
* [1162. As Far from Land as Possible](https://hackmd.io/@Marsgoat/leetcode1162)
* [1187. Make Array Strictly Increasing](https://hackmd.io/@Marsgoat/BJdXkOEOh)
* [1207. Unique Number of Occurrences](https://hackmd.io/@Marsgoat/leetcode1207)
* [1218. Longest Arithmetic Subsequence of Given Difference](https://hackmd.io/@Marsgoat/leetcode1218)
* [1232. Check If It Is a Straight Line](https://hackmd.io/@Marsgoat/leetcode1232)
* [1289. Minimum Falling Path Sum II](https://hackmd.io/@Marsgoat/leetcode1289)
* [1345. Jump Game IV](https://hackmd.io/@Marsgoat/leetcode1345)
* [1402. Reducing Dishes](https://hackmd.io/@Marsgoat/leetcode1402)
* [1406. Stone Game III](https://hackmd.io/@Marsgoat/leetcode1406)
* [1431. Kids With the Greatest Number of Candies](https://hackmd.io/@Marsgoat/leetcode1431)
* [1444. Number of Ways of Cutting a Pizza](https://hackmd.io/@Marsgoat/leetcode1444)
* [1470. Shuffle the Array](https://hackmd.io/@Marsgoat/leetcode1470)
* [1472. Design Browser History](https://hackmd.io/@Marsgoat/leetcode1472)
* [1491. Average Salary Excluding the Minimum and Maximum Salary](https://hackmd.io/@Marsgoat/leetcode1491)
* [1493. Longest Subarray of 1's After Deleting One Element](https://hackmd.io/@Marsgoat/leetcode1493)
* [1498. Number of Subsequences That Satisfy the Given Sum Condition](https://hackmd.io/@Marsgoat/leetcode1498)
* [1502. Can Make Arithmetic Progression From Sequence](https://hackmd.io/@Marsgoat/leetcode1502)
* [1514. Path with Maximum Probability](https://hackmd.io/@Marsgoat/B15eOMt_h)
* [1539. Kth Missing Positive Number](https://hackmd.io/@Marsgoat/leetcode1539)
* [1547. Minimum Cost to Cut a Stick](https://hackmd.io/@Marsgoat/leetcode1547)
* [1575. Count All Possible Routes](https://hackmd.io/@Marsgoat/BJpu4arO3)
* [1601. Maximum Number of Achievable Transfer Requests](https://hackmd.io/@Marsgoat/leetcode1601)
* [1626. Best Team With No Conflicts](https://hackmd.io/@Marsgoat/leetcode1626)
* [1639. Number of Ways to Form a Target String Given a Dictionary](https://hackmd.io/@Marsgoat/leetcode1693)
* [1675. Minimize Deviation in Array](https://hackmd.io/@Marsgoat/leetcode1675)
* [1697. Checking Existence of Edge Length Limited Paths](https://hackmd.io/@Marsgoat/leetcode1697)
* [1732. Find the Highest Altitude](https://hackmd.io/@skylanly/leetcode1732)
* [1751. Maximum Number of Events That Can Be Attended II](https://hackmd.io/@Marsgoat/leetcode1751)
* [1799. Maximize Score After N Operations](https://hackmd.io/@Marsgoat/leetcode1799)
* [1822. Sign of the Product of an Array](https://hackmd.io/@Marsgoat/leetcode1822)
* [1833. Maximum Ice Cream Bars](https://hackmd.io/@Marsgoat/leetcode1833)
* [1834. Single-Threaded CPU](https://hackmd.io/@Marsgoat/leetcode1834)
* [1870. Minimum Speed to Arrive on Time](https://hackmd.io/@Marsgoat/leetcode1870)
* [1926. Nearest Exit from Entrance in Maze](https://hackmd.io/@Marsgoat/leetcode1926)
* [1962. Remove Stones to Minimize the Total](https://hackmd.io/@Marsgoat/leetcode1962)
* [1964. Find the Longest Valid Obstacle Course at Each Position](https://hackmd.io/@Marsgoat/leetcode1964)
* [2024. Maximize the Confusion of an Exam](https://hackmd.io/@Marsgoat/leetcode2024)
* [2090. K Radius Subarray Averages](https://hackmd.io/@Marsgoat/leetcode2090)
* [2101. Detonate the Maximum Bombs](https://hackmd.io/@Marsgoat/leetcode2101)
* [2140. Solving Questions With Brainpower](https://hackmd.io/@Marsgoat/leetcode2140)
* [2141. Maximum Running Time of N Computers](https://hackmd.io/@Marsgoat/leetcode2141)
* [2187. Minimum Time to Complete Trips](https://hackmd.io/@Marsgoat/leetcode2187)
* [2218. Maximum Value of K Coins From Piles](https://hackmd.io/@Marsgoat/leetcode2218)
* [2225. Find Players With Zero or One Losses](https://hackmd.io/@Marsgoat/leetcode2225)
* [2244. Minimum Rounds to Complete All Tasks](https://hackmd.io/@Marsgoat/leetcode2244)
* [2246. Longest Path With Different Adjacent Characters](https://hackmd.io/@Marsgoat/leetcode2246)
* [2256. Minimum Average Difference](https://hackmd.io/@Marsgoat/leetcode2256)
* [2272. Substring With Largest Variance](https://hackmd.io/@Marsgoat/leetcode2272)
* [2279. Maximum Bags With Full Capacity of Rocks](https://hackmd.io/@Marsgoat/leetcode2279)
* [2300. Successful Pairs of Spells and Potions](https://hackmd.io/@Marsgoat/leetcode2300)
* [2305. Fair Distribution of Cookies](https://hackmd.io/@Marsgoat/leetcode2305)
* [2306. Naming a Company](https://hackmd.io/@Marsgoat/leetcode2306)
* [2328. Number of Increasing Paths in a Grid](https://hackmd.io/@Marsgoat/H1fUbOVOh)
* [2348. Number of Zero-Filled Subarrays](https://hackmd.io/@Marsgoat/leetcode2348)
* [2352. Equal Row and Column Pairs](https://hackmd.io/@Marsgoat/leetcode2352)
* [2389. Longest Subsequence With Limited Sum](https://hackmd.io/@RonChen0927/leetcode2389)
* [2421. Number of Good Paths](https://hackmd.io/@Marsgoat/leetcode2421)
* [2439. Minimize Maximum of Array](https://hackmd.io/@Marsgoat/leetcode2439)
* [2444. Count Subarrays With Fixed Bounds](https://hackmd.io/@Marsgoat/leetcode2444)
* [2462. Total Cost to Hire K Workers](https://hackmd.io/@Marsgoat/B1kR8dUOh)
* [2498. Frog Jump II](https://hackmd.io/@Marsgoat/leetcode2498)
* [2542. Maximum Subsequence Score](https://hackmd.io/@Marsgoat/leetcode2542)
* [2551. Put Marbles in Bags](https://hackmd.io/@Marsgoat/leetcode2551)
* [2616. Minimize the Maximum Difference of Pairs](https://hackmd.io/@Marsgoat/leetcode2616)
:::
### Linked List
:::spoiler 題目列表
* [23. Merge k Sorted Lists](https://hackmd.io/@Marsgoat/leetcode23)
* [109. Convert Sorted List to Binary Search Tree](https://hackmd.io/@Marsgoat/leetcode109)
* [142. Linked List Cycle II](https://hackmd.io/@Marsgoat/leetcode142)
* [146. LRU Cache](https://hackmd.io/@Marsgoat/leetcode146)
* [148. Sort List](https://hackmd.io/@RonChen0927/leetcode148)
* [328. Odd Even Linked List](https://hackmd.io/@Marsgoat/leetcode328)
* [382. Linked List Random Node](https://hackmd.io/@Marsgoat/leetcode382)
* [445. Add Two Numbers II](https://hackmd.io/@Marsgoat/leetcode445)
* [460. LFU Cache](https://hackmd.io/@Marsgoat/leetcode460)
* [705. Design HashSet](https://hackmd.io/@Marsgoat/leetcode705)
* [876. Middle of the Linked List](https://hackmd.io/@Marsgoat/leetcode876)
* [1472. Design Browser History](https://hackmd.io/@Marsgoat/leetcode1472)
* [2130. Maximum Twin Sum of a Linked List](https://hackmd.io/@Marsgoat/leetcode2130)
:::
### Matrix
:::spoiler 題目列表
* [36. Valid Sudoku](https://hackmd.io/@Marsgoat/leetcode36)
* [54. Spiral Matrix](https://hackmd.io/@Marsgoat/leetcode54)
* [64. Minimum Path Sum](https://hackmd.io/@Marsgoat/leetcode64)
* [79. Word Search](https://hackmd.io/@Marsgoat/leetcode79)
* [427. Construct Quad Tree](https://hackmd.io/@Marsgoat/leetcode427)
* [909. Snakes and Ladders](https://hackmd.io/@Marsgoat/leetcode909)
* [931. Minimum Falling Path Sum](https://hackmd.io/@Marsgoat/leetcode931)
* [934. Shortest Bridge](https://hackmd.io/@Marsgoat/leetcode934)
* [980. Unique Paths III](https://hackmd.io/@Marsgoat/leetcode980)
* [1020. Number of Enclaves](https://hackmd.io/@Marsgoat/leetcode1020)
* [1091. Shortest Path in Binary Matrix](https://hackmd.io/@Marsgoat/leetcode1091)
* [1162. As Far from Land as Possible](https://hackmd.io/@Marsgoat/leetcode1162)
* [1235. Maximum Profit in Job Scheduling](https://hackmd.io/@Marsgoat/leetcode1235)
* [1289. Minimum Falling Path Sum II](https://hackmd.io/@Marsgoat/leetcode1289)
* [1444. Number of Ways of Cutting a Pizza](https://hackmd.io/@Marsgoat/leetcode1444)
* [1721. Swapping Nodes in a Linked List](https://hackmd.io/@Marsgoat/leetcode1721)
* [1926. Nearest Exit from Entrance in Maze](https://hackmd.io/@Marsgoat/leetcode1926)
* [2328. Number of Increasing Paths in a Grid](https://hackmd.io/@Marsgoat/H1fUbOVOh)
* [2352. Equal Row and Column Pairs](https://hackmd.io/@Marsgoat/leetcode2352)
:::
### String
:::spoiler 題目列表
* [6. Zigzag Conversion](https://hackmd.io/@Marsgoat/leetcode6)
* [17. Letter Combinations of a Phone Number](https://hackmd.io/@Marsgoat/leetcode17)
* [20. Valid Parentheses](https://hackmd.io/@Marsgoat/leetcode20)
* [28. Find the Index of the First Occurrence in a String](https://hackmd.io/@Marsgoat/leetcode28)
* [67. Add Binary](https://hackmd.io/@Marsgoat/leetcode67)
* [71. Simplify Path](https://hackmd.io/@Marsgoat/leetcode71)
* [72. Edit Distance](https://hackmd.io/@Marsgoat/leetcode72)
* [87. Scramble String](https://hackmd.io/@Marsgoat/leetcode87)
* [93. Restore IP Addresses](https://hackmd.io/@Marsgoat/leetcode93)
* [131. Palindrome Partitioning](https://hackmd.io/@Marsgoat/leetcode131)
* [139. Word Break](https://hackmd.io/@Marsgoat/leetcode139)
* [208. Implement Trie (Prefix Tree)](https://hackmd.io/@Marsgoat/leetcode208)
* [211. Design Add and Search Words Data Structure](https://hackmd.io/@Marsgoat/leetcode211)
* [290. Word Pattern](https://hackmd.io/@Marsgoat/leetcode290)
* [409. Longest Palindrome](https://hackmd.io/@RonChen0927/leetcode409)
* [438. Find All Anagrams in a String](https://hackmd.io/@Marsgoat/leetcode438)
* [443. String Compression](https://hackmd.io/@Marsgoat/leetcode443)
* [451. Sort Characters By Frequency](https://hackmd.io/@Marsgoat/leetcode451)
* [472. Concatenated Words](https://hackmd.io/@Marsgoat/leetcode472)
* [520. Detect Capital](https://hackmd.io/@Marsgoat/leetcode520)
* [567. Permutation in String](https://hackmd.io/@Marsgoat/leetcode567)
* [649. Dota2 Senate](https://hackmd.io/@Marsgoat/leetcode649)
* [664. Strange Printer](https://hackmd.io/@Marsgoat/leetcode664)
* [712. Minimum ASCII Delete Sum for Two Strings](https://hackmd.io/@Marsgoat/leetcode712)
* [791. Custom Sort String](https://hackmd.io/@skylanly/leetcode791)
* [839. Similar String Groups](https://hackmd.io/@Marsgoat/leetcode839)
* [859. Buddy Strings](https://hackmd.io/@Marsgoat/leetcode859)
* [926. Flip String to Monotone Increasing](https://hackmd.io/@Marsgoat/leetcode926)
* [953. Verifying an Alien Dictionary](https://hackmd.io/@Marsgoat/leetcode953)
* [1061. Lexicographically Smallest Equivalent String](https://hackmd.io/@Marsgoat/leetcode1061)
* [1143. Longest Common Subsequence](https://hackmd.io/@Marsgoat/leetcode1143)
* [1312. Minimum Insertion Steps to Make a String Palindrome](https://hackmd.io/@Marsgoat/leetcode1312)
* [1396. Design Underground System](https://hackmd.io/@Marsgoat/leetcode1396)
* [1416. Restore The Array](https://hackmd.io/@Marsgoat/leetcode1416)
* [1456. Maximum Number of Vowels in a Substring of Given Length](https://hackmd.io/@Marsgoat/leetcode1456)
* [1639. Number of Ways to Form a Target String Given a Dictionary](https://hackmd.io/@Marsgoat/leetcode1693)
* [1657. Determine if Two Strings Are Close](https://hackmd.io/@Marsgoat/leetcode1657)
* [1704. Determine if String Halves Are Alike](https://hackmd.io/@Marsgoat/leetcode1704)
* [1768. Merge Strings Alternately](https://hackmd.io/@Marsgoat/leetcode1768)
* [2024. Maximize the Confusion of an Exam](https://hackmd.io/@Marsgoat/leetcode2024)
* [2246. Longest Path With Different Adjacent Characters](https://hackmd.io/@Marsgoat/leetcode2246)
* [2306. Naming a Company](https://hackmd.io/@Marsgoat/leetcode2306)
* [2390. Removing Stars From a String](https://hackmd.io/@Marsgoat/leetcode2390)
* [2405. Optimal Partition of String](https://hackmd.io/@Marsgoat/leetcode2405)
:::
### Math
:::spoiler 題目列表
* [67. Add Binary](https://hackmd.io/@Marsgoat/leetcode67)
* [70. Climbing Stairs](https://hackmd.io/@Marsgoat/leetcode70)
* [149. Max Points on a Line](https://hackmd.io/@Marsgoat/leetcode149)
* [150. Evaluate Reverse Polish Notation](https://hackmd.io/@Marsgoat/leetcode150)
* [258. Add Digits](https://hackmd.io/@Marsgoat/leetcode258)
* [279. Perfect Squares](https://hackmd.io/@Marsgoat/leetcode279)
* [319. Bulb Switcher](https://hackmd.io/@Marsgoat/leetcode319)
* [371. Sum of Two Integers](https://hackmd.io/@Marsgoat/leetcode371)
* [380. Insert Delete GetRandom O(1)](https://hackmd.io/@Marsgoat/leetcode380)
* [382. Linked List Random Node](https://hackmd.io/@Marsgoat/leetcode382)
* [445. Add Two Numbers II](https://hackmd.io/@Marsgoat/leetcode445)
* [486. Predict the Winner](https://hackmd.io/@Marsgoat/leetcode486)
* [808. Soup Servings](https://hackmd.io/@Marsgoat/leetcode808)
* [837. New 21 Game](https://hackmd.io/@Marsgoat/leetcode837)
* [877. Stone Game](https://hackmd.io/@Marsgoat/leetcode877)
* [920. Number of Music Playlists](https://hackmd.io/@Marsgoat/leetcode920)
* [1137. N-th Tribonacci Number](https://hackmd.io/@Marsgoat/leetcode1137)
* [1232. Check If It Is a Straight Line](https://hackmd.io/@Marsgoat/leetcode1232)
* [1140. Stone Game II](https://hackmd.io/@Marsgoat/leetcode1140)
* [1406. Stone Game III](https://hackmd.io/@Marsgoat/leetcode1406)
* [1523. Count Odd Numbers in an Interval Range](https://hackmd.io/@Marsgoat/leetcode1523)
* [1569. Number of Ways to Reorder Array to Get Same BST](https://hackmd.io/@Marsgoat/leetcode1569)
* [1799. Maximize Score After N Operations](https://hackmd.io/@Marsgoat/leetcode1799)
* [1822. Sign of the Product of an Array](https://hackmd.io/@Marsgoat/leetcode1822)
* [2101. Detonate the Maximum Bombs](https://hackmd.io/@Marsgoat/leetcode2101)
* [2348. Number of Zero-Filled Subarrays](https://hackmd.io/@Marsgoat/leetcode2348)
:::
### Bit Manipulation
:::spoiler 題目列表
* [67. Add Binary](https://hackmd.io/@Marsgoat/leetcode67)
* [137. Single Number II](https://hackmd.io/@Marsgoat/leetcode137)
* [371. Sum of Two Integers](https://hackmd.io/@Marsgoat/leetcode371)
* [491. Non-decreasing Subsequences](https://hackmd.io/@Marsgoat/leetcode491)
* [980. Unique Paths III](https://hackmd.io/@Marsgoat/leetcode980)
* [1125. Smallest Sufficient Team](https://hackmd.io/@Marsgoat/leetcode1125)
* [1318. Minimum Flips to Make a OR b Equal to c](https://hackmd.io/@Marsgoat/leetcode1318)
* [1601. Maximum Number of Achievable Transfer Requests](https://hackmd.io/@Marsgoat/leetcode1601)
* [1799. Maximize Score After N Operations](https://hackmd.io/@Marsgoat/leetcode1799)
* [2305. Fair Distribution of Cookies](https://hackmd.io/@Marsgoat/leetcode2305)
* [2306. Naming a Company](https://hackmd.io/@Marsgoat/leetcode2306)
:::
### Stack/Queue
:::spoiler 題目列表
* [20. Valid Parentheses](https://hackmd.io/@Marsgoat/leetcode20)
* [71. Simplify Path](https://hackmd.io/@Marsgoat/leetcode71)
* [144. Binary Tree Preorder Traversal](https://hackmd.io/@Marsgoat/leetcode144)
* [150. Evaluate Reverse Polish Notation](https://hackmd.io/@Marsgoat/leetcode150)
* [232. Implement Queue using Stacks](https://hackmd.io/@Marsgoat/leetcode232)
* [445. Add Two Numbers II](https://hackmd.io/@Marsgoat/leetcode445)
* [649. Dota2 Senate](https://hackmd.io/@Marsgoat/leetcode649)
* [735. Asteroid Collision](https://hackmd.io/@Marsgoat/leetcode735)
* [739. Daily Temperatures](https://hackmd.io/@Marsgoat/leetcode739)
* [907. Sum of Subarray Minimums](https://hackmd.io/@Marsgoat/leetcode907)
* [918. Maximum Sum Circular Subarray](https://hackmd.io/@Marsgoat/leetcode918)
* [946. Validate Stack Sequences](https://hackmd.io/@Marsgoat/leetcode946)
* [1472. Design Browser History](https://hackmd.io/@Marsgoat/leetcode1472)
* [2130. Maximum Twin Sum of a Linked List](https://hackmd.io/@Marsgoat/leetcode2130)
* [2390. Removing Stars From a String](https://hackmd.io/@Marsgoat/leetcode2390)
* [2444. Count Subarrays With Fixed Bounds](https://hackmd.io/@Marsgoat/leetcode2444)
:::
### Hash Table
:::spoiler 題目列表
* [17. Letter Combinations of a Phone Number](https://hackmd.io/@Marsgoat/leetcode17)
* [36. Valid Sudoku](https://hackmd.io/@Marsgoat/leetcode36)
* [106. Construct Binary Tree from Inorder and Postorder Traversal](https://hackmd.io/@Marsgoat/leetcode106)
* [133. Clone Graph](https://hackmd.io/@Marsgoat/leetcode133)
* [139. Word Break](https://hackmd.io/@Marsgoat/leetcode139)
* [142. Linked List Cycle II](https://hackmd.io/@Marsgoat/leetcode142)
* [146. LRU Cache](https://hackmd.io/@Marsgoat/leetcode146)
* [149. Max Points on a Line](https://hackmd.io/@Marsgoat/leetcode149)
* [208. Implement Trie (Prefix Tree)](https://hackmd.io/@Marsgoat/leetcode208)
* [290. Word Pattern](https://hackmd.io/@Marsgoat/leetcode290)
* [347. Top K Frequent Elements](https://hackmd.io/@Marsgoat/leetcode347)
* [380. Insert Delete GetRandom O(1)](https://hackmd.io/@Marsgoat/leetcode380)
* [409. Longest Palindrome](https://hackmd.io/@RonChen0927/leetcode409)
* [438. Find All Anagrams in a String](https://hackmd.io/@Marsgoat/leetcode438)
* [451. Sort Characters By Frequency](https://hackmd.io/@Marsgoat/leetcode451)
* [460. LFU Cache](https://hackmd.io/@Marsgoat/leetcode460)
* [491. Non-decreasing Subsequences](https://hackmd.io/@Marsgoat/leetcode491)
* [567. Permutation in String](https://hackmd.io/@Marsgoat/leetcode567)
* [652. Find Duplicate Subtrees](https://hackmd.io/@Marsgoat/leetcode652)
* [705. Design HashSet](https://hackmd.io/@Marsgoat/leetcode705)
* [791. Custom Sort String](https://hackmd.io/@skylanly/leetcode791)
* [859. Buddy Strings](https://hackmd.io/@Marsgoat/leetcode859)
* [904. Fruit Into Baskets](https://hackmd.io/@Marsgoat/leetcode904)
* [953. Verifying an Alien Dictionary](https://hackmd.io/@Marsgoat/leetcode953)
* [974. Subarray Sums Divisible by K](https://hackmd.io/@Marsgoat/leetcode974)
* [997. Find the Town Judge](https://hackmd.io/@Marsgoat/leetcode997)
* [1027. Longest Arithmetic Subsequence](https://hackmd.io/@Marsgoat/rknSogQ_h)
* [1146. Snapshot Array](https://hackmd.io/@Marsgoat/leetcode1146)
* [1207. Unique Number of Occurrences](https://hackmd.io/@Marsgoat/leetcode1207)
* [1218. Longest Arithmetic Subsequence of Given Difference](https://hackmd.io/@Marsgoat/leetcode1218)
* [1345. Jump Game IV](https://hackmd.io/@Marsgoat/leetcode1345)
* [1396. Design Underground System](https://hackmd.io/@Marsgoat/leetcode1396)
* [1443. Minimum Time to Collect All Apples in a Tree](https://hackmd.io/@Marsgoat/leetcode1443)
* [1657. Determine if Two Strings Are Close](https://hackmd.io/@Marsgoat/leetcode1657)
* [1857. Largest Color Value in a Directed Graph](https://hackmd.io/@Marsgoat/leetcode1857)
* [2225. Find Players With Zero or One Losses](https://hackmd.io/@Marsgoat/leetcode2225)
* [2244. Minimum Rounds to Complete All Tasks](https://hackmd.io/@Marsgoat/leetcode2244)
* [2306. Naming a Company](https://hackmd.io/@Marsgoat/leetcode2306)
* [2336. Smallest Number in Infinite Set](https://hackmd.io/@Marsgoat/leetcode2336)
* [2352. Equal Row and Column Pairs](https://hackmd.io/@Marsgoat/leetcode2352)
* [2405. Optimal Partition of String](https://hackmd.io/@Marsgoat/leetcode2405)
:::
### Prefix Sum
:::spoiler 題目列表
* [974. Subarray Sums Divisible by K](https://hackmd.io/@Marsgoat/leetcode974)
* [1732. Find the Highest Altitude](https://hackmd.io/@skylanly/leetcode1732)
* [2024. Maximize the Confusion of an Exam](https://hackmd.io/@Marsgoat/leetcode2024)
* [2218. Maximum Value of K Coins From Piles](https://hackmd.io/@Marsgoat/leetcode2218)
* [2256. Minimum Average Difference](https://hackmd.io/@Marsgoat/leetcode2256)
* [2389. Longest Subsequence With Limited Sum](https://hackmd.io/@RonChen0927/leetcode2389)
* [2439. Minimize Maximum of Array](https://hackmd.io/@Marsgoat/leetcode2439)
:::
### Greedy
:::spoiler 題目列表
* [45. Jump Game II](https://hackmd.io/@Marsgoat/leetcode45)
* [55. Jump Game](https://hackmd.io/@Marsgoat/leetcode55)
* [122. Best Time to Buy and Sell Stock II](https://hackmd.io/@Marsgoat/leetcode122)
* [134. Gas Station](https://hackmd.io/@Marsgoat/leetcode134)
* [409. Longest Palindrome](https://hackmd.io/@RonChen0927/leetcode409)
* [435. Non-overlapping Intervals](https://hackmd.io/@Marsgoat/leetcode435)
* [452. Minimum Number of Arrows to Burst Balloons](https://hackmd.io/@Marsgoat/leetcode452)
* [502. IPO](https://hackmd.io/@Marsgoat/leetcode502)
* [605. Can Place Flowers](https://hackmd.io/@Marsgoat/leetcode605)
* [649. Dota2 Senate](https://hackmd.io/@Marsgoat/leetcode649)
* [714. Best Time to Buy and Sell Stock with Transaction Fee](https://hackmd.io/@Marsgoat/H1YZ9l7dn)
* [881. Boats to Save People](https://hackmd.io/@Marsgoat/leetcode881)
* [1402. Reducing Dishes](https://hackmd.io/@Marsgoat/leetcode1402)
* [1675. Minimize Deviation in Array](https://hackmd.io/@Marsgoat/leetcode1675)
* [1802. Maximum Value at a Given Index in a Bounded Array](https://hackmd.io/@Marsgoat/leetcode1802)
* [1833. Maximum Ice Cream Bars](https://hackmd.io/@Marsgoat/leetcode1833)
* [2141. Maximum Running Time of N Computers](https://hackmd.io/@Marsgoat/leetcode2141)
* [2244. Minimum Rounds to Complete All Tasks](https://hackmd.io/@Marsgoat/leetcode2244)
* [2279. Maximum Bags With Full Capacity of Rocks](https://hackmd.io/@Marsgoat/leetcode2279)
* [2389. Longest Subsequence With Limited Sum](https://hackmd.io/@RonChen0927/leetcode2389)
* [2405. Optimal Partition of String](https://hackmd.io/@Marsgoat/leetcode2405)
* [2439. Minimize Maximum of Array](https://hackmd.io/@Marsgoat/leetcode2439)
* [2498. Frog Jump II](https://hackmd.io/@Marsgoat/leetcode2498)
* [2542. Maximum Subsequence Score](https://hackmd.io/@Marsgoat/leetcode2542)
* [2551. Put Marbles in Bags](https://hackmd.io/@Marsgoat/leetcode2551)
* [2616. Minimize the Maximum Difference of Pairs](https://hackmd.io/@Marsgoat/leetcode2616)
:::
### Backtracking
:::spoiler 題目列表
* [17. Letter Combinations of a Phone Number](https://hackmd.io/@Marsgoat/leetcode17)
* [46. Permutations](https://hackmd.io/@Marsgoat/leetcode46)
* [77. Combinations](https://hackmd.io/@Marsgoat/leetcode77)
* [79. Word Search](https://hackmd.io/@Marsgoat/leetcode79)
* [93. Restore IP Addresses](https://hackmd.io/@Marsgoat/leetcode93)
* [95. Unique Binary Search Trees II](https://hackmd.io/@Marsgoat/leetcode95)
* [131. Palindrome Partitioning](https://hackmd.io/@Marsgoat/leetcode131)
* [491. Non-decreasing Subsequences](https://hackmd.io/@Marsgoat/leetcode491)
* [797. All Paths From Source to Target](https://hackmd.io/@RonChen0927/leetcode797)
* [980. Unique Paths III](https://hackmd.io/@Marsgoat/leetcode980)
* [1601. Maximum Number of Achievable Transfer Requests](https://hackmd.io/@Marsgoat/leetcode1601)
* [1799. Maximize Score After N Operations](https://hackmd.io/@Marsgoat/leetcode1799)
* [2305. Fair Distribution of Cookies](https://hackmd.io/@Marsgoat/leetcode2305)
:::
### Two Pointers
:::spoiler 題目列表
* [28. Find the Index of the First Occurrence in a String](https://hackmd.io/@Marsgoat/leetcode28)
* [142. Linked List Cycle II](https://hackmd.io/@Marsgoat/leetcode142)
* [443. String Compression](https://hackmd.io/@Marsgoat/leetcode443)
* [567. Permutation in String](https://hackmd.io/@Marsgoat/leetcode567)
* [876. Middle of the Linked List](https://hackmd.io/@Marsgoat/leetcode876)
* [881. Boats to Save People](https://hackmd.io/@Marsgoat/leetcode881)
* [1498. Number of Subsequences That Satisfy the Given Sum Condition](https://hackmd.io/@Marsgoat/leetcode1498)
* [1721. Swapping Nodes in a Linked List](https://hackmd.io/@Marsgoat/leetcode1721)
* [1768. Merge Strings Alternately](https://hackmd.io/@Marsgoat/leetcode1768)
* [2130. Maximum Twin Sum of a Linked List](https://hackmd.io/@Marsgoat/leetcode2130)
* [2300. Successful Pairs of Spells and Potions](https://hackmd.io/@Marsgoat/leetcode2300)
* [2462. Total Cost to Hire K Workers](https://hackmd.io/@Marsgoat/B1kR8dUOh)
:::
### Sliding Window
:::spoiler 題目列表
* [209. Minimum Size Subarray Sum
](https://hackmd.io/@Marsgoat/leetcode209)
* [438. Find All Anagrams in a String](https://hackmd.io/@Marsgoat/leetcode438)
* [567. Permutation in String](https://hackmd.io/@Marsgoat/leetcode567)
* [837. New 21 Game](https://hackmd.io/@Marsgoat/leetcode837)
* [904. Fruit Into Baskets](https://hackmd.io/@Marsgoat/leetcode904)
* [1456. Maximum Number of Vowels in a Substring of Given Length](https://hackmd.io/@Marsgoat/leetcode1456)
* [1493. Longest Subarray of 1's After Deleting One Element](https://hackmd.io/@Marsgoat/leetcode1493)
* [2024. Maximize the Confusion of an Exam](https://hackmd.io/@Marsgoat/leetcode2024)
* [2090. K Radius Subarray Averages](https://hackmd.io/@Marsgoat/leetcode2090)
* [2444. Count Subarrays With Fixed Bounds](https://hackmd.io/@Marsgoat/leetcode2444)
:::

### Sorting
:::spoiler 題目列表
* [148. Sort List](https://hackmd.io/@RonChen0927/leetcode148)
* [347. Top K Frequent Elements](https://hackmd.io/@Marsgoat/leetcode347)
* [435. Non-overlapping Intervals](https://hackmd.io/@Marsgoat/leetcode435)
* [451. Sort Characters By Frequency](https://hackmd.io/@Marsgoat/leetcode451)
* [452. Minimum Number of Arrows to Burst Balloons](https://hackmd.io/@Marsgoat/leetcode452)
* [502. IPO](https://hackmd.io/@Marsgoat/leetcode502)
* [791. Custom Sort String](https://hackmd.io/@skylanly/leetcode791)
* [881. Boats to Save People](https://hackmd.io/@Marsgoat/leetcode881)
* [912. Sort an Array](https://hackmd.io/@Marsgoat/leetcode912)
* [1235. Maximum Profit in Job Scheduling](https://hackmd.io/@Marsgoat/leetcode1235)
* [1402. Reducing Dishes](https://hackmd.io/@Marsgoat/leetcode1402)
* [1491. Average Salary Excluding the Minimum and Maximum Salary](https://hackmd.io/@Marsgoat/leetcode1491)
* [1498. Number of Subsequences That Satisfy the Given Sum Condition](https://hackmd.io/@Marsgoat/leetcode1498)
* [1502. Can Make Arithmetic Progression From Sequence](https://hackmd.io/@Marsgoat/leetcode1502)
* [1547. Minimum Cost to Cut a Stick](https://hackmd.io/@Marsgoat/leetcode1547)
* [1626. Best Team With No Conflicts](https://hackmd.io/@Marsgoat/leetcode1626)
* [1657. Determine if Two Strings Are Close](https://hackmd.io/@Marsgoat/leetcode1657)
* [1751. Maximum Number of Events That Can Be Attended II](https://hackmd.io/@Marsgoat/leetcode1751)
* [1833. Maximum Ice Cream Bars](https://hackmd.io/@Marsgoat/leetcode1833)
* [1834. Single-Threaded CPU](https://hackmd.io/@Marsgoat/leetcode1834)
* [2141. Maximum Running Time of N Computers](https://hackmd.io/@Marsgoat/leetcode2141)
* [2225. Find Players With Zero or One Losses](https://hackmd.io/@Marsgoat/leetcode2225)
* [2279. Maximum Bags With Full Capacity of Rocks](https://hackmd.io/@Marsgoat/leetcode2279)
* [2300. Successful Pairs of Spells and Potions](https://hackmd.io/@Marsgoat/leetcode2300)
* [2389. Longest Subsequence With Limited Sum](https://hackmd.io/@RonChen0927/leetcode2389)
* [2542. Maximum Subsequence Score](https://hackmd.io/@Marsgoat/leetcode2542)
* [2551. Put Marbles in Bags](https://hackmd.io/@Marsgoat/leetcode2551)
:::
### Tree
:::spoiler 題目列表
* [95. Unique Binary Search Trees II](https://hackmd.io/@Marsgoat/leetcode95)
* [98. Validate Binary Search Tree](https://hackmd.io/@Marsgoat/leetcode98)
* [100. Same Tree](https://hackmd.io/@Marsgoat/leetcode100)
* [101. Symmetric Tree](https://hackmd.io/@Marsgoat/leetcode101)
* [103. Binary Tree Zigzag Level Order Traversal](https://hackmd.io/@Marsgoat/leetcode103)
* [104. Maximum Depth of Binary Tree](https://hackmd.io/@Marsgoat/leetcode104)
* [106. Construct Binary Tree from Inorder and Postorder Traversal](https://hackmd.io/@Marsgoat/leetcode106)
* [109. Convert Sorted List to Binary Search Tree](https://hackmd.io/@Marsgoat/leetcode109)
* [111. Minimum Depth of Binary Tree](https://hackmd.io/@Marsgoat/leetcode111)
* [124. Binary Tree Maximum Path Sum](https://hackmd.io/@Marsgoat/leetcode124)
* [129. Sum Root to Leaf Numbers](https://hackmd.io/@Marsgoat/leetcode129)
* [144. Binary Tree Preorder Traversal](https://hackmd.io/@Marsgoat/leetcode144)
* [208. Implement Trie (Prefix Tree)](https://hackmd.io/@Marsgoat/leetcode208)(Trie)
* [226. Invert Binary Tree](https://hackmd.io/@Marsgoat/leetcode226)
* [427. Construct Quad Tree](https://hackmd.io/@Marsgoat/leetcode427)
* [530. Minimum Absolute Difference in BST](https://hackmd.io/@Marsgoat/leetcode530)
* [652. Find Duplicate Subtrees](https://hackmd.io/@Marsgoat/leetcode652)
* [662. Maximum Width of Binary Tree](https://hackmd.io/@Marsgoat/leetcode662)
* [687. Longest Univalue Path](https://hackmd.io/@RonChen0927/leetcode687)
* [703. Kth Largest Element in a Stream](https://hackmd.io/@Marsgoat/leetcode703)
* [783. Minimum Distance Between BST Nodes](https://hackmd.io/@Marsgoat/leetcode783)
* [834. Sum of Distances in Tree](https://hackmd.io/@Marsgoat/leetcode834)
* [872. Leaf-Similar Trees](https://hackmd.io/@Marsgoat/leetcode872)
* [894. All Possible Full Binary Trees](https://hackmd.io/@Marsgoat/leetcode894)
* [938. Range Sum of BST](https://hackmd.io/@Marsgoat/leetcode938)
* [958. Check Completeness of a Binary Tree](https://hackmd.io/@Marsgoat/leetcode958)
* [1026. Maximum Difference Between Node and Ancestor](https://hackmd.io/@Marsgoat/leetcode1026)
* [1161. Maximum Level Sum of a Binary Tree](https://hackmd.io/@Marsgoat/leetcode1161)
* [1339. Maximum Product of Splitted Binary Tree](https://hackmd.io/@Marsgoat/leetcode1339)
* [1372. Longest ZigZag Path in a Binary Tree](https://hackmd.io/@Marsgoat/leetcode1372)
* [1376. Time Needed to Inform All Employees](https://hackmd.io/@Marsgoat/leetcode1376)
* [1443. Minimum Time to Collect All Apples in a Tree](https://hackmd.io/@Marsgoat/leetcode1443)
* [1519. Number of Nodes in the Sub-Tree With the Same Label](https://hackmd.io/@Marsgoat/leetcode1519)
* [1569. Number of Ways to Reorder Array to Get Same BST](https://hackmd.io/@Marsgoat/leetcode1569)
* [2246. Longest Path With Different Adjacent Characters](https://hackmd.io/@Marsgoat/leetcode2246)
* [2421. Number of Good Paths](https://hackmd.io/@Marsgoat/leetcode2421)
* [2477. Minimum Fuel Cost to Report to the Capital](https://hackmd.io/@Marsgoat/leetcode2477)
:::
### Heap
:::spoiler 題目列表
* [23. Merge k Sorted Lists](https://hackmd.io/@Marsgoat/leetcode23)
* [347. Top K Frequent Elements](https://hackmd.io/@Marsgoat/leetcode347)
* [373. Find K Pairs with Smallest Sums](https://hackmd.io/@Marsgoat/rkNbuavO3)
* [451. Sort Characters By Frequency](https://hackmd.io/@Marsgoat/leetcode451)
* [502. IPO](https://hackmd.io/@Marsgoat/leetcode502)
* [703. Kth Largest Element in a Stream](https://hackmd.io/@Marsgoat/leetcode703)
* [787. Cheapest Flights Within K Stops](https://hackmd.io/@Marsgoat/leetcode787)
* [1046. Last Stone Weight](https://hackmd.io/@Marsgoat/leetcode1046)
* [1514. Path with Maximum Probability](https://hackmd.io/@Marsgoat/B15eOMt_h)
* [1675. Minimize Deviation in Array](https://hackmd.io/@Marsgoat/leetcode1675)
* [1834. Single-Threaded CPU](https://hackmd.io/@Marsgoat/leetcode1834)
* [1962. Remove Stones to Minimize the Total](https://hackmd.io/@Marsgoat/leetcode1962)
* [2336. Smallest Number in Infinite Set](https://hackmd.io/@Marsgoat/leetcode2336)
* [2462. Total Cost to Hire K Workers](https://hackmd.io/@Marsgoat/B1kR8dUOh)
* [2542. Maximum Subsequence Score](https://hackmd.io/@Marsgoat/leetcode2542)
* [2551. Put Marbles in Bags](https://hackmd.io/@Marsgoat/leetcode2551)
:::
### Binary Search
:::spoiler 題目列表
* [35. Search Insert Position](https://hackmd.io/@Marsgoat/leetcode35)
* [81. Search in Rotated Sorted Array II](https://hackmd.io/@Marsgoat/leetcode81)
* [98. Validate Binary Search Tree](https://hackmd.io/@Marsgoat/leetcode98)
* [209. Minimum Size Subarray Sum](https://hackmd.io/@Marsgoat/leetcode209)
* [352. Data Stream as Disjoint Intervals](https://hackmd.io/@Marsgoat/leetcode352)
* [540. Single Element in a Sorted Array](https://hackmd.io/@Marsgoat/leetcode540)
* [704. Binary Search](https://hackmd.io/@Marsgoat/leetcode704)
* [744. Find Smallest Letter Greater Than Target](https://hackmd.io/@Marsgoat/leetcode744)
* [852. Peak Index in a Mountain Array](https://hackmd.io/@Marsgoat/leetcode852)
* [875. Koko Eating Bananas](https://hackmd.io/@Marsgoat/leetcode875)
* [938. Range Sum of BST](https://hackmd.io/@Marsgoat/leetcode938)
* [1011. Capacity To Ship Packages Within D Days](https://hackmd.io/@Marsgoat/leetcode1011)
* [1027. Longest Arithmetic Subsequence](https://hackmd.io/@Marsgoat/rknSogQ_h)
* [1146. Snapshot Array](https://hackmd.io/@Marsgoat/leetcode1146)
* [1187. Make Array Strictly Increasing](https://hackmd.io/@Marsgoat/BJdXkOEOh)
* [1235. Maximum Profit in Job Scheduling](https://hackmd.io/@Marsgoat/leetcode1235)
* [1498. Number of Subsequences That Satisfy the Given Sum Condition](https://hackmd.io/@Marsgoat/leetcode1498)
* [1539. Kth Missing Positive Number](https://hackmd.io/@Marsgoat/leetcode1539)
* [1751. Maximum Number of Events That Can Be Attended II](https://hackmd.io/@Marsgoat/leetcode1751)
* [1802. Maximum Value at a Given Index in a Bounded Array](https://hackmd.io/@Marsgoat/leetcode1802)
* [1870. Minimum Speed to Arrive on Time](https://hackmd.io/@Marsgoat/leetcode1870)
* [1964. Find the Longest Valid Obstacle Course at Each Position](https://hackmd.io/@Marsgoat/leetcode1964)
* [2024. Maximize the Confusion of an Exam](https://hackmd.io/@Marsgoat/leetcode2024)
* [2141. Maximum Running Time of N Computers](https://hackmd.io/@Marsgoat/leetcode2141)
* [2187. Minimum Time to Complete Trips](https://hackmd.io/@Marsgoat/leetcode2187)
* [2300. Successful Pairs of Spells and Potions](https://hackmd.io/@Marsgoat/leetcode2300)
* [2389. Longest Subsequence With Limited Sum](https://hackmd.io/@RonChen0927/leetcode2389)
* [2439. Minimize Maximum of Array](https://hackmd.io/@Marsgoat/leetcode2439)
* [2498. Frog Jump II](https://hackmd.io/@Marsgoat/leetcode2498)
* [2616. Minimize the Maximum Difference of Pairs](https://hackmd.io/@Marsgoat/leetcode2616)
:::

### BFS/DFS
:::spoiler 題目列表
* [98. Validate Binary Search Tree](https://hackmd.io/@Marsgoat/leetcode98)
* [100. Same Tree](https://hackmd.io/@Marsgoat/leetcode100)
* [101. Symmetric Tree](https://hackmd.io/@Marsgoat/leetcode101)
* [103. Binary Tree Zigzag Level Order Traversal](https://hackmd.io/@Marsgoat/leetcode103)
* [104. Maximum Depth of Binary Tree](https://hackmd.io/@Marsgoat/leetcode104)
* [111. Minimum Depth of Binary Tree](https://hackmd.io/@Marsgoat/leetcode111)
* [124. Binary Tree Maximum Path Sum](https://hackmd.io/@Marsgoat/leetcode124)
* [129. Sum Root to Leaf Numbers](https://hackmd.io/@Marsgoat/leetcode129)
* [133. Clone Graph](https://hackmd.io/@Marsgoat/leetcode133)
* [144. Binary Tree Preorder Traversal](https://hackmd.io/@Marsgoat/leetcode144)
* [207. Course Schedule](https://hackmd.io/@Marsgoat/leetcode207)
* [211. Design Add and Search Words Data Structure](https://hackmd.io/@Marsgoat/leetcode211)
* [226. Invert Binary Tree](https://hackmd.io/@Marsgoat/leetcode226)
* [399. Evaluate Division](https://hackmd.io/@Marsgoat/leetcode399)
* [472. Concatenated Words](https://hackmd.io/@Marsgoat/leetcode472)
* [530. Minimum Absolute Difference in BST](https://hackmd.io/@Marsgoat/leetcode530)
* [547. Number of Provinces](https://hackmd.io/@Marsgoat/leetcode547)
* [652. Find Duplicate Subtrees](https://hackmd.io/@Marsgoat/leetcode652)
* [662. Maximum Width of Binary Tree](https://hackmd.io/@Marsgoat/leetcode662)
* [687. Longest Univalue Path](https://hackmd.io/@RonChen0927/leetcode687)
* [783. Minimum Distance Between BST Nodes](https://hackmd.io/@Marsgoat/leetcode783)
* [787. Cheapest Flights Within K Stops](https://hackmd.io/@Marsgoat/leetcode787)
* [797. All Paths From Source to Target](https://hackmd.io/@RonChen0927/leetcode797)
* [802. Find Eventual Safe States](https://hackmd.io/@Marsgoat/leetcode802)
* [834. Sum of Distances in Tree](https://hackmd.io/@Marsgoat/leetcode834)
* [839. Similar String Groups](https://hackmd.io/@Marsgoat/leetcode839)
* [841. Keys and Rooms](https://hackmd.io/@Marsgoat/leetcode841)
* [872. Leaf-Similar Trees](https://hackmd.io/@Marsgoat/leetcode872)
* [886. Possible Bipartition](https://hackmd.io/@Marsgoat/leetcode886)
* [909. Snakes and Ladders](https://hackmd.io/@Marsgoat/leetcode909)
* [934. Shortest Bridge](https://hackmd.io/@Marsgoat/leetcode934)
* [938. Range Sum of BST](https://hackmd.io/@Marsgoat/leetcode938)
* [958. Check Completeness of a Binary Tree](https://hackmd.io/@Marsgoat/leetcode958)
* [1020. Number of Enclaves](https://hackmd.io/@Marsgoat/leetcode1020)
* [1026. Maximum Difference Between Node and Ancestor](https://hackmd.io/@Marsgoat/leetcode1026)
* [1091. Shortest Path in Binary Matrix](https://hackmd.io/@Marsgoat/leetcode1091)
* [1129. Shortest Path with Alternating Colors](https://hackmd.io/@Marsgoat/leetcode1129)
* [1161. Maximum Level Sum of a Binary Tree](https://hackmd.io/@Marsgoat/leetcode1161)
* [1162. As Far from Land as Possible](https://hackmd.io/@Marsgoat/leetcode1162)
* [1319. Number of Operations to Make Network Connected](https://hackmd.io/@Marsgoat/leetcode1319)
* [1339. Maximum Product of Splitted Binary Tree](https://hackmd.io/@Marsgoat/leetcode1339)
* [1345. Jump Game IV](https://hackmd.io/@Marsgoat/leetcode1345)
* [1372. Longest ZigZag Path in a Binary Tree](https://hackmd.io/@Marsgoat/leetcode1372)
* [1376. Time Needed to Inform All Employees](https://hackmd.io/@Marsgoat/leetcode1376)
* [1443. Minimum Time to Collect All Apples in a Tree](https://hackmd.io/@Marsgoat/leetcode1443)
* [1466. Reorder Routes to Make All Paths Lead to the City Zero](https://hackmd.io/@Marsgoat/leetcode1466)
* [1519. Number of Nodes in the Sub-Tree With the Same Label](https://hackmd.io/@Marsgoat/leetcode1519)
* [1926. Nearest Exit from Entrance in Maze](https://hackmd.io/@Marsgoat/leetcode1926)
* [1971. Find if Path Exists in Graph](https://hackmd.io/@Marsgoat/leetcode1971)
* [2101. Detonate the Maximum Bombs](https://hackmd.io/@Marsgoat/leetcode2101)
* [2246. Longest Path With Different Adjacent Characters](https://hackmd.io/@Marsgoat/leetcode2246)
* [2316. Count Unreachable Pairs of Nodes in an Undirected Graph](https://hackmd.io/@Marsgoat/leetcode2316)
* [2328. Number of Increasing Paths in a Grid](https://hackmd.io/@Marsgoat/H1fUbOVOh)
* [2359. Find Closest Node to Given Two Nodes](https://hackmd.io/@Marsgoat/leetcode2359)
* [2360. Longest Cycle in a Graph](https://hackmd.io/@Marsgoat/leetcode2360)
* [2477. Minimum Fuel Cost to Report to the Capital](https://hackmd.io/@Marsgoat/leetcode2477)
* [2492. Minimum Score of a Path Between Two Cities](https://hackmd.io/@Marsgoat/leetcode2492)
:::
### Divide and Conquer
:::spoiler 題目列表
* [23. Merge k Sorted Lists](https://hackmd.io/@Marsgoat/leetcode23)
* [109. Convert Sorted List to Binary Search Tree](https://hackmd.io/@Marsgoat/leetcode109)
* [347. Top K Frequent Elements](https://hackmd.io/@Marsgoat/leetcode347)
* [427. Construct Quad Tree](https://hackmd.io/@Marsgoat/leetcode427)
* [918. Maximum Sum Circular Subarray](https://hackmd.io/@Marsgoat/leetcode918)
* [1569. Number of Ways to Reorder Array to Get Same BST](https://hackmd.io/@Marsgoat/leetcode1569)
:::

### Dynamic Programming
:::spoiler 題目列表
* [45. Jump Game II](https://hackmd.io/@Marsgoat/leetcode45)
* [55. Jump Game](https://hackmd.io/@Marsgoat/leetcode55)
* [64. Minimum Path Sum](https://hackmd.io/@Marsgoat/leetcode64)
* [70. Climbing Stairs](https://hackmd.io/@Marsgoat/leetcode70)
* [72. Edit Distance](https://hackmd.io/@Marsgoat/leetcode72)
* [87. Scramble String](https://hackmd.io/@Marsgoat/leetcode87)
* [95. Unique Binary Search Trees II](https://hackmd.io/@Marsgoat/leetcode95)
* [121. Best Time to Buy and Sell Stock](https://hackmd.io/@Marsgoat/leetcode121)
* [122. Best Time to Buy and Sell Stock II](https://hackmd.io/@Marsgoat/leetcode122)
* [124. Binary Tree Maximum Path Sum](https://hackmd.io/@Marsgoat/leetcode124)
* [131. Palindrome Partitioning](https://hackmd.io/@Marsgoat/leetcode131)
* [139. Word Break](https://hackmd.io/@Marsgoat/leetcode139)
* [198. House Robber](https://hackmd.io/@Marsgoat/leetcode198)
* [279. Perfect Squares](https://hackmd.io/@Marsgoat/leetcode279)
* [309. Best Time to Buy and Sell Stock with Cooldown](https://hackmd.io/@Marsgoat/leetcode309)
* [435. Non-overlapping Intervals](https://hackmd.io/@Marsgoat/leetcode435)
* [446. Arithmetic Slices II - Subsequence](https://hackmd.io/@Marsgoat/leetcode446)
* [472. Concatenated Words](https://hackmd.io/@Marsgoat/leetcode472)
* [486. Predict the Winner](https://hackmd.io/@Marsgoat/leetcode486)
* [664. Strange Printer](https://hackmd.io/@Marsgoat/leetcode664)
* [673. Number of Longest Increasing Subsequence](https://hackmd.io/@Marsgoat/leetcode673)
* [688. Knight Probability in Chessboard](https://hackmd.io/@Marsgoat/leetcode688)
* [712. Minimum ASCII Delete Sum for Two Strings](https://hackmd.io/@Marsgoat/leetcode712)
* [714. Best Time to Buy and Sell Stock with Transaction Fee](https://hackmd.io/@Marsgoat/H1YZ9l7dn)
* [787. Cheapest Flights Within K Stops](https://hackmd.io/@Marsgoat/leetcode787)
* [790. Domino and Tromino Tiling](https://hackmd.io/@Marsgoat/leetcode790)
* [808. Soup Servings](https://hackmd.io/@Marsgoat/leetcode808)
* [834. Sum of Distances in Tree](https://hackmd.io/@Marsgoat/leetcode834)
* [837. New 21 Game](https://hackmd.io/@Marsgoat/leetcode837)
* [877. Stone Game](https://hackmd.io/@Marsgoat/leetcode877)
* [879. Profitable Schemes](https://hackmd.io/@Marsgoat/leetcode879)
* [894. All Possible Full Binary Trees](https://hackmd.io/@Marsgoat/leetcode894)
* [907. Sum of Subarray Minimums](https://hackmd.io/@Marsgoat/leetcode907)
* [918. Maximum Sum Circular Subarray](https://hackmd.io/@Marsgoat/leetcode918)
* [920. Number of Music Playlists](https://hackmd.io/@Marsgoat/leetcode920)
* [926. Flip String to Monotone Increasing](https://hackmd.io/@Marsgoat/leetcode926)
* [931. Minimum Falling Path Sum](https://hackmd.io/@Marsgoat/leetcode931)
* [956. Tallest Billboard](https://hackmd.io/@Marsgoat/BkUrCP4dn)
* [983. Minimum Cost For Tickets](https://hackmd.io/@Marsgoat/leetcode983)
* [1027. Longest Arithmetic Subsequence](https://hackmd.io/@Marsgoat/rknSogQ_h)
* [1125. Smallest Sufficient Team](https://hackmd.io/@Marsgoat/leetcode1125)
* [1137. N-th Tribonacci Number](https://hackmd.io/@Marsgoat/leetcode1137)
* [1140. Stone Game II](https://hackmd.io/@Marsgoat/leetcode1140)
* [1143. Longest Common Subsequence](https://hackmd.io/@Marsgoat/leetcode1143)
* [1162. As Far from Land as Possible](https://hackmd.io/@Marsgoat/leetcode1162)
* [1187. Make Array Strictly Increasing](https://hackmd.io/@Marsgoat/BJdXkOEOh)
* [1218. Longest Arithmetic Subsequence of Given Difference](https://hackmd.io/@Marsgoat/leetcode1218)
* [1235. Maximum Profit in Job Scheduling](https://hackmd.io/@Marsgoat/leetcode1235)
* [1289. Minimum Falling Path Sum II](https://hackmd.io/@Marsgoat/leetcode1289)
* [1312. Minimum Insertion Steps to Make a String Palindrome](https://hackmd.io/@Marsgoat/leetcode1312)
* [1372. Longest ZigZag Path in a Binary Tree](https://hackmd.io/@Marsgoat/leetcode1372)
* [1402. Reducing Dishes](https://hackmd.io/@Marsgoat/leetcode1402)
* [1406. Stone Game III](https://hackmd.io/@Marsgoat/leetcode1406)
* [1416. Restore The Array](https://hackmd.io/@Marsgoat/leetcode1416)
* [1444. Number of Ways of Cutting a Pizza](https://hackmd.io/@Marsgoat/leetcode1444)
* [1493. Longest Subarray of 1's After Deleting One Element](https://hackmd.io/@Marsgoat/leetcode1493)
* [1547. Minimum Cost to Cut a Stick](https://hackmd.io/@Marsgoat/leetcode1547)
* [1569. Number of Ways to Reorder Array to Get Same BST](https://hackmd.io/@Marsgoat/leetcode1569)
* [1575. Count All Possible Routes](https://hackmd.io/@Marsgoat/BJpu4arO3)
* [1626. Best Team With No Conflicts](https://hackmd.io/@Marsgoat/leetcode1626)
* [1639. Number of Ways to Form a Target String Given a Dictionary](https://hackmd.io/@Marsgoat/leetcode1693)
* [1751. Maximum Number of Events That Can Be Attended II](https://hackmd.io/@Marsgoat/leetcode1751)
* [1799. Maximize Score After N Operations](https://hackmd.io/@Marsgoat/leetcode1799)
* [1857. Largest Color Value in a Directed Graph](https://hackmd.io/@Marsgoat/leetcode1857)
* [2140. Solving Questions With Brainpower](https://hackmd.io/@Marsgoat/leetcode2140)
* [2218. Maximum Value of K Coins From Piles](https://hackmd.io/@Marsgoat/leetcode2218)
* [2272. Substring With Largest Variance](https://hackmd.io/@Marsgoat/leetcode2272)
* [2305. Fair Distribution of Cookies](https://hackmd.io/@Marsgoat/leetcode2305)
* [2328. Number of Increasing Paths in a Grid](https://hackmd.io/@Marsgoat/H1fUbOVOh)
* [2439. Minimize Maximum of Array](https://hackmd.io/@Marsgoat/leetcode2439)
* [2466. Count Ways To Build Good Strings](https://hackmd.io/@Marsgoat/leetcode2466)

:::
### Graph
:::spoiler 題目列表
* [133. Clone Graph](https://hackmd.io/@Marsgoat/leetcode133)
* [207. Course Schedule](https://hackmd.io/@Marsgoat/leetcode207)
* [399. Evaluate Division](https://hackmd.io/@Marsgoat/leetcode399)
* [547. Number of Provinces](https://hackmd.io/@Marsgoat/leetcode547)
* [787. Cheapest Flights Within K Stops](https://hackmd.io/@Marsgoat/leetcode787)
* [797. All Paths From Source to Target](https://hackmd.io/@RonChen0927/leetcode797)
* [802. Find Eventual Safe States](https://hackmd.io/@Marsgoat/leetcode802)
* [834. Sum of Distances in Tree](https://hackmd.io/@Marsgoat/leetcode834)
* [841. Keys and Rooms](https://hackmd.io/@Marsgoat/leetcode841)
* [886. Possible Bipartition](https://hackmd.io/@Marsgoat/leetcode886)
* [997. Find the Town Judge](https://hackmd.io/@Marsgoat/leetcode997)
* [1129. Shortest Path with Alternating Colors](https://hackmd.io/@Marsgoat/leetcode1129)
* [1319. Number of Operations to Make Network Connected](https://hackmd.io/@Marsgoat/leetcode1319)
* [1466. Reorder Routes to Make All Paths Lead to the City Zero](https://hackmd.io/@Marsgoat/leetcode1466)
* [1514. Path with Maximum Probability](https://hackmd.io/@Marsgoat/B15eOMt_h)
* [1557. Minimum Number of Vertices to Reach All Nodes](https://hackmd.io/@Marsgoat/leetcode1557)
* [1579. Remove Max Number of Edges to Keep Graph Fully Traversable](https://hackmd.io/@Marsgoat/leetcode1579)
* [1697. Checking Existence of Edge Length Limited Paths](https://hackmd.io/@Marsgoat/leetcode1697)
* [1857. Largest Color Value in a Directed Graph](https://hackmd.io/@Marsgoat/leetcode1857)
* [1971. Find if Path Exists in Graph](https://hackmd.io/@Marsgoat/leetcode1971)
* [2101. Detonate the Maximum Bombs](https://hackmd.io/@Marsgoat/leetcode2101)
* [2246. Longest Path With Different Adjacent Characters](https://hackmd.io/@Marsgoat/leetcode2246)
* [2316. Count Unreachable Pairs of Nodes in an Undirected Graph](https://hackmd.io/@Marsgoat/leetcode2316)
* [2328. Number of Increasing Paths in a Grid](https://hackmd.io/@Marsgoat/H1fUbOVOh)
* [2359. Find Closest Node to Given Two Nodes](https://hackmd.io/@Marsgoat/leetcode2359)
* [2360. Longest Cycle in a Graph](https://hackmd.io/@Marsgoat/leetcode2360)
* [2421. Number of Good Paths](https://hackmd.io/@Marsgoat/leetcode2421)
* [2477. Minimum Fuel Cost to Report to the Capital](https://hackmd.io/@Marsgoat/leetcode2477)
* [2492. Minimum Score of a Path Between Two Cities](https://hackmd.io/@Marsgoat/leetcode2492)
:::