Remark and organize heap and greedy problems

Author: enginebai

problems/greedy-problems.md

@@ -7,11 +7,11 @@
 ### 1.1 From Minimum or Maximum
 | Problem          | Difficulty |
 |------------------|------------|
-|[945. Minimum Increment to Make Array Unique](../leetcode/945.minimum-increment-to-make-array-unique.md)|Medium (1448)|
+|@@[945. Minimum Increment to Make Array Unique](../leetcode/945.minimum-increment-to-make-array-unique.md)|Medium (1448)|
 |[1647. Minimum Deletions to Make Character Frequencies Unique](../leetcode/1647.minimum-deletions-to-make-character-frequencies-unique.md)|Medium (1509)|
-|[1509. Minimum Difference Between Largest and Smallest Value in Three Moves](../leetcode/1509.minimum-difference-between-largest-and-smallest-value-in-three-moves.md)|Medium (1653)|
+|@@[1509. Minimum Difference Between Largest and Smallest Value in Three Moves](../leetcode/1509.minimum-difference-between-largest-and-smallest-value-in-three-moves.md)|Medium (1653)|
 |[948. Bag of Tokens](../leetcode/948.bag-of-tokens.md)|Medium (1762)|
-|[1775. Equal Sum Arrays With Minimum Number of Operations](../leetcode/1775.equal-sum-arrays-with-minimum-number-of-operations.md)|Medium (1850)|
+|@@[1775. Equal Sum Arrays With Minimum Number of Operations](../leetcode/1775.equal-sum-arrays-with-minimum-number-of-operations.md)|Medium (1850)|
 
 > https://leetcode.com/problems/maximum-bags-with-full-capacity-of-rocks/description/
 > https://leetcode.com/problems/divide-an-array-into-subarrays-with-minimum-cost-i/
