https://leetcode-solutions-5zk.pages.dev/tags/heap-priority-queue/Recent content in Heap (Priority Queue) on LeetCode 题解笔记Hugozh-cn2026 ZenzZweiMon, 11 May 2026 12:12:02 +0800https://leetcode-solutions-5zk.pages.dev/posts/1263-minimum-moves-to-move-a-box-to-their-target-location/Wed, 06 May 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1263-minimum-moves-to-move-a-box-to-their-target-location/Hard | Array, Breadth-First Search, Heap (Priority Queue), Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/2532-time-to-cross-a-bridge/Wed, 06 May 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2532-time-to-cross-a-bridge/Hard | Array, Heap (Priority Queue), Simulationhttps://leetcode-solutions-5zk.pages.dev/posts/3013-divide-an-array-into-subarrays-with-minimum-cost-ii/Wed, 06 May 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3013-divide-an-array-into-subarrays-with-minimum-cost-ii/Hard | Array, Hash Table, Sliding Window, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/3321-find-x-sum-of-all-k-long-subarrays-ii/Wed, 06 May 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3321-find-x-sum-of-all-k-long-subarrays-ii/Hard | Array, Hash Table, Sliding Window, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/1631-path-with-minimum-effort/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1631-path-with-minimum-effort/Medium | Array, Binary Search, Depth-First Search, Breadth-First Search, Union-Find, Heap (Priority Queue), Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/1675-minimize-deviation-in-array/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1675-minimize-deviation-in-array/Hard | Array, Greedy, Heap (Priority Queue), Ordered Sethttps://leetcode-solutions-5zk.pages.dev/posts/1687-delivering-boxes-from-storage-to-ports/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1687-delivering-boxes-from-storage-to-ports/Hard | Array, Dynamic Programming, Segment Tree, Queue, Heap (Priority Queue), Prefix Sum, Monotonic Queuehttps://leetcode-solutions-5zk.pages.dev/posts/1705-maximum-number-of-eaten-apples/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1705-maximum-number-of-eaten-apples/Medium | Array, Greedy, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/1776-car-fleet-ii/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1776-car-fleet-ii/Hard | Array, Math, Stack, Heap (Priority Queue), Monotonic Stackhttps://leetcode-solutions-5zk.pages.dev/posts/1792-maximum-average-pass-ratio/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1792-maximum-average-pass-ratio/Medium | Array, Greedy, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/1834-single-threaded-cpu/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1834-single-threaded-cpu/Medium | Array, Sorting, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/1882-process-tasks-using-servers/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1882-process-tasks-using-servers/Medium | Array, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/2146-k-highest-ranked-items-within-a-price-range/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2146-k-highest-ranked-items-within-a-price-range/Medium | Array, Breadth-First Search, Sorting, Heap (Priority Queue), Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/2163-minimum-difference-in-sums-after-removal-of-elements/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2163-minimum-difference-in-sums-after-removal-of-elements/Hard | Array, Dynamic Programming, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/2233-maximum-product-after-k-increments/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2233-maximum-product-after-k-increments/Medium | Array, Greedy, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/2333-minimum-sum-of-squared-difference/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2333-minimum-sum-of-squared-difference/Medium | Array, Binary Search, Greedy, Sorting, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/2398-maximum-number-of-robots-within-budget/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2398-maximum-number-of-robots-within-budget/Hard | Array, Binary Search, Queue, Sliding Window, Heap (Priority Queue), Prefix Sum, Monotonic Queuehttps://leetcode-solutions-5zk.pages.dev/posts/1337-the-k-weakest-rows-in-a-matrix/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1337-the-k-weakest-rows-in-a-matrix/Easy | Array, Binary Search, Sorting, Heap (Priority Queue), Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/1388-pizza-with-3n-slices/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1388-pizza-with-3n-slices/Hard | Array, Dynamic Programming, Greedy, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/1405-longest-happy-string/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1405-longest-happy-string/Medium | String, Greedy, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/1438-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1438-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit/Medium | Array, Queue, Sliding Window, Heap (Priority Queue), Ordered Set, Monotonic Queuehttps://leetcode-solutions-5zk.pages.dev/posts/1439-find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1439-find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows/Hard | Array, Binary Search, Heap (Priority Queue), Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/1488-avoid-flood-in-the-city/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1488-avoid-flood-in-the-city/Medium | Array, Hash Table, Binary Search, Greedy, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/3572-maximize-ysum-by-picking-a-triplet-of-distinct-xvalues/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3572-maximize-ysum-by-picking-a-triplet-of-distinct-xvalues/Medium | Array, Hash Table, Greedy, Sorting, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/0407-trapping-rain-water-ii/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0407-trapping-rain-water-ii/Hard | Array, Breadth-First Search, Heap (Priority Queue), Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/0480-sliding-window-median/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0480-sliding-window-median/Hard | Array, Hash Table, Sliding Window, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/0632-smallest-range-covering-elements-from-k-lists/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0632-smallest-range-covering-elements-from-k-lists/Hard | Array, Hash Table, Greedy, Sliding Window, Sorting, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/0692-top-k-frequent-words/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0692-top-k-frequent-words/Medium | Array, Hash Table, String, Trie, Sorting, Heap (Priority Queue), Bucket Sort, Countinghttps://leetcode-solutions-5zk.pages.dev/posts/0973-k-closest-points-to-origin/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0973-k-closest-points-to-origin/Medium | Array, Math, Divide and Conquer, Geometry, Sorting, Heap (Priority Queue), Quickselecthttps://leetcode-solutions-5zk.pages.dev/posts/3264-final-array-state-after-k-multiplication-operations-i/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3264-final-array-state-after-k-multiplication-operations-i/Easy | Array, Math, Heap (Priority Queue), Simulationhttps://leetcode-solutions-5zk.pages.dev/posts/3266-final-array-state-after-k-multiplication-operations-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3266-final-array-state-after-k-multiplication-operations-ii/Hard | Array, Heap (Priority Queue), Simulationhttps://leetcode-solutions-5zk.pages.dev/posts/3275-k-th-nearest-obstacle-queries/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3275-k-th-nearest-obstacle-queries/Medium | Array, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/3286-find-a-safe-walk-through-a-grid/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3286-find-a-safe-walk-through-a-grid/Medium | Array, Breadth-First Search, Graph Theory, Heap (Priority Queue), Matrix, Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/3296-minimum-number-of-seconds-to-make-mountain-height-zero/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3296-minimum-number-of-seconds-to-make-mountain-height-zero/Medium | Array, Math, Binary Search, Greedy, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/3318-find-x-sum-of-all-k-long-subarrays-i/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3318-find-x-sum-of-all-k-long-subarrays-i/Easy | Array, Hash Table, Sliding Window, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/3341-find-minimum-time-to-reach-last-room-i/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3341-find-minimum-time-to-reach-last-room-i/Medium | Array, Graph Theory, Heap (Priority Queue), Matrix, Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/3342-find-minimum-time-to-reach-last-room-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3342-find-minimum-time-to-reach-last-room-ii/Medium | Array, Graph Theory, Heap (Priority Queue), Matrix, Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/3362-zero-array-transformation-iii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3362-zero-array-transformation-iii/Medium | Array, Two Pointers, Greedy, Sorting, Heap (Priority Queue), Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/3377-digit-operations-to-make-two-integers-equal/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3377-digit-operations-to-make-two-integers-equal/Medium | Math, Graph Theory, Heap (Priority Queue), Number Theory, Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/3408-design-task-manager/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3408-design-task-manager/Medium | Hash Table, Design, Heap (Priority Queue), Ordered Sethttps://leetcode-solutions-5zk.pages.dev/posts/3462-maximum-sum-with-at-most-k-elements/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3462-maximum-sum-with-at-most-k-elements/Medium | Array, Greedy, Sorting, Heap (Priority Queue), Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/3478-choose-k-elements-with-maximum-sum/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3478-choose-k-elements-with-maximum-sum/Medium | Array, Sorting, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/3505-minimum-operations-to-make-elements-within-k-subarrays-equal/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3505-minimum-operations-to-make-elements-within-k-subarrays-equal/Hard | Array, Hash Table, Math, Dynamic Programming, Sliding Window, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/3507-minimum-pair-removal-to-sort-array-i/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3507-minimum-pair-removal-to-sort-array-i/Easy | Array, Hash Table, Linked List, Heap (Priority Queue), Simulation, Doubly-Linked List, Ordered Sethttps://leetcode-solutions-5zk.pages.dev/posts/3510-minimum-pair-removal-to-sort-array-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3510-minimum-pair-removal-to-sort-array-ii/Hard | Array, Hash Table, Linked List, Heap (Priority Queue), Simulation, Doubly-Linked List, Ordered Sethttps://leetcode-solutions-5zk.pages.dev/posts/3594-minimum-time-to-transport-all-individuals/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3594-minimum-time-to-transport-all-individuals/Hard | Array, Bit Manipulation, Graph Theory, Heap (Priority Queue), Shortest Path, Bitmaskhttps://leetcode-solutions-5zk.pages.dev/posts/3604-minimum-time-to-reach-destination-in-directed-graph/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3604-minimum-time-to-reach-destination-in-directed-graph/Medium | Graph Theory, Heap (Priority Queue), Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/3607-power-grid-maintenance/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3607-power-grid-maintenance/Medium | Array, Hash Table, Depth-First Search, Breadth-First Search, Union-Find, Graph Theory, Heap (Priority Queue), Ordered Sethttps://leetcode-solutions-5zk.pages.dev/posts/3620-network-recovery-pathways/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3620-network-recovery-pathways/Hard | Array, Binary Search, Dynamic Programming, Graph Theory, Topological Sort, Heap (Priority Queue), Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/3645-maximum-total-from-optimal-activation-order/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3645-maximum-total-from-optimal-activation-order/Medium | Array, Two Pointers, Greedy, Sorting, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/3650-minimum-cost-path-with-edge-reversals/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3650-minimum-cost-path-with-edge-reversals/Medium | Graph Theory, Heap (Priority Queue), Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/3691-maximum-total-subarray-value-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3691-maximum-total-subarray-value-ii/Hard | Array, Greedy, Segment Tree, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/3767-maximize-points-after-choosing-k-tasks/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3767-maximize-points-after-choosing-k-tasks/Medium | Array, Greedy, Sorting, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/3780-maximum-sum-of-three-numbers-divisible-by-three/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3780-maximum-sum-of-three-numbers-divisible-by-three/Medium | Array, Greedy, Sorting, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/3781-maximum-score-after-binary-swaps/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3781-maximum-score-after-binary-swaps/Medium | Array, String, Greedy, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/3815-design-auction-system/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3815-design-auction-system/Medium | Hash Table, Design, Heap (Priority Queue), Ordered Sethttps://leetcode-solutions-5zk.pages.dev/posts/3885-design-event-manager/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3885-design-event-manager/Medium | Array, Hash Table, Design, Heap (Priority Queue), Ordered Sethttps://leetcode-solutions-5zk.pages.dev/posts/2973-find-number-of-coins-to-place-in-tree-nodes/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2973-find-number-of-coins-to-place-in-tree-nodes/Hard | Dynamic Programming, Tree, Depth-First Search, Sorting, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/2974-minimum-number-game/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2974-minimum-number-game/Easy | Array, Sorting, Heap (Priority Queue), Simulationhttps://leetcode-solutions-5zk.pages.dev/posts/3049-earliest-second-to-mark-indices-ii/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3049-earliest-second-to-mark-indices-ii/Hard | Array, Binary Search, Greedy, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/3066-minimum-operations-to-exceed-threshold-value-ii/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3066-minimum-operations-to-exceed-threshold-value-ii/Medium | Array, Heap (Priority Queue), Simulationhttps://leetcode-solutions-5zk.pages.dev/posts/3080-mark-elements-on-array-by-performing-queries/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3080-mark-elements-on-array-by-performing-queries/Medium | Array, Hash Table, Sorting, Heap (Priority Queue), Simulationhttps://leetcode-solutions-5zk.pages.dev/posts/3081-replace-question-marks-in-string-to-minimize-its-value/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3081-replace-question-marks-in-string-to-minimize-its-value/Medium | Hash Table, String, Greedy, Sorting, Heap (Priority Queue), Countinghttps://leetcode-solutions-5zk.pages.dev/posts/3092-most-frequent-ids/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3092-most-frequent-ids/Medium | Array, Hash Table, Heap (Priority Queue), Ordered Sethttps://leetcode-solutions-5zk.pages.dev/posts/3112-minimum-time-to-visit-disappearing-nodes/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3112-minimum-time-to-visit-disappearing-nodes/Medium | Array, Graph Theory, Heap (Priority Queue), Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/3123-find-edges-in-shortest-paths/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3123-find-edges-in-shortest-paths/Hard | Depth-First Search, Breadth-First Search, Graph Theory, Heap (Priority Queue), Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/3170-lexicographically-minimum-string-after-removing-stars/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3170-lexicographically-minimum-string-after-removing-stars/Medium | Hash Table, String, Stack, Greedy, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/2642-design-graph-with-shortest-path-calculator/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2642-design-graph-with-shortest-path-calculator/Hard | Graph Theory, Design, Heap (Priority Queue), Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/2662-minimum-cost-of-a-path-with-special-roads/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2662-minimum-cost-of-a-path-with-special-roads/Medium | Array, Graph Theory, Heap (Priority Queue), Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/2679-sum-in-a-matrix/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2679-sum-in-a-matrix/Medium | Array, Sorting, Heap (Priority Queue), Matrix, Simulationhttps://leetcode-solutions-5zk.pages.dev/posts/2699-modify-graph-edge-weights/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2699-modify-graph-edge-weights/Hard | Graph Theory, Heap (Priority Queue), Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/2762-continuous-subarrays/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2762-continuous-subarrays/Medium | Array, Queue, Sliding Window, Heap (Priority Queue), Ordered Set, Monotonic Queuehttps://leetcode-solutions-5zk.pages.dev/posts/2812-find-the-safest-path-in-a-grid/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2812-find-the-safest-path-in-a-grid/Medium | Array, Binary Search, Breadth-First Search, Union-Find, Heap (Priority Queue), Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/2813-maximum-elegance-of-a-k-length-subsequence/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2813-maximum-elegance-of-a-k-length-subsequence/Hard | Array, Hash Table, Stack, Greedy, Sorting, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/2931-maximum-spending-after-buying-items/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2931-maximum-spending-after-buying-items/Hard | Array, Greedy, Sorting, Heap (Priority Queue), Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/2940-find-building-where-alice-and-bob-can-meet/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2940-find-building-where-alice-and-bob-can-meet/Hard | Array, Binary Search, Stack, Binary Indexed Tree, Segment Tree, Heap (Priority Queue), Monotonic Stackhttps://leetcode-solutions-5zk.pages.dev/posts/2944-minimum-number-of-coins-for-fruits/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2944-minimum-number-of-coins-for-fruits/Medium | Array, Dynamic Programming, Queue, Heap (Priority Queue), Monotonic Queuehttps://leetcode-solutions-5zk.pages.dev/posts/2959-number-of-possible-sets-of-closing-branches/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2959-number-of-possible-sets-of-closing-branches/Hard | Bit Manipulation, Graph Theory, Heap (Priority Queue), Enumeration, Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/2034-stock-price-fluctuation/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2034-stock-price-fluctuation/Medium | Hash Table, Design, Heap (Priority Queue), Data Stream, Ordered Sethttps://leetcode-solutions-5zk.pages.dev/posts/2054-two-best-non-overlapping-events/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2054-two-best-non-overlapping-events/Medium | Array, Binary Search, Dynamic Programming, Sorting, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/2099-find-subsequence-of-length-k-with-the-largest-sum/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2099-find-subsequence-of-length-k-with-the-largest-sum/Easy | Array, Hash Table, Sorting, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/2102-sequentially-ordinal-rank-tracker/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2102-sequentially-ordinal-rank-tracker/Hard | Design, Heap (Priority Queue), Data Stream, Ordered Sethttps://leetcode-solutions-5zk.pages.dev/posts/2182-construct-string-with-repeat-limit/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2182-construct-string-with-repeat-limit/Medium | Hash Table, String, Greedy, Heap (Priority Queue), Countinghttps://leetcode-solutions-5zk.pages.dev/posts/2203-minimum-weighted-subgraph-with-the-required-paths/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2203-minimum-weighted-subgraph-with-the-required-paths/Hard | Graph Theory, Heap (Priority Queue), Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/2208-minimum-operations-to-halve-array-sum/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2208-minimum-operations-to-halve-array-sum/Medium | Array, Greedy, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/2231-largest-number-after-digit-swaps-by-parity/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2231-largest-number-after-digit-swaps-by-parity/Easy | Sorting, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/2285-maximum-total-importance-of-roads/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2285-maximum-total-importance-of-roads/Medium | Greedy, Graph Theory, Sorting, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/2290-minimum-obstacle-removal-to-reach-corner/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2290-minimum-obstacle-removal-to-reach-corner/Hard | Array, Breadth-First Search, Graph Theory, Heap (Priority Queue), Matrix, Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/2335-minimum-amount-of-time-to-fill-cups/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2335-minimum-amount-of-time-to-fill-cups/Easy | Array, Greedy, Sorting, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/2336-smallest-number-in-infinite-set/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2336-smallest-number-in-infinite-set/Medium | Hash Table, Design, Heap (Priority Queue), Ordered Sethttps://leetcode-solutions-5zk.pages.dev/posts/2342-max-sum-of-a-pair-with-equal-sum-of-digits/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2342-max-sum-of-a-pair-with-equal-sum-of-digits/Medium | Array, Hash Table, Sorting, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/2343-query-kth-smallest-trimmed-number/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2343-query-kth-smallest-trimmed-number/Medium | Array, String, Divide and Conquer, Sorting, Heap (Priority Queue), Radix Sort, Quickselecthttps://leetcode-solutions-5zk.pages.dev/posts/2344-minimum-deletions-to-make-array-divisible/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2344-minimum-deletions-to-make-array-divisible/Hard | Array, Math, Sorting, Heap (Priority Queue), Number Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/2349-design-a-number-container-system/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2349-design-a-number-container-system/Medium | Hash Table, Design, Heap (Priority Queue), Ordered Sethttps://leetcode-solutions-5zk.pages.dev/posts/2353-design-a-food-rating-system/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2353-design-a-food-rating-system/Medium | Array, Hash Table, String, Design, Heap (Priority Queue), Ordered Sethttps://leetcode-solutions-5zk.pages.dev/posts/2357-make-array-zero-by-subtracting-equal-amounts/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2357-make-array-zero-by-subtracting-equal-amounts/Easy | Array, Hash Table, Greedy, Sorting, Heap (Priority Queue), Simulationhttps://leetcode-solutions-5zk.pages.dev/posts/2386-find-the-k-sum-of-an-array/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2386-find-the-k-sum-of-an-array/Hard | Array, Sorting, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/2402-meeting-rooms-iii/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2402-meeting-rooms-iii/Hard | Array, Hash Table, Sorting, Heap (Priority Queue), Simulationhttps://leetcode-solutions-5zk.pages.dev/posts/2406-divide-intervals-into-minimum-number-of-groups/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2406-divide-intervals-into-minimum-number-of-groups/Medium | Array, Two Pointers, Greedy, Sorting, Heap (Priority Queue), Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/2424-longest-uploaded-prefix/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2424-longest-uploaded-prefix/Medium | Hash Table, Binary Search, Union-Find, Design, Binary Indexed Tree, Segment Tree, Heap (Priority Queue), Ordered Sethttps://leetcode-solutions-5zk.pages.dev/posts/2454-next-greater-element-iv/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2454-next-greater-element-iv/Hard | Array, Binary Search, Stack, Sorting, Heap (Priority Queue), Monotonic Stackhttps://leetcode-solutions-5zk.pages.dev/posts/2456-most-popular-video-creator/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2456-most-popular-video-creator/Medium | Array, Hash Table, String, Sorting, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/2462-total-cost-to-hire-k-workers/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2462-total-cost-to-hire-k-workers/Medium | Array, Two Pointers, Heap (Priority Queue), Simulationhttps://leetcode-solutions-5zk.pages.dev/posts/2497-maximum-star-sum-of-a-graph/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2497-maximum-star-sum-of-a-graph/Medium | Array, Greedy, Graph Theory, Sorting, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/2500-delete-greatest-value-in-each-row/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2500-delete-greatest-value-in-each-row/Easy | Array, Sorting, Heap (Priority Queue), Matrix, Simulationhttps://leetcode-solutions-5zk.pages.dev/posts/2503-maximum-number-of-points-from-grid-queries/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2503-maximum-number-of-points-from-grid-queries/Hard | Array, Two Pointers, Breadth-First Search, Union-Find, Sorting, Heap (Priority Queue), Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/2512-reward-top-k-students/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2512-reward-top-k-students/Medium | Array, Hash Table, String, Sorting, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/2530-maximal-score-after-applying-k-operations/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2530-maximal-score-after-applying-k-operations/Medium | Array, Greedy, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/2542-maximum-subsequence-score/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2542-maximum-subsequence-score/Medium | Array, Greedy, Sorting, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/2551-put-marbles-in-bags/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2551-put-marbles-in-bags/Hard | Array, Greedy, Sorting, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/2558-take-gifts-from-the-richest-pile/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2558-take-gifts-from-the-richest-pile/Easy | Array, Heap (Priority Queue), Simulationhttps://leetcode-solutions-5zk.pages.dev/posts/2577-minimum-time-to-visit-a-cell-in-a-grid/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2577-minimum-time-to-visit-a-cell-in-a-grid/Hard | Array, Breadth-First Search, Graph Theory, Heap (Priority Queue), Matrix, Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/2593-find-score-of-an-array-after-marking-all-elements/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2593-find-score-of-an-array-after-marking-all-elements/Medium | Array, Hash Table, Sorting, Heap (Priority Queue), Simulationhttps://leetcode-solutions-5zk.pages.dev/posts/2611-mice-and-cheese/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2611-mice-and-cheese/Medium | Array, Greedy, Sorting, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/2617-minimum-number-of-visited-cells-in-a-grid/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2617-minimum-number-of-visited-cells-in-a-grid/Hard | Array, Dynamic Programming, Stack, Breadth-First Search, Union-Find, Heap (Priority Queue), Matrix, Monotonic Stackhttps://leetcode-solutions-5zk.pages.dev/posts/1338-reduce-array-size-to-the-half/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1338-reduce-array-size-to-the-half/Medium | Array, Hash Table, Greedy, Sorting, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/1353-maximum-number-of-events-that-can-be-attended/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1353-maximum-number-of-events-that-can-be-attended/Medium | Array, Greedy, Sorting, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/1354-construct-target-array-with-multiple-sums/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1354-construct-target-array-with-multiple-sums/Hard | Array, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/1368-minimum-cost-to-make-at-least-one-valid-path-in-a-grid/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1368-minimum-cost-to-make-at-least-one-valid-path-in-a-grid/Hard | Array, Breadth-First Search, Graph Theory, Heap (Priority Queue), Matrix, Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/1383-maximum-performance-of-a-team/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1383-maximum-performance-of-a-team/Hard | Array, Greedy, Sorting, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/1424-diagonal-traverse-ii/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1424-diagonal-traverse-ii/Medium | Array, Sorting, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/1425-constrained-subsequence-sum/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1425-constrained-subsequence-sum/Hard | Array, Dynamic Programming, Queue, Sliding Window, Heap (Priority Queue), Monotonic Queuehttps://leetcode-solutions-5zk.pages.dev/posts/1464-maximum-product-of-two-elements-in-an-array/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1464-maximum-product-of-two-elements-in-an-array/Easy | Array, Sorting, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/1499-max-value-of-equation/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1499-max-value-of-equation/Hard | Array, Queue, Sliding Window, Heap (Priority Queue), Monotonic Queuehttps://leetcode-solutions-5zk.pages.dev/posts/1514-path-with-maximum-probability/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1514-path-with-maximum-probability/Medium | Array, Graph Theory, Heap (Priority Queue), Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/1606-find-servers-that-handled-most-number-of-requests/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1606-find-servers-that-handled-most-number-of-requests/Hard | Array, Heap (Priority Queue), Simulation, Ordered Sethttps://leetcode-solutions-5zk.pages.dev/posts/1642-furthest-building-you-can-reach/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1642-furthest-building-you-can-reach/Medium | Array, Greedy, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/1648-sell-diminishing-valued-colored-balls/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1648-sell-diminishing-valued-colored-balls/Medium | Array, Math, Binary Search, Greedy, Sorting, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/1686-stone-game-vi/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1686-stone-game-vi/Medium | Array, Math, Greedy, Sorting, Heap (Priority Queue), Game Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/1696-jump-game-vi/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1696-jump-game-vi/Medium | Array, Dynamic Programming, Queue, Heap (Priority Queue), Monotonic Queuehttps://leetcode-solutions-5zk.pages.dev/posts/1738-find-kth-largest-xor-coordinate-value/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1738-find-kth-largest-xor-coordinate-value/Medium | Array, Divide and Conquer, Bit Manipulation, Sorting, Heap (Priority Queue), Matrix, Prefix Sum, Quickselecthttps://leetcode-solutions-5zk.pages.dev/posts/1753-maximum-score-from-removing-stones/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1753-maximum-score-from-removing-stones/Medium | Math, Greedy, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/1786-number-of-restricted-paths-from-first-to-last-node/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1786-number-of-restricted-paths-from-first-to-last-node/Medium | Dynamic Programming, Graph Theory, Topological Sort, Heap (Priority Queue), Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/1801-number-of-orders-in-the-backlog/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1801-number-of-orders-in-the-backlog/Medium | Array, Heap (Priority Queue), Simulationhttps://leetcode-solutions-5zk.pages.dev/posts/1825-finding-mk-average/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1825-finding-mk-average/Hard | Design, Queue, Heap (Priority Queue), Data Stream, Ordered Sethttps://leetcode-solutions-5zk.pages.dev/posts/1845-seat-reservation-manager/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1845-seat-reservation-manager/Medium | Design, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/1851-minimum-interval-to-include-each-query/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1851-minimum-interval-to-include-each-query/Hard | Array, Binary Search, Sweep Line, Sorting, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/1878-get-biggest-three-rhombus-sums-in-a-grid/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1878-get-biggest-three-rhombus-sums-in-a-grid/Medium | Array, Math, Sorting, Heap (Priority Queue), Matrix, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/1912-design-movie-rental-system/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1912-design-movie-rental-system/Hard | Array, Hash Table, Design, Heap (Priority Queue), Ordered Sethttps://leetcode-solutions-5zk.pages.dev/posts/1942-the-number-of-the-smallest-unoccupied-chair/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1942-the-number-of-the-smallest-unoccupied-chair/Medium | Array, Hash Table, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/1962-remove-stones-to-minimize-the-total/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1962-remove-stones-to-minimize-the-total/Medium | Array, Greedy, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/1985-find-the-kth-largest-integer-in-the-array/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1985-find-the-kth-largest-integer-in-the-array/Medium | Array, String, Divide and Conquer, Sorting, Heap (Priority Queue), Quickselecthttps://leetcode-solutions-5zk.pages.dev/posts/1046-last-stone-weight/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1046-last-stone-weight/Easy | Array, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/1054-distant-barcodes/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1054-distant-barcodes/Medium | Array, Hash Table, Greedy, Sorting, Heap (Priority Queue), Countinghttps://leetcode-solutions-5zk.pages.dev/posts/1094-car-pooling/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1094-car-pooling/Medium | Array, Sorting, Heap (Priority Queue), Simulation, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/1172-dinner-plate-stacks/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1172-dinner-plate-stacks/Hard | Hash Table, Stack, Design, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/1268-search-suggestions-system/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1268-search-suggestions-system/Medium | Array, String, Binary Search, Trie, Sorting, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/0743-network-delay-time/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0743-network-delay-time/Medium | Depth-First Search, Breadth-First Search, Graph Theory, Heap (Priority Queue), Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/0767-reorganize-string/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0767-reorganize-string/Medium | Hash Table, String, Greedy, Sorting, Heap (Priority Queue), Countinghttps://leetcode-solutions-5zk.pages.dev/posts/0778-swim-in-rising-water/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0778-swim-in-rising-water/Hard | Array, Binary Search, Depth-First Search, Breadth-First Search, Union-Find, Heap (Priority Queue), Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/0786-k-th-smallest-prime-fraction/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0786-k-th-smallest-prime-fraction/Medium | Array, Two Pointers, Binary Search, Sorting, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/0787-cheapest-flights-within-k-stops/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0787-cheapest-flights-within-k-stops/Medium | Dynamic Programming, Depth-First Search, Breadth-First Search, Graph Theory, Heap (Priority Queue), Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/0855-exam-room/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0855-exam-room/Medium | Design, Heap (Priority Queue), Ordered Sethttps://leetcode-solutions-5zk.pages.dev/posts/0857-minimum-cost-to-hire-k-workers/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0857-minimum-cost-to-hire-k-workers/Hard | Array, Greedy, Sorting, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/0862-shortest-subarray-with-sum-at-least-k/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0862-shortest-subarray-with-sum-at-least-k/Hard | Array, Binary Search, Queue, Sliding Window, Heap (Priority Queue), Prefix Sum, Monotonic Queuehttps://leetcode-solutions-5zk.pages.dev/posts/0871-minimum-number-of-refueling-stops/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0871-minimum-number-of-refueling-stops/Hard | Array, Dynamic Programming, Greedy, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/0882-reachable-nodes-in-subdivided-graph/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0882-reachable-nodes-in-subdivided-graph/Hard | Graph Theory, Heap (Priority Queue), Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/0912-sort-an-array/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0912-sort-an-array/Medium | Array, Divide and Conquer, Sorting, Heap (Priority Queue), Merge Sort, Bucket Sort, Radix Sort, Counting Sorthttps://leetcode-solutions-5zk.pages.dev/posts/0502-ipo/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0502-ipo/Hard | Array, Greedy, Sorting, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/0506-relative-ranks/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0506-relative-ranks/Easy | Array, Sorting, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/0621-task-scheduler/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0621-task-scheduler/Medium | Array, Hash Table, Greedy, Sorting, Heap (Priority Queue), Countinghttps://leetcode-solutions-5zk.pages.dev/posts/0630-course-schedule-iii/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0630-course-schedule-iii/Hard | Array, Greedy, Sorting, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/0658-find-k-closest-elements/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0658-find-k-closest-elements/Medium | Array, Two Pointers, Binary Search, Sliding Window, Sorting, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/0659-split-array-into-consecutive-subsequences/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0659-split-array-into-consecutive-subsequences/Medium | Array, Hash Table, Greedy, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/0675-cut-off-trees-for-golf-event/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0675-cut-off-trees-for-golf-event/Hard | Array, Breadth-First Search, Heap (Priority Queue), Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/0703-kth-largest-element-in-a-stream/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0703-kth-largest-element-in-a-stream/Easy | Tree, Design, Binary Search Tree, Heap (Priority Queue), Binary Tree, Data Streamhttps://leetcode-solutions-5zk.pages.dev/posts/0332-reconstruct-itinerary/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0332-reconstruct-itinerary/Hard | Array, String, Depth-First Search, Graph Theory, Sorting, Heap (Priority Queue), Eulerian Circuithttps://leetcode-solutions-5zk.pages.dev/posts/0347-top-k-frequent-elements/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0347-top-k-frequent-elements/Medium | Array, Hash Table, Divide and Conquer, Sorting, Heap (Priority Queue), Bucket Sort, Counting, Quickselecthttps://leetcode-solutions-5zk.pages.dev/posts/0355-design-twitter/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0355-design-twitter/Medium | Hash Table, Linked List, Design, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/0373-find-k-pairs-with-smallest-sums/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0373-find-k-pairs-with-smallest-sums/Medium | Array, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/0378-kth-smallest-element-in-a-sorted-matrix/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0378-kth-smallest-element-in-a-sorted-matrix/Medium | Array, Binary Search, Sorting, Heap (Priority Queue), Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/0420-strong-password-checker/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0420-strong-password-checker/Hard | String, Greedy, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/0451-sort-characters-by-frequency/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0451-sort-characters-by-frequency/Medium | Hash Table, String, Sorting, Heap (Priority Queue), Bucket Sort, Countinghttps://leetcode-solutions-5zk.pages.dev/posts/0215-kth-largest-element-in-an-array/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0215-kth-largest-element-in-an-array/Medium | Array, Divide and Conquer, Sorting, Heap (Priority Queue), Quickselecthttps://leetcode-solutions-5zk.pages.dev/posts/0218-the-skyline-problem/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0218-the-skyline-problem/Hard | Array, Divide and Conquer, Binary Indexed Tree, Segment Tree, Sweep Line, Sorting, Heap (Priority Queue), Ordered Sethttps://leetcode-solutions-5zk.pages.dev/posts/0023-merge-k-sorted-lists/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0023-merge-k-sorted-lists/Hard | Linked List, Divide and Conquer, Heap (Priority Queue), Merge Sorthttps://leetcode-solutions-5zk.pages.dev/posts/0239-sliding-window-maximum/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0239-sliding-window-maximum/Hard | Array, Queue, Sliding Window, Heap (Priority Queue), Monotonic Queuehttps://leetcode-solutions-5zk.pages.dev/posts/0264-ugly-number-ii/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0264-ugly-number-ii/Medium | Hash Table, Math, Dynamic Programming, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/0295-find-median-from-data-stream/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0295-find-median-from-data-stream/Hard | Two Pointers, Design, Sorting, Heap (Priority Queue), Data Stream