Remark and organize stack & queue problems

Author: enginebai

leetcode/1094.car-pooling.md

@@ -1,5 +1,6 @@
-## [1094. Car Pooling](https://leetcode.com/problems/car-pooling)
+# [1094. Car Pooling](https://leetcode.com/problems/car-pooling)
 
+## Hash Table
 We will decrease the capacity at `from` (pick up the passenger) and increase back the capacity at `to` (the passenger gets off). Or we will increase the passenger count at `from` and decrease the passenger count at `to`.
 
 ```js

problems/hash-table-problems.md

@@ -8,7 +8,7 @@
 |[535. Encode and Decode TinyURL](../leetcode/535.encode-and-decode-tinyurl.md)|Medium|
 |**[380. Insert Delete GetRandom O(1)](../leetcode/380.insert-delete-getrandom-o1.md)**|Medium|
 |@@[381. Insert Delete GetRandom O(1) - Duplicates allowed](../leetcode/381.insert-delete-getrandom-o1-duplicates-allowed.md)|Hard|
-|[355. Design Twitter](../leetcode/355.design-twitter.md)|Medium|
+|@@[355. Design Twitter](../leetcode/355.design-twitter.md)|Medium|
 |[1396. Design Underground System](../leetcode/1396.design-underground-system.md)|Medium|
 |**[146. LRU Cache](../leetcode/146.lru-cache.md)**|Medium|
 

problems/heap-problems.md

@@ -32,7 +32,7 @@
 |[692. Top K Frequent Words](../leetcode/692.top-k-frequent-words.md)|Medium|
 |[451. Sort Characters By Frequency](../leetcode/451.sort-charaters-by-frequency.md)|Medium|
 |[973. K Closest Points to Origin](../leetcode/973.k-closest-points-to-origin.md)|Medium|
-|[355. Design Twitter](../leetcode/355.design-twitter.md)|Medium|
+|@@[355. Design Twitter](../leetcode/355.design-twitter.md)|Medium|
 
 | Problem          | Difficulty |
 |------------------|------------|

problems/interval-problems.md

@@ -1,12 +1,11 @@
 ## Intervals
-### Basic
+### Line Sweep
 | Problem          | Difficulty |
 |------------------|------------|
 |**[56. Merge Intervals](../leetcode/56.merge-intervals.md)**|Medium|
 |**[57. Insert Interval](../leetcode/57.insert-interval.md)**|Medium|
 |**[986. Interval List Intersections](../leetcode/986.interval-list-intersections.md)**|Medium|
 |**[729. My Calendar I](../leetcode/729.my-calendar-i.md)**|Medium|
-|[55. Jump Game](../leetcode/55.jump-game.md)|Medium|
 |**[1094. Car Pooling](../leetcode/1094.car-pooling.md)**|Medium|
 |[2779. Maximum Beauty of an Array After Applying Operation](../leetcode/2779.maximum-beauty-of-an-array-after-applying-operation.md)|Medium (1638)|
 
@@ -42,6 +41,7 @@
 ### 2.4 区间覆盖
 | Problem          | Difficulty |
 |------------------|------------|
+|[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

problems/stack-queue-problems.md

@@ -3,15 +3,15 @@
 ### Stack Basics
 | Problem          | Difficulty |
 |------------------|------------|
-|[155. Min Stack](../leetcode/155.min-stack.md)|Easy|
+|**[155. Min Stack](../leetcode/155.min-stack.md)**|Easy|
 |[232. Implement Queue using Stacks](../leetcode/232.implement-queue-using-stacks.md)|Easy|
 |[225. Implement Stack using Queues](../leetcode/225.implement-stack-using-queues.md)|Easy|
 |[1472. Design Browser History](../leetcode/1472.design-browser-history.md)|Medium (1453)|
-|[946. Validate Stack Sequences](../leetcode/946.validate-stack-sequences.md)|Medium (1461)|
+|**[946. Validate Stack Sequences](../leetcode/946.validate-stack-sequences.md)**|Medium (1461)|
 |[71. Simplify Path](../leetcode/71.simplify-path.md)|Medium|
-|[636. Exclusive Time of Functions](../leetcode/636.exclusive-time-of-functions.md)|Medium|
+|@@**[636. Exclusive Time of Functions](../leetcode/636.exclusive-time-of-functions.md)**|Medium|
 
-> * https://leetcode.com/problems/maximum-frequency-stack/description/ h 2027
+> * **https://leetcode.com/problems/maximum-frequency-stack/description/** h 2027
 >
 > * Solved: https://leetcode.com/problems/build-an-array-with-stack-operations/description/ 1180 
 > * Solved: https://leetcode.com/problems/design-a-stack-with-increment-operation/description/ 1285 // Using array + top pointer to simulate stack, should have very clear definition of the top pointer. 2024/10/21
@@ -21,55 +21,55 @@
 ### Nested Structure
 | Problem          | Difficulty |
 |------------------|------------|
-|[150. Evaluate Reverse Polish Notation](../leetcode/150.evaluate-reverse-polish-notation.md)|Medium|
-|[1190. Reverse Substrings Between Each Pair of Parentheses](../leetcode/1190.reverse-substrings-between-each-pair-of-parentheses.md)|Medium (1485)|
-|[394. Decode String](../leetcode/394.decode-string.md)|Medium|
-|[856. Score of Parentheses](../leetcode/856.score-of-parentheses.md)|Medium (1562)|
+|**[150. Evaluate Reverse Polish Notation](../leetcode/150.evaluate-reverse-polish-notation.md)**|Medium|
+|@@[1190. Reverse Substrings Between Each Pair of Parentheses](../leetcode/1190.reverse-substrings-between-each-pair-of-parentheses.md)|Medium (1485)|
+|**[394. Decode String](../leetcode/394.decode-string.md)**|Medium|
+|@@[856. Score of Parentheses](../leetcode/856.score-of-parentheses.md)|Medium (1562)|
 |[1106. Parsing A Boolean Expression](../leetcode/1106.parsing-a-boolean-expression.md)|Hard (1880)|
-|[227. Basic Calculator II](../leetcode/227.basic-calculator-ii.md)|Medium|
-|[224. Basic Calculator](../leetcode/224.basic-calculator.md)|Hard|
+|@@**[227. Basic Calculator II](../leetcode/227.basic-calculator-ii.md)**|Medium|
+|@@**[224. Basic Calculator](../leetcode/224.basic-calculator.md)**|Hard|
 
-> * https://leetcode.com/problems/number-of-atoms/description/ h
+> * **https://leetcode.com/problems/number-of-atoms/description/** h
 
 ### Parentheses
 | Problem          | Difficulty |
 |------------------|------------|
-|[20. Valid Parentheses](../leetcode/20.valid-parentheses.md)|Easy|
+|**[20. Valid Parentheses](../leetcode/20.valid-parentheses.md)**|Easy|
 |[1614. Maximum Nesting Depth of the Parentheses](../leetcode/1614.maximum-nesting-depth-of-the-parentheses.md)|Easy (1322)|
-|[1021. Remove Outermost Parentheses](../leetcode/1021.remove-outermost-parentheses.md)|Easy (1311)|
-|[921. Minimum Add to Make Parentheses Valid](../leetcode/921.minimum-add-to-make-parentheses-valid.md)|Medium (1242)|
-|[678. Valid Parenthesis String](../leetcode/678.valid-parenthesis-string.md)|Medium (1700)|
-|[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)|
+|@@[1021. Remove Outermost Parentheses](../leetcode/1021.remove-outermost-parentheses.md)|Easy (1311)|
+|@@**[921. Minimum Add to Make Parentheses Valid](../leetcode/921.minimum-add-to-make-parentheses-valid.md)**|Medium (1242)|
+|@@**[678. Valid Parenthesis String](../leetcode/678.valid-parenthesis-string.md)**|Medium (1700)|
+|@@[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)|
 
-> * https://leetcode.com/problems/remove-invalid-parentheses/description/ h
+> * **https://leetcode.com/problems/remove-invalid-parentheses/description/** h
 
 ### Remove Adjacent Items
 | Problem          | Difficulty |
 |------------------|------------|
-|[735. Asteroid Collision](../leetcode/735.asteroid-collision.md)|Medium|
+|**[735. Asteroid Collision](../leetcode/735.asteroid-collision.md)**|Medium|
 |[1047. Remove All Adjacent Duplicates In String](../leetcode/1047.remove-all-adjacent-duplicates-in-string.md)|Easy (1286)|
 
 > * https://leetcode.com/problems/make-the-string-great/description/ 1344
 > * https://leetcode.com/problems/check-if-word-is-valid-after-substitutions/description/ 1426
-> * https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii/description/ 1541
+> * **https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii/description/** 1541
 > * https://leetcode.com/problems/maximum-score-from-removing-substrings/description/ 1868
 > * Solved: https://leetcode.com/problems/minimum-string-length-after-removing-substrings 1282 // Easy to solve by stack and learned two pointers approach, 2024/10/30
 
 ### Monotonic Stack
 | Problem          | Difficulty |
 |------------------|------------|
-|[496. Next Greater Element I](../leetcode/496.next-greater-element-i.md)|Easy|
+|**[496. Next Greater Element I](../leetcode/496.next-greater-element-i.md)**|Easy|
 |[503. Next Greater Element II](../leetcode/503.next-greater-element-ii.md)|Medium|
-|[739. Daily Temperatures](../leetcode/739.daily-temperatures.md)|Medium|
+|**[739. Daily Temperatures](../leetcode/739.daily-temperatures.md)**|Medium|
 |[901. Online Stock Span](../leetcode/901.online-stock-span.md)|Medium (1709)|
-|[402. Remove K Digits](../leetcode/402.remove-k-digits.md)|Medium (1800)|
-|[42. Trapping Rain Water](../leetcode/42.trapping-rain-water.md)|Hard|
+|@@[402. Remove K Digits](../leetcode/402.remove-k-digits.md)|Medium (1800)|
+|**[42. Trapping Rain Water](../leetcode/42.trapping-rain-water.md)**|Hard|
 |[907. Sum of Subarray Minimums](../leetcode/907.sum-of-subarray-minimums.md)|Medium (1976)|
 |[2104. Sum of Subarray Ranges](../leetcode/2104.sum-of-subarray-ranges.md)|Medium (2000)|
 |[316. Remove Duplicate Letters](../leetcode/316.remove-duplicate-letters.md)|Medium (2184?)|
-|[84. Largest Rectangle in Histogram](../leetcode/84.largest-rentangle-in-histogram.md)|Hard|
+|**[84. Largest Rectangle in Histogram](../leetcode/84.largest-rentangle-in-histogram.md)**|Hard|
 |[2866. Beautiful Towers II](../leetcode/2866.beautiful-towers-ii.md)|Medium (2071)|
 
 > * https://leetcode.com/problems/final-prices-with-a-special-discount-in-a-shop/description/ 1212
@@ -78,25 +78,25 @@
 > * https://leetcode.com/problems/find-the-most-competitive-subsequence/description/ 1802
 > * https://leetcode.com/problems/longest-well-performing-interval/description/ 1908
 > * https://leetcode.com/problems/maximum-score-of-a-good-subarray/description/ 1945
-> * https://leetcode.com/problems/132-pattern/ 2000
+> * **https://leetcode.com/problems/132-pattern/** 2000
 > * https://leetcode.com/problems/maximum-subarray-min-product/description/ 2051
 > * https://leetcode.com/problems/maximal-rectangle/description/ h
 
 ### Queue Basics
 | Problem          | Difficulty |
 |------------------|------------|
-|[622. Design Circular Queue](../leetcode/622.design-circular-queue.md)|Medium|
+|**[622. Design Circular Queue](../leetcode/622.design-circular-queue.md)**|Medium|
 |[1823. Find the Winner of the Circular Game](../leetcode/1823.find-the-winner-of-the-circular-game.md)|Medium|
 
 > * https://leetcode.com/problems/number-of-recent-calls/description/ 1337
 > * https://leetcode.com/problems/reveal-cards-in-increasing-order/description/ 1686
 > * https://leetcode.com/problems/dota2-senate/description/ m
-> * https://leetcode.com/problems/design-circular-deque/description/ m
+> * **https://leetcode.com/problems/design-circular-deque/description/** m
 > * https://leetcode.com/problems/design-front-middle-back-queue/description/ m
 
 ### Monotonic Queue
 | Problem          | Difficulty |
 |------------------|------------|
-|[239. Sliding Window Maximum](../leetcode/239.sliding-window-maximium.md)|Hard|
+|**[239. Sliding Window Maximum](../leetcode/239.sliding-window-maximium.md)**|Hard|
 
 > * https://leetcode.com/problems/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit/description/ 1672