@@ -23,7 +23,7 @@
 |[976. Largest Perimeter Triangle](https://leetcode.com/problems/largest-perimeter-triangle/description/)|Easy (1340)|
 |[561. Array Partition](https://leetcode.com/problems/array-partition-i/description/)|Easy|
 |[2592. Maximize Greatness of an Array](../leetcode/2592.maximize-greatness-of-an-array.md)|Medium (1569)|
-|[826. Most Profit Assigning Work](../leetcode/826.most-profit-assigning-work.md)|Medium (1708)|
+|@@[826. Most Profit Assigning Work](../leetcode/826.most-profit-assigning-work.md)|Medium (1708)|
 
 > https://leetcode.com/problems/largest-perimeter-triangle/description // Not fully understand
 > https://leetcode.com/problems/maximize-greatness-of-an-array/ WA
@@ -32,7 +32,7 @@
 | Problem          | Difficulty |
 |------------------|------------|
 |[1221. Split a String in Balanced Strings](https://leetcode.com/problems/split-a-string-in-balanced-strings/description/)|Easy (1219)|
-|[605. Can Place Flowers](../leetcode/605.can-place-flowers.md)|Easy|
+|@@[605. Can Place Flowers](../leetcode/605.can-place-flowers.md)|Easy|
 |[1529. Minimum Suffix Flips](../leetcode/1529.minimum-suffix-flips.md)|Medium (1392)|
 |[861. Score After Flipping Matrix](../leetcode/861.score-after-flipping-matrix.md)|Medium (1818)|
 
@@ -41,24 +41,24 @@
 |------------------|------------|
 |[767. Reorganize String](../leetcode/767.reorganize-string.md)|Medium (1681)|
 |[984. String Without AAA or BBB](../leetcode/984.string-without-aaa-or-bbb.md)|Medium (1474)|
-|[1405. Longest Happy String](../leetcode/1405.longest-happy-string.md)|Medium (1820)|
-|[621. Task Scheduler](../leetcode/621.task-scheduler.md)|Medium|
+|**[1405. Longest Happy String](../leetcode/1405.longest-happy-string.md)**|Medium (1820)|
+|**[621. Task Scheduler](../leetcode/621.task-scheduler.md)**|Medium|
 
 ### To Categories
 > The following problems can be categorized into the other topics, such as heap, stack...etc.
 
 | Problem          | Difficulty |
 |------------------|------------|
-|[55. Jump Game](../leetcode/55.jump-game.md)|Medium|
-|[45. Jump Game II](../leetcode/45.jump-game-ii.md)|Medium|
+|**[55. Jump Game](../leetcode/55.jump-game.md)**|Medium|
+|**[45. Jump Game II](../leetcode/45.jump-game-ii.md)**|Medium|
 |[334. Increasing Triplet Subsequence](../leetcode/334.increasing-triplet-subsequence.md)|Medium|
-|[763. Partition Labels](../leetcode/763.partition-labels.md)|Medium|
+|**[763. Partition Labels](../leetcode/763.partition-labels.md)**|Medium|
 |[881. Boats to Save People](../leetcode/881.boats-to-save-people.md)|Medium|
-|[134. Gas Station](../leetcode/134.gas-station.md)|Medium|
-|[135. Candy](../leetcode/135.candy.md)|Hard|
+|**[134. Gas Station](../leetcode/134.gas-station.md)**|Medium|
+|**[135. Candy](../leetcode/135.candy.md)**|Hard|
 |[455. Assign Cookies](../leetcode/455.assign-cookies.md)|Easy|
 |[1541. Minimum Insertions to Balance a Parentheses String](../leetcode/1541.minimum-insertions-to-balance-a-parentheses-string.md)|Medium (1759)|
 |[1249. Minimum Remove to Make Valid Parentheses](../leetcode/1249.minimum-remove-to-make-valid-parentheses.md)|Medium (1657)|
 |[1963. Minimum Number of Swaps to Make the String Balanced](../leetcode/1963.minimum-number-of-swaps-to-make-the-string-balanced.md)|Medium (1688)|
-|[3397. Maximum Number of Distinct Elements After Operations](../leetcode/3397.maximum-number-of-distinct-elements-after-operations.md)|Medium (1687)|
+|@@[3397. Maximum Number of Distinct Elements After Operations](../leetcode/3397.maximum-number-of-distinct-elements-after-operations.md)|Medium (1687)|
 |[3413. Maximum Coins From K Consecutive Bags](../leetcode/3413.maximum-coins-from-k-consecutive-bags.md)|Medium (TODO)|

problems/heap-problems.md

@@ -3,21 +3,21 @@
 ### Basic
 | Problem          | Difficulty |
 |------------------|------------|
-|[1046. Last Stone Weight](../leetcode/1046.last-stone-weight.md)|Easy (1172)|
+|**[1046. Last Stone Weight](../leetcode/1046.last-stone-weight.md)**|Easy (1172)|
 |[1337. The K Weakest Rows in a Matrix](../leetcode/1337.the-k-weakest-rows-in-a-matrix.md)|Easy|
-|[2336. Smallest Number in Infinite Set](../leetcode/2336.smallest-number-in-infinite-set.md)|Easy|
+|@@[2336. Smallest Number in Infinite Set](../leetcode/2336.smallest-number-in-infinite-set.md)|Easy|
 |[1845. Seat Reservation Manager](../leetcode/1845.seat-reservation-manager.md)|Medium|
 |[2462. Total Cost to Hire K Workers](../leetcode/2462.total-cost-to-hire-k-workers.md)|Medium (1763)|
-|[1834. Single-Threaded CPU](../leetcode/1834.single-threaded-cpu.md)|Medium (1797)|
-|[502. IPO](../leetcode/502.ipo.md)|Hard|
+|@@**[1834. Single-Threaded CPU](../leetcode/1834.single-threaded-cpu.md)**|Medium (1797)|
+|**[502. IPO](../leetcode/502.ipo.md)**|Hard|
 
 > * https://leetcode.com/problems/trapping-rain-water-ii/description/ h
 > * https://leetcode.com/problems/maximum-number-of-events-that-can-be-attended/description/ 2014
 > * https://leetcode.com/problems/construct-target-array-with-multiple-sums/description/ 2014 h
 > * https://leetcode.com/problems/smallest-range-covering-elements-from-k-lists/description/ h
 > * https://leetcode.com/problems/maximum-subsequence-score/description/ 2056
 > * https://leetcode.com/problems/maximum-performance-of-a-team/description/ 2091
-> * https://leetcode.com/problems/minimum-cost-to-hire-k-workers/description/ 2259
+> * **https://leetcode.com/problems/minimum-cost-to-hire-k-workers/description/** 2259
 >
 > * Solved: https://leetcode.com/problems/take-gifts-from-the-richest-pile/description/ 1276 // A very basic heap problem. `PriorityQueue(reverseOrder<Int>())` is used to create a max heap. 2024/10/28
 > * Solved: https://leetcode.com/problems/maximal-score-after-applying-k-operations/description/ 1386 // A very basic heap problem. 2024/10/29
@@ -36,45 +36,45 @@
 
 | Problem          | Difficulty |
 |------------------|------------|
-|[767. Reorganize String](../leetcode/767.reorganize-string.md)|Medium (1681)|
-|[984. String Without AAA or BBB](../leetcode/984.string-without-aaa-or-bbb.md)|Medium (1474)|
-|[1405. Longest Happy String](../leetcode/1405.longest-happy-string.md)|Medium (1820)|
-|[621. Task Scheduler](../leetcode/621.task-scheduler.md)|Medium|
+|@@**[767. Reorganize String](../leetcode/767.reorganize-string.md)**|Medium (1681)|
+|@@[984. String Without AAA or BBB](../leetcode/984.string-without-aaa-or-bbb.md)|Medium (1474)|
+|@@**[1405. Longest Happy String](../leetcode/1405.longest-happy-string.md)**|Medium (1820)|
+|@@**[621. Task Scheduler](../leetcode/621.task-scheduler.md)**|Medium|
 
 > * https://leetcode.com/problems/distant-barcodes/description/ 1701
 
 ### Merge K Sorted
 | Problem          | Difficulty |
 |------------------|------------|
-|[23. Merge k Sorted Lists](../leetcode/23.merge-k-sorted-lists.md)|Hard|
-|[264. Ugly Number II](../leetcode/264.ugly-number-ii.md)|Medium|
-|[373. Find K Pairs with Smallest Sums](../leetcode/373.find-k-pairs-with-smallest-sums.md)|Medium|
-|[378. Kth Smallest Element in a Sorted Matrix](../leetcode/378.kth-smallest-element-in-a-sorted-matrix.md)|Medium|
+|**[23. Merge k Sorted Lists](../leetcode/23.merge-k-sorted-lists.md)**|Hard|
+|**[264. Ugly Number II](../leetcode/264.ugly-number-ii.md)**|Medium|
+|@@**[373. Find K Pairs with Smallest Sums](../leetcode/373.find-k-pairs-with-smallest-sums.md)**|Medium|
+|**[378. Kth Smallest Element in a Sorted Matrix](../leetcode/378.kth-smallest-element-in-a-sorted-matrix.md)**|Medium|
 
 > * https://leetcode.com/problems/super-ugly-number/description/ m
 > * https://leetcode.com/problems/find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows/description/ 2133
 > * https://leetcode.com/problems/find-k-th-smallest-pair-distance/description/ h
-> * https://leetcode.com/problems/smallest-range-covering-elements-from-k-lists/description/ h
+> * **https://leetcode.com/problems/smallest-range-covering-elements-from-k-lists/description/** h
 > * ~~https://leetcode.com/problems/minimize-deviation-in-array/description/~~ 2533
 
 ### 事後諸葛
 | Problem          | Difficulty |
 |------------------|------------|
-|[1642. Furthest Building You Can Reach](../leetcode/1642.furthest-building-you-can-reach.md)|Medium (1962)|
+|**[1642. Furthest Building You Can Reach](../leetcode/1642.furthest-building-you-can-reach.md)**|Medium (1962)|
 
-> * https://leetcode.com/problems/course-schedule-iii/description/ h
-> * https://leetcode.com/problems/minimum-number-of-refueling-stops/description/ 2074
+> * **https://leetcode.com/problems/course-schedule-iii/description/** h
+> * **https://leetcode.com/problems/minimum-number-of-refueling-stops/description/** 2074
 
 ### Two Heaps
 | Problem          | Difficulty |
 |------------------|------------|
-> * https://leetcode.com/problems/kth-largest-element-in-a-stream/ e
-> * https://leetcode.com/problems/find-median-from-data-stream/description/ h
-> * https://leetcode.com/problems/sliding-window-median/description/ h
+> * **https://leetcode.com/problems/kth-largest-element-in-a-stream/** e
+> * **https://leetcode.com/problems/find-median-from-data-stream/description/** h
+> * **https://leetcode.com/problems/sliding-window-median/description/** h
 
 ### Lazy Deletion
 | Problem          | Difficulty |
 |------------------|------------|
 > * https://leetcode.com/problems/design-a-number-container-system/description/ 1540
 > * https://leetcode.com/problems/design-a-food-rating-system/description/ 1781
-> * https://leetcode.com/problems/stock-price-fluctuation/description/ 1831
+> * **https://leetcode.com/problems/stock-price-fluctuation/description/** 1831

problems/interval-problems.md

@@ -25,13 +25,13 @@
 | Problem          | Difficulty |
 |------------------|------------|
 > * https://leetcode.com/problems/maximum-length-of-pair-chain/description/ m
-> * https://leetcode.com/problems/non-overlapping-intervals/description/ 8k m
+> * **https://leetcode.com/problems/non-overlapping-intervals/description/** 8k m
 
 ### 2.2 区间分组
 | Problem          | Difficulty |
 |------------------|------------|
 > * https://leetcode.com/problems/divide-intervals-into-minimum-number-of-groups 1713
-> * https://leetcode.com/problems/meeting-rooms-ii/ (Premium)
+> * **https://leetcode.com/problems/meeting-rooms-ii/** (Premium)
 
 ### 2.3 区间选点
 | Problem          | Difficulty |
@@ -44,8 +44,8 @@
 |[55. Jump Game](../leetcode/55.jump-game.md)|Medium|
 |[45. Jump Game II](../leetcode/45.jump-game-ii.md)|Medium|
 
-> * https://leetcode.com/problems/video-stitching/description/ 1746
-> * https://leetcode.com/problems/minimum-number-of-taps-to-open-to-water-a-garden/description/ 1885
+> * **https://leetcode.com/problems/video-stitching/description/** 1746
+> * **https://leetcode.com/problems/minimum-number-of-taps-to-open-to-water-a-garden/description/** 1885
 
 ### 2.6 其他区间贪心
 | Problem          | Difficulty |