https://leetcode-solutions-5zk.pages.dev/difficulties/hard/Recent content in Hard 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/1659-maximize-grid-happiness/Wed, 06 May 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1659-maximize-grid-happiness/Hard | Dynamic Programming, Bit Manipulation, Memoization, Bitmaskhttps://leetcode-solutions-5zk.pages.dev/posts/1728-cat-and-mouse-ii/Wed, 06 May 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1728-cat-and-mouse-ii/Hard | Array, Math, Dynamic Programming, Graph Theory, Topological Sort, Memoization, Matrix, Game Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/1896-minimum-cost-to-change-the-final-value-of-expression/Wed, 06 May 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1896-minimum-cost-to-change-the-final-value-of-expression/Hard | Math, String, Dynamic Programming, Stackhttps://leetcode-solutions-5zk.pages.dev/posts/2286-booking-concert-tickets-in-groups/Wed, 06 May 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2286-booking-concert-tickets-in-groups/Hard | Binary Search, Design, Binary Indexed Tree, Segment Treehttps://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/3003-maximize-the-number-of-partitions-after-operations/Wed, 06 May 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3003-maximize-the-number-of-partitions-after-operations/Hard | String, Dynamic Programming, Bit Manipulation, Bitmaskhttps://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/3197-find-the-minimum-area-to-cover-all-ones-ii/Wed, 06 May 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3197-find-the-minimum-area-to-cover-all-ones-ii/Hard | Array, Matrix, Enumerationhttps://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/3348-smallest-divisible-digit-product-ii/Wed, 06 May 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3348-smallest-divisible-digit-product-ii/Hard | Math, String, Backtracking, Greedy, Number Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/3357-minimize-the-maximum-adjacent-element-difference/Wed, 06 May 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3357-minimize-the-maximum-adjacent-element-difference/Hard | Array, Binary Search, Greedyhttps://leetcode-solutions-5zk.pages.dev/posts/3414-maximum-score-of-non-overlapping-intervals/Wed, 06 May 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3414-maximum-score-of-non-overlapping-intervals/Hard | Array, Binary Search, Dynamic Programming, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/3474-lexicographically-smallest-generated-string/Wed, 06 May 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3474-lexicographically-smallest-generated-string/Hard | String, Greedy, String Matchinghttps://leetcode-solutions-5zk.pages.dev/posts/3515-shortest-path-in-a-weighted-tree/Wed, 06 May 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3515-shortest-path-in-a-weighted-tree/Hard | Array, Tree, Depth-First Search, Binary Indexed Tree, Segment Treehttps://leetcode-solutions-5zk.pages.dev/posts/3548-equal-sum-grid-partition-ii/Wed, 06 May 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3548-equal-sum-grid-partition-ii/Hard | Array, Hash Table, Matrix, Enumeration, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/3585-find-weighted-median-node-in-tree/Wed, 06 May 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3585-find-weighted-median-node-in-tree/Hard | Array, Binary Search, Dynamic Programming, Bit Manipulation, Tree, Depth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/3841-palindromic-path-queries-in-a-tree/Wed, 06 May 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3841-palindromic-path-queries-in-a-tree/Hard | Array, String, Divide and Conquer, Tree, Segment Treehttps://leetcode-solutions-5zk.pages.dev/posts/0745-prefix-and-suffix-search/Wed, 06 May 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0745-prefix-and-suffix-search/Hard | Array, Hash Table, String, Design, Triehttps://leetcode-solutions-5zk.pages.dev/posts/0770-basic-calculator-iv/Wed, 06 May 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0770-basic-calculator-iv/Hard | Hash Table, Math, String, Stack, Recursionhttps://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/1719-number-of-ways-to-reconstruct-a-tree/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1719-number-of-ways-to-reconstruct-a-tree/Hard | Array, Hash Table, Tree, Graph Theory, Simulationhttps://leetcode-solutions-5zk.pages.dev/posts/1770-maximum-score-from-performing-multiplication-operations/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1770-maximum-score-from-performing-multiplication-operations/Hard | Array, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/1771-maximize-palindrome-length-from-subsequences/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1771-maximize-palindrome-length-from-subsequences/Hard | String, Dynamic Programminghttps://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/1787-make-the-xor-of-all-segments-equal-to-zero/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1787-make-the-xor-of-all-segments-equal-to-zero/Hard | Array, Hash Table, Dynamic Programming, Bit Manipulation, Countinghttps://leetcode-solutions-5zk.pages.dev/posts/1803-count-pairs-with-xor-in-a-range/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1803-count-pairs-with-xor-in-a-range/Hard | Array, Bit Manipulation, Triehttps://leetcode-solutions-5zk.pages.dev/posts/1819-number-of-different-subsequences-gcds/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1819-number-of-different-subsequences-gcds/Hard | Array, Math, Counting, Number Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/1883-minimum-skips-to-arrive-at-meeting-on-time/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1883-minimum-skips-to-arrive-at-meeting-on-time/Hard | Array, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/1994-the-number-of-good-subsets/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1994-the-number-of-good-subsets/Hard | Array, Hash Table, Math, Dynamic Programming, Bit Manipulation, Counting, Number Theory, Bitmaskhttps://leetcode-solutions-5zk.pages.dev/posts/2014-longest-subsequence-repeated-k-times/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2014-longest-subsequence-repeated-k-times/Hard | Hash Table, Two Pointers, String, Backtracking, Counting, Enumerationhttps://leetcode-solutions-5zk.pages.dev/posts/2019-the-score-of-students-solving-math-expression/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2019-the-score-of-students-solving-math-expression/Hard | Array, Hash Table, Math, String, Dynamic Programming, Stack, Memoizationhttps://leetcode-solutions-5zk.pages.dev/posts/2025-maximum-number-of-ways-to-partition-an-array/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2025-maximum-number-of-ways-to-partition-an-array/Hard | Array, Hash Table, Counting, Enumeration, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/2045-second-minimum-time-to-reach-destination/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2045-second-minimum-time-to-reach-destination/Hard | Breadth-First Search, Graph Theory, Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/2088-count-fertile-pyramids-in-a-land/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2088-count-fertile-pyramids-in-a-land/Hard | Array, Dynamic Programming, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/2092-find-all-people-with-secret/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2092-find-all-people-with-secret/Hard | Depth-First Search, Breadth-First Search, Union-Find, Graph Theory, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/2132-stamping-the-grid/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2132-stamping-the-grid/Hard | Array, Greedy, Matrix, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/2141-maximum-running-time-of-n-computers/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2141-maximum-running-time-of-n-computers/Hard | Array, Binary Search, Greedy, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/2151-maximum-good-people-based-on-statements/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2151-maximum-good-people-based-on-statements/Hard | Array, Backtracking, Bit Manipulation, Enumerationhttps://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/2188-minimum-time-to-finish-the-race/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2188-minimum-time-to-finish-the-race/Hard | Array, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/2242-maximum-score-of-a-node-sequence/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2242-maximum-score-of-a-node-sequence/Hard | Array, Graph Theory, Sorting, Enumerationhttps://leetcode-solutions-5zk.pages.dev/posts/2258-escape-the-spreading-fire/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2258-escape-the-spreading-fire/Hard | Array, Binary Search, Breadth-First Search, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/2272-substring-with-largest-variance/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2272-substring-with-largest-variance/Hard | Hash Table, String, Dynamic Programming, Enumerationhttps://leetcode-solutions-5zk.pages.dev/posts/2301-match-substring-after-replacement/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2301-match-substring-after-replacement/Hard | Array, Hash Table, String, String Matchinghttps://leetcode-solutions-5zk.pages.dev/posts/2338-count-the-number-of-ideal-arrays/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2338-count-the-number-of-ideal-arrays/Hard | Math, Dynamic Programming, Combinatorics, Number Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/2392-build-a-matrix-with-conditions/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2392-build-a-matrix-with-conditions/Hard | Array, Graph Theory, Topological Sort, Matrixhttps://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/0037-sudoku-solver/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0037-sudoku-solver/Hard | Array, Hash Table, Backtracking, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/0076-minimum-window-substring/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0076-minimum-window-substring/Hard | Hash Table, String, Sliding Windowhttps://leetcode-solutions-5zk.pages.dev/posts/1092-shortest-common-supersequence/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1092-shortest-common-supersequence/Hard | String, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/0115-distinct-subsequences/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0115-distinct-subsequences/Hard | String, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/1192-critical-connections-in-a-network/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1192-critical-connections-in-a-network/Hard | Depth-First Search, Graph Theory, Biconnected Componenthttps://leetcode-solutions-5zk.pages.dev/posts/1223-dice-roll-simulation/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1223-dice-roll-simulation/Hard | Array, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/1224-maximum-equal-frequency/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1224-maximum-equal-frequency/Hard | Array, Hash Tablehttps://leetcode-solutions-5zk.pages.dev/posts/0126-word-ladder-ii/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0126-word-ladder-ii/Hard | Hash Table, String, Backtracking, Breadth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/0127-word-ladder/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0127-word-ladder/Hard | Hash Table, String, Breadth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/1301-number-of-paths-with-max-score/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1301-number-of-paths-with-max-score/Hard | Array, Dynamic Programming, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/1312-minimum-insertion-steps-to-make-a-string-palindrome/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1312-minimum-insertion-steps-to-make-a-string-palindrome/Hard | String, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/1316-distinct-echo-substrings/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1316-distinct-echo-substrings/Hard | String, Trie, Rolling Hash, Hash Functionhttps://leetcode-solutions-5zk.pages.dev/posts/0132-palindrome-partitioning-ii/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0132-palindrome-partitioning-ii/Hard | String, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/1320-minimum-distance-to-type-a-word-using-two-fingers/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1320-minimum-distance-to-type-a-word-using-two-fingers/Hard | String, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/1349-maximum-students-taking-exam/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1349-maximum-students-taking-exam/Hard | Array, Dynamic Programming, Bit Manipulation, Matrix, Bitmaskhttps://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/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/1444-number-of-ways-of-cutting-a-pizza/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1444-number-of-ways-of-cutting-a-pizza/Hard | Array, Dynamic Programming, Memoization, Matrix, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/1473-paint-house-iii/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1473-paint-house-iii/Hard | Array, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/1483-kth-ancestor-of-a-tree-node/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1483-kth-ancestor-of-a-tree-node/Hard | Binary Search, Dynamic Programming, Bit Manipulation, Tree, Depth-First Search, Breadth-First Search, Designhttps://leetcode-solutions-5zk.pages.dev/posts/1489-find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1489-find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree/Hard | Union-Find, Graph Theory, Sorting, Minimum Spanning Tree, Strongly Connected Componenthttps://leetcode-solutions-5zk.pages.dev/posts/1505-minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1505-minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits/Hard | String, Greedy, Binary Indexed Tree, Segment Treehttps://leetcode-solutions-5zk.pages.dev/posts/1568-minimum-number-of-days-to-disconnect-island/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1568-minimum-number-of-days-to-disconnect-island/Hard | Array, Depth-First Search, Breadth-First Search, Matrix, Strongly Connected Componenthttps://leetcode-solutions-5zk.pages.dev/posts/1579-remove-max-number-of-edges-to-keep-graph-fully-traversable/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1579-remove-max-number-of-edges-to-keep-graph-fully-traversable/Hard | Union-Find, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/1595-minimum-cost-to-connect-two-groups-of-points/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1595-minimum-cost-to-connect-two-groups-of-points/Hard | Array, Dynamic Programming, Bit Manipulation, Matrix, Bitmaskhttps://leetcode-solutions-5zk.pages.dev/posts/1916-count-ways-to-build-rooms-in-an-ant-colony/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1916-count-ways-to-build-rooms-in-an-ant-colony/Hard | Array, Math, Dynamic Programming, Tree, Depth-First Search, Graph Theory, Topological Sort, Combinatoricshttps://leetcode-solutions-5zk.pages.dev/posts/2781-length-of-the-longest-valid-substring/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2781-length-of-the-longest-valid-substring/Hard | Array, Hash Table, String, Sliding Windowhttps://leetcode-solutions-5zk.pages.dev/posts/2790-maximum-number-of-groups-with-increasing-length/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2790-maximum-number-of-groups-with-increasing-length/Hard | Array, Math, Binary Search, Greedy, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/2791-count-paths-that-can-form-a-palindrome-in-a-tree/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2791-count-paths-that-can-form-a-palindrome-in-a-tree/Hard | Hash Table, Bit Manipulation, Tree, Depth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/0335-self-crossing/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0335-self-crossing/Hard | Array, Math, Geometryhttps://leetcode-solutions-5zk.pages.dev/posts/0354-russian-doll-envelopes/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0354-russian-doll-envelopes/Hard | Array, Binary Search, Dynamic Programming, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/3574-maximize-subarray-gcd-score/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3574-maximize-subarray-gcd-score/Hard | Array, Math, Enumeration, Number Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/3575-maximum-good-subtree-score/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3575-maximum-good-subtree-score/Hard | Array, Dynamic Programming, Bit Manipulation, Tree, Depth-First Search, Bitmaskhttps://leetcode-solutions-5zk.pages.dev/posts/3579-minimum-steps-to-convert-string-with-operations/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3579-minimum-steps-to-convert-string-with-operations/Hard | String, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/0363-max-sum-of-rectangle-no-larger-than-k/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0363-max-sum-of-rectangle-no-larger-than-k/Hard | Array, Binary Search, Matrix, Prefix Sum, Ordered Sethttps://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/0472-concatenated-words/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0472-concatenated-words/Hard | Array, String, Dynamic Programming, Depth-First Search, Trie, Sortinghttps://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/0483-smallest-good-base/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0483-smallest-good-base/Hard | Math, Binary Searchhttps://leetcode-solutions-5zk.pages.dev/posts/0488-zuma-game/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0488-zuma-game/Hard | String, Dynamic Programming, Stack, Breadth-First Search, Memoizationhttps://leetcode-solutions-5zk.pages.dev/posts/0514-freedom-trail/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0514-freedom-trail/Hard | String, Dynamic Programming, Depth-First Search, Breadth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/0552-student-attendance-record-ii/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0552-student-attendance-record-ii/Hard | Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/0587-erect-the-fence/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0587-erect-the-fence/Hard | Array, Math, Geometryhttps://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/0730-count-different-palindromic-subsequences/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0730-count-different-palindromic-subsequences/Hard | String, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/0736-parse-lisp-expression/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0736-parse-lisp-expression/Hard | Hash Table, String, Stack, Recursionhttps://leetcode-solutions-5zk.pages.dev/posts/0749-contain-virus/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0749-contain-virus/Hard | Array, Depth-First Search, Breadth-First Search, Matrix, Simulationhttps://leetcode-solutions-5zk.pages.dev/posts/0827-making-a-large-island/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0827-making-a-large-island/Hard | Array, Depth-First Search, Breadth-First Search, Union-Find, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/0839-similar-string-groups/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0839-similar-string-groups/Hard | Array, Hash Table, String, Depth-First Search, Breadth-First Search, Union-Findhttps://leetcode-solutions-5zk.pages.dev/posts/0843-guess-the-word/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0843-guess-the-word/Hard | Array, Math, String, Interactive, Game Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/0864-shortest-path-to-get-all-keys/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0864-shortest-path-to-get-all-keys/Hard | Array, Bit Manipulation, Breadth-First Search, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/0913-cat-and-mouse/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0913-cat-and-mouse/Hard | Math, Dynamic Programming, Graph Theory, Topological Sort, Memoization, Game Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/0943-find-the-shortest-superstring/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0943-find-the-shortest-superstring/Hard | Array, String, Dynamic Programming, Bit Manipulation, Bitmaskhttps://leetcode-solutions-5zk.pages.dev/posts/0980-unique-paths-iii/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0980-unique-paths-iii/Hard | Array, Backtracking, Bit Manipulation, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/0982-triples-with-bitwise-and-equal-to-zero/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0982-triples-with-bitwise-and-equal-to-zero/Hard | Array, Hash Table, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/0996-number-of-squareful-arrays/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0996-number-of-squareful-arrays/Hard | Array, Hash Table, Math, Dynamic Programming, Backtracking, Bit Manipulation, Bitmaskhttps://leetcode-solutions-5zk.pages.dev/posts/3203-find-minimum-diameter-after-merging-two-trees/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3203-find-minimum-diameter-after-merging-two-trees/Hard | Tree, Depth-First Search, Breadth-First Search, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/3209-number-of-subarrays-with-and-value-of-k/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3209-number-of-subarrays-with-and-value-of-k/Hard | Array, Binary Search, Bit Manipulation, Segment Treehttps://leetcode-solutions-5zk.pages.dev/posts/3213-construct-string-with-minimum-cost/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3213-construct-string-with-minimum-cost/Hard | Array, String, Dynamic Programming, Suffix Arrayhttps://leetcode-solutions-5zk.pages.dev/posts/3219-minimum-cost-for-cutting-cake-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3219-minimum-cost-for-cutting-cake-ii/Hard | Array, Greedy, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/3225-maximum-score-from-grid-operations/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3225-maximum-score-from-grid-operations/Hard | Array, Dynamic Programming, Matrix, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/3229-minimum-operations-to-make-array-equal-to-target/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3229-minimum-operations-to-make-array-equal-to-target/Hard | Array, Dynamic Programming, Stack, Greedy, Monotonic Stackhttps://leetcode-solutions-5zk.pages.dev/posts/3235-check-if-the-rectangle-corner-is-reachable/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3235-check-if-the-rectangle-corner-is-reachable/Hard | Array, Math, Depth-First Search, Breadth-First Search, Union-Find, Geometryhttps://leetcode-solutions-5zk.pages.dev/posts/3241-time-taken-to-mark-all-nodes/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3241-time-taken-to-mark-all-nodes/Hard | Dynamic Programming, Tree, Depth-First Search, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/3244-shortest-distance-after-road-addition-queries-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3244-shortest-distance-after-road-addition-queries-ii/Hard | Array, Greedy, Graph Theory, Ordered Sethttps://leetcode-solutions-5zk.pages.dev/posts/3245-alternating-groups-iii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3245-alternating-groups-iii/Hard | Array, Binary Indexed Tree, Ordered Sethttps://leetcode-solutions-5zk.pages.dev/posts/3250-find-the-count-of-monotonic-pairs-i/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3250-find-the-count-of-monotonic-pairs-i/Hard | Array, Math, Dynamic Programming, Combinatorics, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/3251-find-the-count-of-monotonic-pairs-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3251-find-the-count-of-monotonic-pairs-ii/Hard | Array, Math, Dynamic Programming, Combinatorics, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/3256-maximum-value-sum-by-placing-three-rooks-i/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3256-maximum-value-sum-by-placing-three-rooks-i/Hard | Array, Dynamic Programming, Matrix, Enumerationhttps://leetcode-solutions-5zk.pages.dev/posts/3257-maximum-value-sum-by-placing-three-rooks-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3257-maximum-value-sum-by-placing-three-rooks-ii/Hard | Array, Dynamic Programming, Matrix, Enumerationhttps://leetcode-solutions-5zk.pages.dev/posts/3260-find-the-largest-palindrome-divisible-by-k/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3260-find-the-largest-palindrome-divisible-by-k/Hard | Math, String, Dynamic Programming, Greedy, Number Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/3261-count-substrings-that-satisfy-k-constraint-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3261-count-substrings-that-satisfy-k-constraint-ii/Hard | Array, String, Binary Search, Sliding Window, Prefix Sumhttps://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/3267-count-almost-equal-pairs-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3267-count-almost-equal-pairs-ii/Hard | Array, Hash Table, Sorting, Counting, Enumerationhttps://leetcode-solutions-5zk.pages.dev/posts/3272-find-the-count-of-good-integers/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3272-find-the-count-of-good-integers/Hard | Hash Table, Math, Combinatorics, Enumerationhttps://leetcode-solutions-5zk.pages.dev/posts/3273-minimum-amount-of-damage-dealt-to-bob/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3273-minimum-amount-of-damage-dealt-to-bob/Hard | Array, Greedy, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/3276-select-cells-in-grid-with-maximum-score/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3276-select-cells-in-grid-with-maximum-score/Hard | Array, Dynamic Programming, Bit Manipulation, Matrix, Bitmaskhttps://leetcode-solutions-5zk.pages.dev/posts/3277-maximum-xor-score-subarray-queries/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3277-maximum-xor-score-subarray-queries/Hard | Array, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/3283-maximum-number-of-moves-to-kill-all-pawns/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3283-maximum-number-of-moves-to-kill-all-pawns/Hard | Array, Math, Bit Manipulation, Breadth-First Search, Game Theory, Bitmaskhttps://leetcode-solutions-5zk.pages.dev/posts/3287-find-the-maximum-sequence-value-of-array/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3287-find-the-maximum-sequence-value-of-array/Hard | Array, Dynamic Programming, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/3288-length-of-the-longest-increasing-path/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3288-length-of-the-longest-increasing-path/Hard | Array, Binary Search, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/3292-minimum-number-of-valid-strings-to-form-target-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3292-minimum-number-of-valid-strings-to-form-target-ii/Hard | Array, String, Binary Search, Dynamic Programming, Greedy, Segment Tree, Rolling Hash, String Matching, Hash Functionhttps://leetcode-solutions-5zk.pages.dev/posts/3298-count-substrings-that-can-be-rearranged-to-contain-a-string-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3298-count-substrings-that-can-be-rearranged-to-contain-a-string-ii/Hard | Hash Table, String, Sliding Windowhttps://leetcode-solutions-5zk.pages.dev/posts/3303-find-the-occurrence-of-first-almost-equal-substring/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3303-find-the-occurrence-of-first-almost-equal-substring/Hard | String, String Matchinghttps://leetcode-solutions-5zk.pages.dev/posts/3307-find-the-k-th-character-in-string-game-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3307-find-the-k-th-character-in-string-game-ii/Hard | Math, Bit Manipulation, Recursionhttps://leetcode-solutions-5zk.pages.dev/posts/3311-construct-2d-grid-matching-graph-layout/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3311-construct-2d-grid-matching-graph-layout/Hard | Array, Hash Table, Graph Theory, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/3312-sorted-gcd-pair-queries/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3312-sorted-gcd-pair-queries/Hard | Array, Hash Table, Math, Binary Search, Combinatorics, Counting, Number Theory, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/3317-find-the-number-of-possible-ways-for-an-event/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3317-find-the-number-of-possible-ways-for-an-event/Hard | Math, Dynamic Programming, Combinatoricshttps://leetcode-solutions-5zk.pages.dev/posts/3320-count-the-number-of-winning-sequences/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3320-count-the-number-of-winning-sequences/Hard | String, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/3327-check-if-dfs-strings-are-palindromes/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3327-check-if-dfs-strings-are-palindromes/Hard | Array, Hash Table, String, Tree, Depth-First Search, Hash Functionhttps://leetcode-solutions-5zk.pages.dev/posts/3333-find-the-original-typed-string-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3333-find-the-original-typed-string-ii/Hard | String, Dynamic Programming, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/3336-find-the-number-of-subsequences-with-equal-gcd/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3336-find-the-number-of-subsequences-with-equal-gcd/Hard | Array, Math, Dynamic Programming, Number Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/3337-total-characters-in-string-after-transformations-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3337-total-characters-in-string-after-transformations-ii/Hard | Hash Table, Math, String, Dynamic Programming, Countinghttps://leetcode-solutions-5zk.pages.dev/posts/3343-count-number-of-balanced-permutations/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3343-count-number-of-balanced-permutations/Hard | Math, String, Dynamic Programming, Combinatoricshttps://leetcode-solutions-5zk.pages.dev/posts/3347-maximum-frequency-of-an-element-after-performing-operations-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3347-maximum-frequency-of-an-element-after-performing-operations-ii/Hard | Array, Binary Search, Sliding Window, Sorting, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/3351-sum-of-good-subsequences/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3351-sum-of-good-subsequences/Hard | Array, Hash Table, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/3352-count-k-reducible-numbers-less-than-n/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3352-count-k-reducible-numbers-less-than-n/Hard | Math, String, Dynamic Programming, Combinatoricshttps://leetcode-solutions-5zk.pages.dev/posts/3363-find-the-maximum-number-of-fruits-collected/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3363-find-the-maximum-number-of-fruits-collected/Hard | Array, Dynamic Programming, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/3367-maximize-sum-of-weights-after-edge-removals/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3367-maximize-sum-of-weights-after-edge-removals/Hard | Dynamic Programming, Tree, Depth-First Search, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/3373-maximize-the-number-of-target-nodes-after-connecting-trees-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3373-maximize-the-number-of-target-nodes-after-connecting-trees-ii/Hard | Tree, Depth-First Search, Breadth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/3378-count-connected-components-in-lcm-graph/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3378-count-connected-components-in-lcm-graph/Hard | Array, Hash Table, Math, Union-Find, Number Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/3382-maximum-area-rectangle-with-point-constraints-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3382-maximum-area-rectangle-with-point-constraints-ii/Hard | Array, Math, Binary Indexed Tree, Segment Tree, Geometry, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/3389-minimum-operations-to-make-character-frequencies-equal/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3389-minimum-operations-to-make-character-frequencies-equal/Hard | Hash Table, String, Dynamic Programming, Counting, Enumerationhttps://leetcode-solutions-5zk.pages.dev/posts/3395-subsequences-with-a-unique-middle-mode-i/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3395-subsequences-with-a-unique-middle-mode-i/Hard | Array, Hash Table, Math, Combinatoricshttps://leetcode-solutions-5zk.pages.dev/posts/3398-smallest-substring-with-identical-characters-i/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3398-smallest-substring-with-identical-characters-i/Hard | Array, Binary Search, Enumerationhttps://leetcode-solutions-5zk.pages.dev/posts/3399-smallest-substring-with-identical-characters-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3399-smallest-substring-with-identical-characters-ii/Hard | String, Binary Searchhttps://leetcode-solutions-5zk.pages.dev/posts/3405-count-the-number-of-arrays-with-k-matching-adjacent-elements/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3405-count-the-number-of-arrays-with-k-matching-adjacent-elements/Hard | Math, Combinatoricshttps://leetcode-solutions-5zk.pages.dev/posts/3410-maximize-subarray-sum-after-removing-all-occurrences-of-one-element/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3410-maximize-subarray-sum-after-removing-all-occurrences-of-one-element/Hard | Array, Dynamic Programming, Segment Treehttps://leetcode-solutions-5zk.pages.dev/posts/3420-count-non-decreasing-subarrays-after-k-operations/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3420-count-non-decreasing-subarrays-after-k-operations/Hard | Array, Stack, Segment Tree, Queue, Sliding Window, Monotonic Stack, Monotonic Queuehttps://leetcode-solutions-5zk.pages.dev/posts/3425-longest-special-path/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3425-longest-special-path/Hard | Array, Hash Table, Tree, Depth-First Search, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/3426-manhattan-distances-of-all-arrangements-of-pieces/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3426-manhattan-distances-of-all-arrangements-of-pieces/Hard | Math, Combinatoricshttps://leetcode-solutions-5zk.pages.dev/posts/3430-maximum-and-minimum-sums-of-at-most-size-k-subarrays/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3430-maximum-and-minimum-sums-of-at-most-size-k-subarrays/Hard | Array, Math, Stack, Monotonic Stackhttps://leetcode-solutions-5zk.pages.dev/posts/3435-frequencies-of-shortest-supersequences/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3435-frequencies-of-shortest-supersequences/Hard | Array, String, Bit Manipulation, Graph Theory, Topological Sort, Enumerationhttps://leetcode-solutions-5zk.pages.dev/posts/3441-minimum-cost-good-caption/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3441-minimum-cost-good-caption/Hard | String, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/3444-minimum-increments-for-target-multiples-in-an-array/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3444-minimum-increments-for-target-multiples-in-an-array/Hard | Array, Math, Dynamic Programming, Bit Manipulation, Number Theory, Bitmaskhttps://leetcode-solutions-5zk.pages.dev/posts/3445-maximum-difference-between-even-and-odd-frequency-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3445-maximum-difference-between-even-and-odd-frequency-ii/Hard | String, Sliding Window, Enumeration, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/3448-count-substrings-divisible-by-last-digit/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3448-count-substrings-divisible-by-last-digit/Hard | String, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/3449-maximize-the-minimum-game-score/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3449-maximize-the-minimum-game-score/Hard | Array, Binary Search, Greedyhttps://leetcode-solutions-5zk.pages.dev/posts/3454-separate-squares-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3454-separate-squares-ii/Hard | Array, Binary Search, Segment Tree, Sweep Linehttps://leetcode-solutions-5zk.pages.dev/posts/3455-shortest-matching-substring/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3455-shortest-matching-substring/Hard | Two Pointers, String, Binary Search, String Matchinghttps://leetcode-solutions-5zk.pages.dev/posts/3459-length-of-longest-v-shaped-diagonal-segment/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3459-length-of-longest-v-shaped-diagonal-segment/Hard | Array, Dynamic Programming, Memoization, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/3463-check-if-digits-are-equal-in-string-after-operations-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3463-check-if-digits-are-equal-in-string-after-operations-ii/Hard | Math, String, Combinatorics, Number Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/3464-maximize-the-distance-between-points-on-a-square/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3464-maximize-the-distance-between-points-on-a-square/Hard | Array, Math, Binary Search, Geometry, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/3470-permutations-iv/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3470-permutations-iv/Hard | Array, Math, Combinatorics, Enumerationhttps://leetcode-solutions-5zk.pages.dev/posts/3480-maximize-subarrays-after-removing-one-conflicting-pair/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3480-maximize-subarrays-after-removing-one-conflicting-pair/Hard | Array, Segment Tree, Enumeration, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/3485-longest-common-prefix-of-k-strings-after-removal/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3485-longest-common-prefix-of-k-strings-after-removal/Hard | Array, String, Triehttps://leetcode-solutions-5zk.pages.dev/posts/3486-longest-special-path-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3486-longest-special-path-ii/Hard | Array, Hash Table, Tree, Depth-First Search, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/3490-count-beautiful-numbers/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3490-count-beautiful-numbers/Hard | Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/3495-minimum-operations-to-make-array-elements-zero/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3495-minimum-operations-to-make-array-elements-zero/Hard | Array, Math, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/3500-minimum-cost-to-divide-array-into-subarrays/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3500-minimum-cost-to-divide-array-into-subarrays/Hard | Array, Dynamic Programming, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/3501-maximize-active-section-with-trade-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3501-maximize-active-section-with-trade-ii/Hard | Array, String, Binary Search, Segment Treehttps://leetcode-solutions-5zk.pages.dev/posts/3504-longest-palindrome-after-substring-concatenation-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3504-longest-palindrome-after-substring-concatenation-ii/Hard | Two Pointers, String, Dynamic Programminghttps://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/3509-maximum-product-of-subsequences-with-an-alternating-sum-equal-to-k/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3509-maximum-product-of-subsequences-with-an-alternating-sum-equal-to-k/Hard | Array, Hash Table, Dynamic Programminghttps://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/3518-smallest-palindromic-rearrangement-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3518-smallest-palindromic-rearrangement-ii/Hard | Hash Table, Math, String, Combinatorics, Countinghttps://leetcode-solutions-5zk.pages.dev/posts/3519-count-numbers-with-non-decreasing-digits/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3519-count-numbers-with-non-decreasing-digits/Hard | Math, String, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/3525-find-x-value-of-array-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3525-find-x-value-of-array-ii/Hard | Array, Math, Segment Treehttps://leetcode-solutions-5zk.pages.dev/posts/3530-maximum-profit-from-valid-topological-order-in-dag/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3530-maximum-profit-from-valid-topological-order-in-dag/Hard | Array, Dynamic Programming, Bit Manipulation, Graph Theory, Topological Sort, Bitmaskhttps://leetcode-solutions-5zk.pages.dev/posts/3533-concatenated-divisibility/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3533-concatenated-divisibility/Hard | Array, Dynamic Programming, Bit Manipulation, Bitmaskhttps://leetcode-solutions-5zk.pages.dev/posts/3534-path-existence-queries-in-a-graph-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3534-path-existence-queries-in-a-graph-ii/Hard | Array, Two Pointers, Binary Search, Dynamic Programming, Greedy, Bit Manipulation, Graph Theory, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/3538-merge-operations-for-minimum-travel-time/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3538-merge-operations-for-minimum-travel-time/Hard | Array, Dynamic Programming, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/3539-find-sum-of-array-product-of-magical-sequences/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3539-find-sum-of-array-product-of-magical-sequences/Hard | Array, Math, Dynamic Programming, Bit Manipulation, Combinatorics, Bitmaskhttps://leetcode-solutions-5zk.pages.dev/posts/3544-subtree-inversion-sum/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3544-subtree-inversion-sum/Hard | Array, Dynamic Programming, Tree, Depth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/3547-maximum-sum-of-edge-values-in-a-graph/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3547-maximum-sum-of-edge-values-in-a-graph/Hard | Math, Greedy, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/3553-minimum-weighted-subgraph-with-the-required-paths-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3553-minimum-weighted-subgraph-with-the-required-paths-ii/Hard | Array, Dynamic Programming, Bit Manipulation, Tree, Depth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/3559-number-of-ways-to-assign-edge-weights-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3559-number-of-ways-to-assign-edge-weights-ii/Hard | Array, Math, Dynamic Programming, Bit Manipulation, Tree, Depth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/3562-maximum-profit-from-trading-stocks-with-discounts/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3562-maximum-profit-from-trading-stocks-with-discounts/Hard | Array, Dynamic Programming, Tree, Depth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/3563-lexicographically-smallest-string-after-adjacent-removals/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3563-lexicographically-smallest-string-after-adjacent-removals/Hard | String, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/3569-maximize-count-of-distinct-primes-after-split/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3569-maximize-count-of-distinct-primes-after-split/Hard | Array, Math, Segment Tree, Number Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/3590-kth-smallest-path-xor-sum/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3590-kth-smallest-path-xor-sum/Hard | Array, Tree, Depth-First Search, 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/3600-maximize-spanning-tree-stability-with-upgrades/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3600-maximize-spanning-tree-stability-with-upgrades/Hard | Binary Search, Greedy, Union-Find, Graph Theory, Minimum Spanning Treehttps://leetcode-solutions-5zk.pages.dev/posts/3605-minimum-stability-factor-of-array/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3605-minimum-stability-factor-of-array/Hard | Array, Math, Binary Search, Greedy, Segment Tree, Number Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/3609-minimum-moves-to-reach-target-in-grid/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3609-minimum-moves-to-reach-target-in-grid/Hard | Mathhttps://leetcode-solutions-5zk.pages.dev/posts/3614-process-string-with-special-operations-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3614-process-string-with-special-operations-ii/Hard | String, Simulationhttps://leetcode-solutions-5zk.pages.dev/posts/3615-longest-palindromic-path-in-graph/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3615-longest-palindromic-path-in-graph/Hard | String, Dynamic Programming, Bit Manipulation, Graph Theory, Bitmaskhttps://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/3621-number-of-integers-with-popcount-depth-equal-to-k-i/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3621-number-of-integers-with-popcount-depth-equal-to-k-i/Hard | Math, Dynamic Programming, Bit Manipulation, Combinatoricshttps://leetcode-solutions-5zk.pages.dev/posts/3624-number-of-integers-with-popcount-depth-equal-to-k-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3624-number-of-integers-with-popcount-depth-equal-to-k-ii/Hard | Array, Divide and Conquer, Binary Indexed Tree, Segment Treehttps://leetcode-solutions-5zk.pages.dev/posts/3625-count-number-of-trapezoids-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3625-count-number-of-trapezoids-ii/Hard | Array, Hash Table, Math, Geometryhttps://leetcode-solutions-5zk.pages.dev/posts/3630-partition-array-for-maximum-xor-and-and/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3630-partition-array-for-maximum-xor-and-and/Hard | Array, Math, Greedy, Bit Manipulation, Enumerationhttps://leetcode-solutions-5zk.pages.dev/posts/3636-threshold-majority-queries/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3636-threshold-majority-queries/Hard | Array, Hash Table, Binary Search, Divide and Conquer, Counting, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/3640-trionic-array-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3640-trionic-array-ii/Hard | Array, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/3646-next-special-palindrome-number/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3646-next-special-palindrome-number/Hard | Backtracking, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/3651-minimum-cost-path-with-teleportations/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3651-minimum-cost-path-with-teleportations/Hard | Array, Dynamic Programming, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/3655-xor-after-range-multiplication-queries-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3655-xor-after-range-multiplication-queries-ii/Hard | Array, Divide and Conquerhttps://leetcode-solutions-5zk.pages.dev/posts/3661-maximum-walls-destroyed-by-robots/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3661-maximum-walls-destroyed-by-robots/Hard | Array, Binary Search, Dynamic Programming, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/3666-minimum-operations-to-equalize-binary-string/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3666-minimum-operations-to-equalize-binary-string/Hard | Math, String, Breadth-First Search, Union-Find, Ordered Sethttps://leetcode-solutions-5zk.pages.dev/posts/3671-sum-of-beautiful-subsequences/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3671-sum-of-beautiful-subsequences/Hard | Array, Math, Binary Indexed Tree, Number Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/3677-count-binary-palindromic-numbers/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3677-count-binary-palindromic-numbers/Hard | Math, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/3681-maximum-xor-of-subsequences/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3681-maximum-xor-of-subsequences/Hard | Array, Math, Greedy, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/3686-number-of-stable-subsequences/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3686-number-of-stable-subsequences/Hard | Array, Dynamic Programminghttps://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/3695-maximize-alternating-sum-using-swaps/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3695-maximize-alternating-sum-using-swaps/Hard | Array, Greedy, Union-Find, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/3699-number-of-zigzag-arrays-i/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3699-number-of-zigzag-arrays-i/Hard | Dynamic Programming, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/3700-number-of-zigzag-arrays-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3700-number-of-zigzag-arrays-ii/Hard | Math, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/3704-count-no-zero-pairs-that-sum-to-n/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3704-count-no-zero-pairs-that-sum-to-n/Hard | Math, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/3710-maximum-partition-factor/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3710-maximum-partition-factor/Hard | Array, Binary Search, Depth-First Search, Breadth-First Search, Union-Find, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/3715-sum-of-perfect-square-ancestors/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3715-sum-of-perfect-square-ancestors/Hard | Array, Hash Table, Math, Tree, Depth-First Search, Counting, Number Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/3721-longest-balanced-subarray-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3721-longest-balanced-subarray-ii/Hard | Array, Hash Table, Divide and Conquer, Segment Tree, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/3725-count-ways-to-choose-coprime-integers-from-rows/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3725-count-ways-to-choose-coprime-integers-from-rows/Hard | Array, Math, Dynamic Programming, Matrix, Combinatorics, Number Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/3729-count-distinct-subarrays-divisible-by-k-in-sorted-array/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3729-count-distinct-subarrays-divisible-by-k-in-sorted-array/Hard | Array, Hash Table, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/3734-lexicographically-smallest-palindromic-permutation-greater-than-target/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3734-lexicographically-smallest-palindromic-permutation-greater-than-target/Hard | Two Pointers, String, Enumerationhttps://leetcode-solutions-5zk.pages.dev/posts/3739-count-subarrays-with-majority-element-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3739-count-subarrays-with-majority-element-ii/Hard | Array, Hash Table, Divide and Conquer, Segment Tree, Merge Sort, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/3743-maximize-cyclic-partition-score/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3743-maximize-cyclic-partition-score/Hard | Array, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/3748-count-stable-subarrays/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3748-count-stable-subarrays/Hard | Array, Binary Search, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/3753-total-waviness-of-numbers-in-range-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3753-total-waviness-of-numbers-in-range-ii/Hard | Math, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/3757-number-of-effective-subsequences/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3757-number-of-effective-subsequences/Hard | Array, Math, Dynamic Programming, Bit Manipulation, Combinatoricshttps://leetcode-solutions-5zk.pages.dev/posts/3762-minimum-operations-to-equalize-subarrays/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3762-minimum-operations-to-equalize-subarrays/Hard | Array, Math, Binary Search, Segment Treehttps://leetcode-solutions-5zk.pages.dev/posts/3768-minimum-inversion-count-in-subarrays-of-fixed-length/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3768-minimum-inversion-count-in-subarrays-of-fixed-length/Hard | Array, Segment Tree, Sliding Windowhttps://leetcode-solutions-5zk.pages.dev/posts/3772-maximum-subgraph-score-in-a-tree/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3772-maximum-subgraph-score-in-a-tree/Hard | Array, Dynamic Programming, Tree, Depth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/3777-minimum-deletions-to-make-alternating-substring/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3777-minimum-deletions-to-make-alternating-substring/Hard | String, Segment Treehttps://leetcode-solutions-5zk.pages.dev/posts/3782-last-remaining-integer-after-alternating-deletion-operations/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3782-last-remaining-integer-after-alternating-deletion-operations/Hard | Math, Recursionhttps://leetcode-solutions-5zk.pages.dev/posts/3785-minimum-swaps-to-avoid-forbidden-values/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3785-minimum-swaps-to-avoid-forbidden-values/Hard | Array, Hash Table, Greedy, Countinghttps://leetcode-solutions-5zk.pages.dev/posts/3786-total-sum-of-interaction-cost-in-tree-groups/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3786-total-sum-of-interaction-cost-in-tree-groups/Hard | Array, Tree, Depth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/3791-number-of-balanced-integers-in-a-range/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3791-number-of-balanced-integers-in-a-range/Hard | Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/3797-count-routes-to-climb-a-rectangular-grid/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3797-count-routes-to-climb-a-rectangular-grid/Hard | Array, Dynamic Programming, Matrix, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/3801-minimum-cost-to-merge-sorted-lists/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3801-minimum-cost-to-merge-sorted-lists/Hard | Array, Two Pointers, Binary Search, Dynamic Programming, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/3806-maximum-bitwise-and-after-increment-operations/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3806-maximum-bitwise-and-after-increment-operations/Hard | Array, Greedy, Bit Manipulation, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/3812-minimum-edge-toggles-on-a-tree/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3812-minimum-edge-toggles-on-a-tree/Hard | Tree, Depth-First Search, Graph Theory, Topological Sort, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/3816-lexicographically-smallest-string-after-deleting-duplicate-characters/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3816-lexicographically-smallest-string-after-deleting-duplicate-characters/Hard | Hash Table, String, Stack, Greedy, Monotonic Stackhttps://leetcode-solutions-5zk.pages.dev/posts/3821-find-nth-smallest-integer-with-k-one-bits/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3821-find-nth-smallest-integer-with-k-one-bits/Hard | Math, Bit Manipulation, Combinatoricshttps://leetcode-solutions-5zk.pages.dev/posts/3826-minimum-partition-score/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3826-minimum-partition-score/Hard | Array, Divide and Conquer, Dynamic Programming, Queue, Prefix Sum, Monotonic Queuehttps://leetcode-solutions-5zk.pages.dev/posts/3830-longest-alternating-subarray-after-removing-at-most-one-element/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3830-longest-alternating-subarray-after-removing-at-most-one-element/Hard | Array, Dynamic Programming, Enumerationhttps://leetcode-solutions-5zk.pages.dev/posts/3836-maximum-score-using-exactly-k-pairs/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3836-maximum-score-using-exactly-k-pairs/Hard | Array, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/3845-maximum-subarray-xor-with-bounded-range/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3845-maximum-subarray-xor-with-bounded-range/Hard | Array, Bit Manipulation, Trie, Queue, Sliding Window, Prefix Sum, Monotonic Queuehttps://leetcode-solutions-5zk.pages.dev/posts/3850-count-sequences-to-k/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3850-count-sequences-to-k/Hard | Array, Math, Dynamic Programming, Memoization, Number Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/3855-sum-of-k-digit-numbers-in-a-range/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3855-sum-of-k-digit-numbers-in-a-range/Hard | Math, Divide and Conquer, Combinatorics, Number Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/3859-count-subarrays-with-k-distinct-integers/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3859-count-subarrays-with-k-distinct-integers/Hard | Array, Hash Table, Sliding Window, Countinghttps://leetcode-solutions-5zk.pages.dev/posts/3864-minimum-cost-to-partition-a-binary-string/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3864-minimum-cost-to-partition-a-binary-string/Hard | String, Divide and Conquer, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/3869-count-fancy-numbers-in-a-range/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3869-count-fancy-numbers-in-a-range/Hard | Math, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/3873-maximum-points-activated-with-one-addition/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3873-maximum-points-activated-with-one-addition/Hard | Array, Hash Table, Union-Findhttps://leetcode-solutions-5zk.pages.dev/posts/3878-count-good-subarrays/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3878-count-good-subarrays/Hard | Array, Stack, Bit Manipulation, Monotonic Stackhttps://leetcode-solutions-5zk.pages.dev/posts/3883-count-non-decreasing-arrays-with-given-digit-sums/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3883-count-non-decreasing-arrays-with-given-digit-sums/Hard | Array, Dynamic Programming, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/3886-sum-of-sortable-integers/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3886-sum-of-sortable-integers/Hard | Array, Math, Sorting, Enumerationhttps://leetcode-solutions-5zk.pages.dev/posts/3887-incremental-even-weighted-cycle-queries/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3887-incremental-even-weighted-cycle-queries/Hard | Union-Find, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/3892-minimum-operations-to-achieve-at-least-k-peaks/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3892-minimum-operations-to-achieve-at-least-k-peaks/Hard | Array, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/3897-maximum-value-of-concatenated-binary-segments/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3897-maximum-value-of-concatenated-binary-segments/Hard |https://leetcode-solutions-5zk.pages.dev/posts/3901-good-subsequence-queries/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3901-good-subsequence-queries/Hard |https://leetcode-solutions-5zk.pages.dev/posts/2963-count-the-number-of-good-partitions/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2963-count-the-number-of-good-partitions/Hard | Array, Hash Table, Math, Combinatoricshttps://leetcode-solutions-5zk.pages.dev/posts/2968-apply-operations-to-maximize-frequency-score/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2968-apply-operations-to-maximize-frequency-score/Hard | Array, Binary Search, Sliding Window, Sorting, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/2972-count-the-number-of-incremovable-subarrays-ii/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2972-count-the-number-of-incremovable-subarrays-ii/Hard | Array, Two Pointers, Binary Searchhttps://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/2977-minimum-cost-to-convert-string-ii/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2977-minimum-cost-to-convert-string-ii/Hard | Array, String, Dynamic Programming, Graph Theory, Trie, Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/2983-palindrome-rearrangement-queries/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2983-palindrome-rearrangement-queries/Hard | Array, Hash Table, String, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/2999-count-the-number-of-powerful-integers/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2999-count-the-number-of-powerful-integers/Hard | Math, String, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/3008-find-beautiful-indices-in-the-given-array-ii/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3008-find-beautiful-indices-in-the-given-array-ii/Hard | Two Pointers, String, Binary Search, Rolling Hash, String Matching, Hash Functionhttps://leetcode-solutions-5zk.pages.dev/posts/3017-count-the-number-of-houses-at-a-certain-distance-ii/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3017-count-the-number-of-houses-at-a-certain-distance-ii/Hard | Graph Theory, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/3022-minimize-or-of-remaining-elements-using-operations/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3022-minimize-or-of-remaining-elements-using-operations/Hard | Array, Greedy, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/3027-find-the-number-of-ways-to-place-people-ii/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3027-find-the-number-of-ways-to-place-people-ii/Hard | Array, Math, Geometry, Sorting, Enumerationhttps://leetcode-solutions-5zk.pages.dev/posts/3031-minimum-time-to-revert-word-to-initial-state-ii/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3031-minimum-time-to-revert-word-to-initial-state-ii/Hard | String, Rolling Hash, String Matching, Hash Functionhttps://leetcode-solutions-5zk.pages.dev/posts/3036-number-of-subarrays-that-match-a-pattern-ii/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3036-number-of-subarrays-that-match-a-pattern-ii/Hard | Array, Rolling Hash, String Matching, Hash Functionhttps://leetcode-solutions-5zk.pages.dev/posts/3041-maximize-consecutive-elements-in-an-array-after-modification/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3041-maximize-consecutive-elements-in-an-array-after-modification/Hard | Array, Dynamic Programming, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/3045-count-prefix-and-suffix-pairs-ii/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3045-count-prefix-and-suffix-pairs-ii/Hard | Array, String, Trie, Rolling Hash, String Matching, Hash Functionhttps://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/3068-find-the-maximum-sum-of-node-values/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3068-find-the-maximum-sum-of-node-values/Hard | Array, Dynamic Programming, Greedy, Bit Manipulation, Tree, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/3072-distribute-elements-into-two-arrays-ii/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3072-distribute-elements-into-two-arrays-ii/Hard | Array, Binary Indexed Tree, Segment Tree, Simulationhttps://leetcode-solutions-5zk.pages.dev/posts/3077-maximum-strength-of-k-disjoint-subarrays/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3077-maximum-strength-of-k-disjoint-subarrays/Hard | Array, Dynamic Programming, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/3082-find-the-sum-of-the-power-of-all-subsequences/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3082-find-the-sum-of-the-power-of-all-subsequences/Hard | Array, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/3086-minimum-moves-to-pick-k-ones/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3086-minimum-moves-to-pick-k-ones/Hard | Array, Greedy, Sliding Window, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/3093-longest-common-suffix-queries/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3093-longest-common-suffix-queries/Hard | Array, String, Triehttps://leetcode-solutions-5zk.pages.dev/posts/3098-find-the-sum-of-subsequence-powers/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3098-find-the-sum-of-subsequence-powers/Hard | Array, Dynamic Programming, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/3102-minimize-manhattan-distances/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3102-minimize-manhattan-distances/Hard | Array, Math, Geometry, Sorting, Ordered Sethttps://leetcode-solutions-5zk.pages.dev/posts/3108-minimum-cost-walk-in-weighted-graph/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3108-minimum-cost-walk-in-weighted-graph/Hard | Array, Bit Manipulation, Union-Find, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/3113-find-the-number-of-subarrays-where-boundary-elements-are-maximum/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3113-find-the-number-of-subarrays-where-boundary-elements-are-maximum/Hard | Array, Binary Search, Stack, Monotonic Stackhttps://leetcode-solutions-5zk.pages.dev/posts/3116-kth-smallest-amount-with-single-denomination-combination/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3116-kth-smallest-amount-with-single-denomination-combination/Hard | Array, Math, Binary Search, Bit Manipulation, Combinatorics, Number Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/3117-minimum-sum-of-values-by-dividing-array/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3117-minimum-sum-of-values-by-dividing-array/Hard | Array, Binary Search, Dynamic Programming, Bit Manipulation, Segment Tree, Queuehttps://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/3130-find-all-possible-stable-binary-arrays-ii/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3130-find-all-possible-stable-binary-arrays-ii/Hard | Dynamic Programming, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/3134-find-the-median-of-the-uniqueness-array/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3134-find-the-median-of-the-uniqueness-array/Hard | Array, Hash Table, Binary Search, Sliding Windowhttps://leetcode-solutions-5zk.pages.dev/posts/3139-minimum-cost-to-equalize-array/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3139-minimum-cost-to-equalize-array/Hard | Array, Greedy, Enumerationhttps://leetcode-solutions-5zk.pages.dev/posts/3145-find-products-of-elements-of-big-array/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3145-find-products-of-elements-of-big-array/Hard | Array, Binary Search, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/3149-find-the-minimum-cost-array-permutation/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3149-find-the-minimum-cost-array-permutation/Hard | Array, Dynamic Programming, Bit Manipulation, Bitmaskhttps://leetcode-solutions-5zk.pages.dev/posts/3154-find-number-of-ways-to-reach-the-k-th-stair/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3154-find-number-of-ways-to-reach-the-k-th-stair/Hard | Math, Dynamic Programming, Bit Manipulation, Memoization, Combinatoricshttps://leetcode-solutions-5zk.pages.dev/posts/3161-block-placement-queries/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3161-block-placement-queries/Hard | Array, Binary Search, Binary Indexed Tree, Segment Treehttps://leetcode-solutions-5zk.pages.dev/posts/3165-maximum-sum-of-subsequence-with-non-adjacent-elements/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3165-maximum-sum-of-subsequence-with-non-adjacent-elements/Hard | Array, Divide and Conquer, Dynamic Programming, Segment Treehttps://leetcode-solutions-5zk.pages.dev/posts/3171-find-subarray-with-bitwise-or-closest-to-k/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3171-find-subarray-with-bitwise-or-closest-to-k/Hard | Array, Binary Search, Bit Manipulation, Segment Treehttps://leetcode-solutions-5zk.pages.dev/posts/3177-find-the-maximum-length-of-a-good-subsequence-ii/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3177-find-the-maximum-length-of-a-good-subsequence-ii/Hard | Array, Hash Table, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/3181-maximum-total-reward-using-operations-ii/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3181-maximum-total-reward-using-operations-ii/Hard | Array, Dynamic Programming, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/3187-peaks-in-array/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3187-peaks-in-array/Hard | Array, Binary Indexed Tree, Segment Treehttps://leetcode-solutions-5zk.pages.dev/posts/3193-count-the-number-of-inversions/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3193-count-the-number-of-inversions/Hard | Array, Dynamic Programminghttps://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/2646-minimize-the-total-price-of-the-trips/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2646-minimize-the-total-price-of-the-trips/Hard | Array, Dynamic Programming, Tree, Depth-First Search, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/2659-make-array-empty/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2659-make-array-empty/Hard | Array, Binary Search, Greedy, Binary Indexed Tree, Segment Tree, Sorting, Ordered Sethttps://leetcode-solutions-5zk.pages.dev/posts/2663-lexicographically-smallest-beautiful-string/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2663-lexicographically-smallest-beautiful-string/Hard | String, Greedyhttps://leetcode-solutions-5zk.pages.dev/posts/2681-power-of-heroes/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2681-power-of-heroes/Hard | Array, Math, Dynamic Programming, Sorting, Prefix Sumhttps://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/2709-greatest-common-divisor-traversal/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2709-greatest-common-divisor-traversal/Hard | Array, Math, Union-Find, Number Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/2713-maximum-strictly-increasing-cells-in-a-matrix/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2713-maximum-strictly-increasing-cells-in-a-matrix/Hard | Array, Hash Table, Binary Search, Dynamic Programming, Memoization, Sorting, Matrix, Ordered Sethttps://leetcode-solutions-5zk.pages.dev/posts/2719-count-of-integers/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2719-count-of-integers/Hard | Math, String, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/2732-find-a-good-subset-of-the-matrix/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2732-find-a-good-subset-of-the-matrix/Hard | Array, Hash Table, Bit Manipulation, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/2736-maximum-sum-queries/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2736-maximum-sum-queries/Hard | Array, Binary Search, Stack, Binary Indexed Tree, Segment Tree, Sorting, Monotonic Stackhttps://leetcode-solutions-5zk.pages.dev/posts/2742-painting-the-walls/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2742-painting-the-walls/Hard | Array, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/2751-robot-collisions/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2751-robot-collisions/Hard | Array, Stack, Sorting, Simulationhttps://leetcode-solutions-5zk.pages.dev/posts/2763-sum-of-imbalance-numbers-of-all-subarrays/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2763-sum-of-imbalance-numbers-of-all-subarrays/Hard | Array, Hash Table, Enumerationhttps://leetcode-solutions-5zk.pages.dev/posts/2801-count-stepping-numbers-in-range/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2801-count-stepping-numbers-in-range/Hard | String, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/2809-minimum-time-to-make-array-sum-at-most-x/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2809-minimum-time-to-make-array-sum-at-most-x/Hard | Array, Dynamic Programming, Sortinghttps://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/2818-apply-operations-to-maximize-score/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2818-apply-operations-to-maximize-score/Hard | Array, Math, Stack, Greedy, Sorting, Monotonic Stack, Number Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/2827-number-of-beautiful-integers-in-the-range/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2827-number-of-beautiful-integers-in-the-range/Hard | Math, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/2835-minimum-operations-to-form-subsequence-with-target-sum/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2835-minimum-operations-to-form-subsequence-with-target-sum/Hard | Array, Greedy, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/2836-maximize-value-of-function-in-a-ball-passing-game/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2836-maximize-value-of-function-in-a-ball-passing-game/Hard | Array, Dynamic Programming, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/2842-count-k-subsequences-of-a-string-with-maximum-beauty/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2842-count-k-subsequences-of-a-string-with-maximum-beauty/Hard | Hash Table, Math, String, Greedy, Sorting, Combinatoricshttps://leetcode-solutions-5zk.pages.dev/posts/2846-minimum-edge-weight-equilibrium-queries-in-a-tree/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2846-minimum-edge-weight-equilibrium-queries-in-a-tree/Hard | Array, Dynamic Programming, Bit Manipulation, Tree, Depth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/2851-string-transformation/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2851-string-transformation/Hard | Math, String, Dynamic Programming, String Matchinghttps://leetcode-solutions-5zk.pages.dev/posts/2858-minimum-edge-reversals-so-every-node-is-reachable/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2858-minimum-edge-reversals-so-every-node-is-reachable/Hard | Dynamic Programming, Depth-First Search, Breadth-First Search, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/2862-maximum-element-sum-of-a-complete-subset-of-indices/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2862-maximum-element-sum-of-a-complete-subset-of-indices/Hard | Array, Math, Number Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/2867-count-valid-paths-in-a-tree/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2867-count-valid-paths-in-a-tree/Hard | Math, Dynamic Programming, Tree, Depth-First Search, Number Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/2872-maximum-number-of-k-divisible-components/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2872-maximum-number-of-k-divisible-components/Hard | Tree, Depth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/2876-count-visited-nodes-in-a-directed-graph/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2876-count-visited-nodes-in-a-directed-graph/Hard | Dynamic Programming, Depth-First Search, Graph Theory, Topological Sort, Memoizationhttps://leetcode-solutions-5zk.pages.dev/posts/2897-apply-operations-on-array-to-maximize-sum-of-squares/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2897-apply-operations-on-array-to-maximize-sum-of-squares/Hard | Array, Hash Table, Greedy, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/2902-count-of-sub-multisets-with-bounded-sum/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2902-count-of-sub-multisets-with-bounded-sum/Hard | Array, Hash Table, Dynamic Programming, Sliding Windowhttps://leetcode-solutions-5zk.pages.dev/posts/2911-minimum-changes-to-make-k-semi-palindromes/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2911-minimum-changes-to-make-k-semi-palindromes/Hard | Two Pointers, String, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/2916-subarrays-distinct-element-sum-of-squares-ii/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2916-subarrays-distinct-element-sum-of-squares-ii/Hard | Array, Dynamic Programming, Binary Indexed Tree, Segment Treehttps://leetcode-solutions-5zk.pages.dev/posts/2920-maximum-points-after-collecting-coins-from-all-nodes/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2920-maximum-points-after-collecting-coins-from-all-nodes/Hard | Array, Dynamic Programming, Bit Manipulation, Tree, Depth-First Search, Memoizationhttps://leetcode-solutions-5zk.pages.dev/posts/2926-maximum-balanced-subsequence-sum/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2926-maximum-balanced-subsequence-sum/Hard | Array, Binary Search, Dynamic Programming, Binary Indexed Tree, Segment Treehttps://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/2935-maximum-strong-pair-xor-ii/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2935-maximum-strong-pair-xor-ii/Hard | Array, Hash Table, Bit Manipulation, Trie, Sliding Windowhttps://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/2945-find-maximum-non-decreasing-array-length/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2945-find-maximum-non-decreasing-array-length/Hard | Array, Binary Search, Dynamic Programming, Stack, Queue, Monotonic Stack, Prefix Sum, Monotonic Queuehttps://leetcode-solutions-5zk.pages.dev/posts/2949-count-beautiful-substrings-ii/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2949-count-beautiful-substrings-ii/Hard | Hash Table, Math, String, Number Theory, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/2953-count-complete-substrings/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2953-count-complete-substrings/Hard | Hash Table, String, Sliding Windowhttps://leetcode-solutions-5zk.pages.dev/posts/2954-count-the-number-of-infection-sequences/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2954-count-the-number-of-infection-sequences/Hard | Array, Math, Combinatoricshttps://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/2003-smallest-missing-genetic-value-in-each-subtree/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2003-smallest-missing-genetic-value-in-each-subtree/Hard | Array, Dynamic Programming, Tree, Depth-First Search, Union-Findhttps://leetcode-solutions-5zk.pages.dev/posts/2009-minimum-number-of-operations-to-make-array-continuous/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2009-minimum-number-of-operations-to-make-array-continuous/Hard | Array, Hash Table, Binary Search, Sliding Windowhttps://leetcode-solutions-5zk.pages.dev/posts/2030-smallest-k-length-subsequence-with-occurrences-of-a-letter/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2030-smallest-k-length-subsequence-with-occurrences-of-a-letter/Hard | String, Stack, Greedy, Monotonic Stackhttps://leetcode-solutions-5zk.pages.dev/posts/2035-partition-array-into-two-arrays-to-minimize-sum-difference/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2035-partition-array-into-two-arrays-to-minimize-sum-difference/Hard | Array, Two Pointers, Binary Search, Dynamic Programming, Bit Manipulation, Sorting, Ordered Set, Bitmaskhttps://leetcode-solutions-5zk.pages.dev/posts/2040-kth-smallest-product-of-two-sorted-arrays/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2040-kth-smallest-product-of-two-sorted-arrays/Hard | Array, Binary Searchhttps://leetcode-solutions-5zk.pages.dev/posts/2050-parallel-courses-iii/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2050-parallel-courses-iii/Hard | Array, Dynamic Programming, Graph Theory, Topological Sorthttps://leetcode-solutions-5zk.pages.dev/posts/2056-number-of-valid-move-combinations-on-chessboard/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2056-number-of-valid-move-combinations-on-chessboard/Hard | Array, String, Backtracking, Simulationhttps://leetcode-solutions-5zk.pages.dev/posts/2060-check-if-an-original-string-exists-given-two-encoded-strings/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2060-check-if-an-original-string-exists-given-two-encoded-strings/Hard | String, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/2065-maximum-path-quality-of-a-graph/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2065-maximum-path-quality-of-a-graph/Hard | Array, Backtracking, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/2071-maximum-number-of-tasks-you-can-assign/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2071-maximum-number-of-tasks-you-can-assign/Hard | Array, Two Pointers, Binary Search, Greedy, Queue, Sorting, Monotonic Queuehttps://leetcode-solutions-5zk.pages.dev/posts/2076-process-restricted-friend-requests/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2076-process-restricted-friend-requests/Hard | Union-Find, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/2081-sum-of-k-mirror-numbers/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2081-sum-of-k-mirror-numbers/Hard | Math, Enumerationhttps://leetcode-solutions-5zk.pages.dev/posts/2097-valid-arrangement-of-pairs/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2097-valid-arrangement-of-pairs/Hard | Array, Depth-First Search, Graph Theory, Eulerian Circuithttps://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/2106-maximum-fruits-harvested-after-at-most-k-steps/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2106-maximum-fruits-harvested-after-at-most-k-steps/Hard | Array, Binary Search, Sliding Window, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/2111-minimum-operations-to-make-the-array-k-increasing/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2111-minimum-operations-to-make-the-array-k-increasing/Hard | Array, Binary Searchhttps://leetcode-solutions-5zk.pages.dev/posts/2117-abbreviating-the-product-of-a-range/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2117-abbreviating-the-product-of-a-range/Hard | Math, Number Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/2122-recover-the-original-array/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2122-recover-the-original-array/Hard | Array, Hash Table, Two Pointers, Sorting, Enumerationhttps://leetcode-solutions-5zk.pages.dev/posts/2127-maximum-employees-to-be-invited-to-a-meeting/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2127-maximum-employees-to-be-invited-to-a-meeting/Hard | Array, Dynamic Programming, Depth-First Search, Graph Theory, Topological Sorthttps://leetcode-solutions-5zk.pages.dev/posts/2136-earliest-possible-day-of-full-bloom/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2136-earliest-possible-day-of-full-bloom/Hard | Array, Greedy, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/2147-number-of-ways-to-divide-a-long-corridor/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2147-number-of-ways-to-divide-a-long-corridor/Hard | Math, String, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/2156-find-substring-with-given-hash-value/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2156-find-substring-with-given-hash-value/Hard | String, Sliding Window, Rolling Hash, Hash Functionhttps://leetcode-solutions-5zk.pages.dev/posts/2157-groups-of-strings/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2157-groups-of-strings/Hard | Array, Hash Table, String, Bit Manipulation, Union-Findhttps://leetcode-solutions-5zk.pages.dev/posts/2167-minimum-time-to-remove-all-cars-containing-illegal-goods/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2167-minimum-time-to-remove-all-cars-containing-illegal-goods/Hard | String, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/2172-maximum-and-sum-of-array/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2172-maximum-and-sum-of-array/Hard | Array, Dynamic Programming, Bit Manipulation, Bitmaskhttps://leetcode-solutions-5zk.pages.dev/posts/2179-count-good-triplets-in-an-array/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2179-count-good-triplets-in-an-array/Hard | Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Sethttps://leetcode-solutions-5zk.pages.dev/posts/2183-count-array-pairs-divisible-by-k/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2183-count-array-pairs-divisible-by-k/Hard | Array, Hash Table, Math, Counting, Number Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/2193-minimum-number-of-moves-to-make-palindrome/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2193-minimum-number-of-moves-to-make-palindrome/Hard | Two Pointers, String, Greedy, Binary Indexed Treehttps://leetcode-solutions-5zk.pages.dev/posts/2197-replace-non-coprime-numbers-in-array/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2197-replace-non-coprime-numbers-in-array/Hard | Array, Math, Stack, Number Theoryhttps://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/2209-minimum-white-tiles-after-covering-with-carpets/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2209-minimum-white-tiles-after-covering-with-carpets/Hard | String, Dynamic Programming, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/2213-longest-substring-of-one-repeating-character/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2213-longest-substring-of-one-repeating-character/Hard | Array, String, Segment Tree, Ordered Sethttps://leetcode-solutions-5zk.pages.dev/posts/2218-maximum-value-of-k-coins-from-piles/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2218-maximum-value-of-k-coins-from-piles/Hard | Array, Dynamic Programming, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/2223-sum-of-scores-of-built-strings/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2223-sum-of-scores-of-built-strings/Hard | String, Binary Search, Rolling Hash, Suffix Array, String Matching, Hash Functionhttps://leetcode-solutions-5zk.pages.dev/posts/2227-encrypt-and-decrypt-strings/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2227-encrypt-and-decrypt-strings/Hard | Array, Hash Table, String, Design, Triehttps://leetcode-solutions-5zk.pages.dev/posts/2234-maximum-total-beauty-of-the-gardens/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2234-maximum-total-beauty-of-the-gardens/Hard | Array, Two Pointers, Binary Search, Greedy, Sorting, Enumeration, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/2246-longest-path-with-different-adjacent-characters/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2246-longest-path-with-different-adjacent-characters/Hard | Array, String, Tree, Depth-First Search, Graph Theory, Topological Sorthttps://leetcode-solutions-5zk.pages.dev/posts/2251-number-of-flowers-in-full-bloom/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2251-number-of-flowers-in-full-bloom/Hard | Array, Hash Table, Binary Search, Sorting, Prefix Sum, Ordered Sethttps://leetcode-solutions-5zk.pages.dev/posts/2262-total-appeal-of-a-string/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2262-total-appeal-of-a-string/Hard | Hash Table, String, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/2267-check-if-there-is-a-valid-parentheses-string-path/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2267-check-if-there-is-a-valid-parentheses-string-path/Hard | Array, Dynamic Programming, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/2276-count-integers-in-intervals/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2276-count-integers-in-intervals/Hard | Design, Segment Tree, Ordered Sethttps://leetcode-solutions-5zk.pages.dev/posts/2281-sum-of-total-strength-of-wizards/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2281-sum-of-total-strength-of-wizards/Hard | Array, Stack, Monotonic Stack, Prefix Sumhttps://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/2296-design-a-text-editor/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2296-design-a-text-editor/Hard | Linked List, String, Stack, Design, Simulation, Doubly-Linked Listhttps://leetcode-solutions-5zk.pages.dev/posts/2302-count-subarrays-with-score-less-than-k/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2302-count-subarrays-with-score-less-than-k/Hard | Array, Binary Search, Sliding Window, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/2306-naming-a-company/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2306-naming-a-company/Hard | Array, Hash Table, String, Bit Manipulation, Enumerationhttps://leetcode-solutions-5zk.pages.dev/posts/2312-selling-pieces-of-wood/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2312-selling-pieces-of-wood/Hard | Array, Dynamic Programming, Memoizationhttps://leetcode-solutions-5zk.pages.dev/posts/2318-number-of-distinct-roll-sequences/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2318-number-of-distinct-roll-sequences/Hard | Dynamic Programming, Memoizationhttps://leetcode-solutions-5zk.pages.dev/posts/2321-maximum-score-of-spliced-array/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2321-maximum-score-of-spliced-array/Hard | Array, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/2322-minimum-score-after-removals-on-a-tree/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2322-minimum-score-after-removals-on-a-tree/Hard | Array, Bit Manipulation, Tree, Depth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/2328-number-of-increasing-paths-in-a-grid/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2328-number-of-increasing-paths-in-a-grid/Hard | Array, Dynamic Programming, Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort, Memoization, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/2334-subarray-with-elements-greater-than-varying-threshold/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2334-subarray-with-elements-greater-than-varying-threshold/Hard | Array, Stack, Union-Find, Monotonic Stackhttps://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/2350-shortest-impossible-sequence-of-rolls/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2350-shortest-impossible-sequence-of-rolls/Hard | Array, Hash Table, Greedyhttps://leetcode-solutions-5zk.pages.dev/posts/2354-number-of-excellent-pairs/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2354-number-of-excellent-pairs/Hard | Array, Hash Table, Binary Search, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/2360-longest-cycle-in-a-graph/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2360-longest-cycle-in-a-graph/Hard | Depth-First Search, Breadth-First Search, Graph Theory, Topological Sorthttps://leetcode-solutions-5zk.pages.dev/posts/2366-minimum-replacements-to-sort-the-array/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2366-minimum-replacements-to-sort-the-array/Hard | Array, Math, Greedyhttps://leetcode-solutions-5zk.pages.dev/posts/2376-count-special-integers/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2376-count-special-integers/Hard | Math, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/2382-maximum-segment-sum-after-removals/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2382-maximum-segment-sum-after-removals/Hard | Array, Union-Find, Prefix Sum, Ordered Sethttps://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/2407-longest-increasing-subsequence-ii/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2407-longest-increasing-subsequence-ii/Hard | Array, Divide and Conquer, Dynamic Programming, Binary Indexed Tree, Segment Tree, Queue, Monotonic Queuehttps://leetcode-solutions-5zk.pages.dev/posts/2412-minimum-money-required-before-transactions/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2412-minimum-money-required-before-transactions/Hard | Array, Greedy, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/2416-sum-of-prefix-scores-of-strings/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2416-sum-of-prefix-scores-of-strings/Hard | Array, String, Trie, Countinghttps://leetcode-solutions-5zk.pages.dev/posts/2421-number-of-good-paths/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2421-number-of-good-paths/Hard | Array, Hash Table, Tree, Union-Find, Graph Theory, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/2426-number-of-pairs-satisfying-inequality/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2426-number-of-pairs-satisfying-inequality/Hard | Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Sethttps://leetcode-solutions-5zk.pages.dev/posts/2430-maximum-deletions-on-a-string/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2430-maximum-deletions-on-a-string/Hard | String, Dynamic Programming, Rolling Hash, String Matching, Hash Functionhttps://leetcode-solutions-5zk.pages.dev/posts/2435-paths-in-matrix-whose-sum-is-divisible-by-k/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2435-paths-in-matrix-whose-sum-is-divisible-by-k/Hard | Array, Dynamic Programming, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/2440-create-components-with-same-value/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2440-create-components-with-same-value/Hard | Array, Math, Tree, Depth-First Search, Enumerationhttps://leetcode-solutions-5zk.pages.dev/posts/2444-count-subarrays-with-fixed-bounds/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2444-count-subarrays-with-fixed-bounds/Hard | Array, Queue, Sliding Window, Monotonic Queuehttps://leetcode-solutions-5zk.pages.dev/posts/2448-minimum-cost-to-make-array-equal/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2448-minimum-cost-to-make-array-equal/Hard | Array, Binary Search, Greedy, Sorting, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/2449-minimum-number-of-operations-to-make-arrays-similar/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2449-minimum-number-of-operations-to-make-arrays-similar/Hard | Array, Greedy, Sortinghttps://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/2458-height-of-binary-tree-after-subtree-removal-queries/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2458-height-of-binary-tree-after-subtree-removal-queries/Hard | Array, Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/2463-minimum-total-distance-traveled/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2463-minimum-total-distance-traveled/Hard | Array, Dynamic Programming, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/2468-split-message-based-on-limit/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2468-split-message-based-on-limit/Hard | String, Enumerationhttps://leetcode-solutions-5zk.pages.dev/posts/2472-maximum-number-of-non-overlapping-palindrome-substrings/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2472-maximum-number-of-non-overlapping-palindrome-substrings/Hard | Two Pointers, String, Dynamic Programming, Greedyhttps://leetcode-solutions-5zk.pages.dev/posts/2478-number-of-beautiful-partitions/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2478-number-of-beautiful-partitions/Hard | String, Dynamic Programming, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/2484-count-palindromic-subsequences/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2484-count-palindromic-subsequences/Hard | String, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/2488-count-subarrays-with-median-k/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2488-count-subarrays-with-median-k/Hard | Array, Hash Table, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/2493-divide-nodes-into-the-maximum-number-of-groups/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2493-divide-nodes-into-the-maximum-number-of-groups/Hard | Depth-First Search, Breadth-First Search, Union-Find, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/2499-minimum-total-cost-to-make-arrays-unequal/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2499-minimum-total-cost-to-make-arrays-unequal/Hard | Array, Hash Table, Greedy, Countinghttps://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/2508-add-edges-to-make-degrees-of-all-nodes-even/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2508-add-edges-to-make-degrees-of-all-nodes-even/Hard | Hash Table, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/2509-cycle-length-queries-in-a-tree/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2509-cycle-length-queries-in-a-tree/Hard | Array, Tree, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/2514-count-anagrams/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2514-count-anagrams/Hard | Hash Table, Math, String, Combinatorics, Countinghttps://leetcode-solutions-5zk.pages.dev/posts/2518-number-of-great-partitions/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2518-number-of-great-partitions/Hard | Array, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/2528-maximize-the-minimum-powered-city/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2528-maximize-the-minimum-powered-city/Hard | Array, Binary Search, Greedy, Queue, Sliding Window, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/2538-difference-between-maximum-and-minimum-price-sum/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2538-difference-between-maximum-and-minimum-price-sum/Hard | Array, Dynamic Programming, Tree, Depth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/2543-check-if-point-is-reachable/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2543-check-if-point-is-reachable/Hard | Math, Number Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/2547-minimum-cost-to-split-an-array/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2547-minimum-cost-to-split-an-array/Hard | Array, Hash Table, Dynamic Programming, Countinghttps://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/2552-count-increasing-quadruplets/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2552-count-increasing-quadruplets/Hard | Array, Dynamic Programming, Binary Indexed Tree, Enumeration, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/2561-rearranging-fruits/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2561-rearranging-fruits/Hard | Array, Hash Table, Greedy, Sorthttps://leetcode-solutions-5zk.pages.dev/posts/2565-subsequence-with-the-minimum-score/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2565-subsequence-with-the-minimum-score/Hard | Two Pointers, String, Binary Searchhttps://leetcode-solutions-5zk.pages.dev/posts/2569-handling-sum-queries-after-update/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2569-handling-sum-queries-after-update/Hard | Array, Segment Treehttps://leetcode-solutions-5zk.pages.dev/posts/2573-find-the-string-with-lcp/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2573-find-the-string-with-lcp/Hard | Array, String, Dynamic Programming, Greedy, Union-Find, Matrixhttps://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/2581-count-number-of-possible-root-nodes/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2581-count-number-of-possible-root-nodes/Hard | Array, Hash Table, Dynamic Programming, Tree, Depth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/2584-split-the-array-to-make-coprime-products/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2584-split-the-array-to-make-coprime-products/Hard | Array, Hash Table, Math, Number Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/2585-number-of-ways-to-earn-points/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2585-number-of-ways-to-earn-points/Hard | Array, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/2589-minimum-time-to-complete-all-tasks/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2589-minimum-time-to-complete-all-tasks/Hard | Array, Binary Search, Stack, Greedy, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/2603-collect-coins-in-a-tree/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2603-collect-coins-in-a-tree/Hard | Array, Tree, Graph Theory, Topological Sorthttps://leetcode-solutions-5zk.pages.dev/posts/2608-shortest-cycle-in-a-graph/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2608-shortest-cycle-in-a-graph/Hard | Breadth-First Search, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/2612-minimum-reverse-operations/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2612-minimum-reverse-operations/Hard | Array, Hash Table, Breadth-First Search, Union-Find, Ordered Sethttps://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/1284-minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1284-minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix/Hard | Array, Hash Table, Bit Manipulation, Breadth-First Search, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/1289-minimum-falling-path-sum-ii/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1289-minimum-falling-path-sum-ii/Hard | Array, Dynamic Programming, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/1293-shortest-path-in-a-grid-with-obstacles-elimination/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1293-shortest-path-in-a-grid-with-obstacles-elimination/Hard | Array, Breadth-First Search, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/1298-maximum-candies-you-can-get-from-boxes/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1298-maximum-candies-you-can-get-from-boxes/Hard | Array, Breadth-First Search, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/1307-verbal-arithmetic-puzzle/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1307-verbal-arithmetic-puzzle/Hard | Array, Math, String, Backtrackinghttps://leetcode-solutions-5zk.pages.dev/posts/1326-minimum-number-of-taps-to-open-to-water-a-garden/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1326-minimum-number-of-taps-to-open-to-water-a-garden/Hard | Array, Dynamic Programming, Greedyhttps://leetcode-solutions-5zk.pages.dev/posts/1330-reverse-subarray-to-maximize-array-value/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1330-reverse-subarray-to-maximize-array-value/Hard | Array, Math, Greedyhttps://leetcode-solutions-5zk.pages.dev/posts/1335-minimum-difficulty-of-a-job-schedule/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1335-minimum-difficulty-of-a-job-schedule/Hard | Array, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/1340-jump-game-v/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1340-jump-game-v/Hard | Array, Dynamic Programming, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/1345-jump-game-iv/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1345-jump-game-iv/Hard | Array, Hash Table, Breadth-First Searchhttps://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/1359-count-all-valid-pickup-and-delivery-options/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1359-count-all-valid-pickup-and-delivery-options/Hard | Math, Dynamic Programming, Combinatoricshttps://leetcode-solutions-5zk.pages.dev/posts/1363-largest-multiple-of-three/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1363-largest-multiple-of-three/Hard | Array, Math, Dynamic Programming, Greedy, Sortinghttps://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/1373-maximum-sum-bst-in-binary-tree/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1373-maximum-sum-bst-in-binary-tree/Hard | Dynamic Programming, Tree, Depth-First Search, Binary Search Tree, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/1377-frog-position-after-t-seconds/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1377-frog-position-after-t-seconds/Hard | Tree, Depth-First Search, Breadth-First Search, Graph Theoryhttps://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/1392-longest-happy-prefix/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1392-longest-happy-prefix/Hard | String, Rolling Hash, String Matching, Hash Functionhttps://leetcode-solutions-5zk.pages.dev/posts/1397-find-all-good-strings/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1397-find-all-good-strings/Hard | String, Dynamic Programming, String Matchinghttps://leetcode-solutions-5zk.pages.dev/posts/1402-reducing-dishes/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1402-reducing-dishes/Hard | Array, Dynamic Programming, Greedy, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/1406-stone-game-iii/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1406-stone-game-iii/Hard | Array, Math, Dynamic Programming, Game Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/1411-number-of-ways-to-paint-n-3-grid/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1411-number-of-ways-to-paint-n-3-grid/Hard | Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/1416-restore-the-array/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1416-restore-the-array/Hard | String, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/1420-build-array-where-you-can-find-the-maximum-exactly-k-comparisons/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1420-build-array-where-you-can-find-the-maximum-exactly-k-comparisons/Hard | Dynamic Programming, Prefix Sumhttps://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/1434-number-of-ways-to-wear-different-hats-to-each-other/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1434-number-of-ways-to-wear-different-hats-to-each-other/Hard | Array, Dynamic Programming, Bit Manipulation, Bitmaskhttps://leetcode-solutions-5zk.pages.dev/posts/1449-form-largest-integer-with-digits-that-add-up-to-target/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1449-form-largest-integer-with-digits-that-add-up-to-target/Hard | Array, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/1453-maximum-number-of-darts-inside-of-a-circular-dartboard/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1453-maximum-number-of-darts-inside-of-a-circular-dartboard/Hard | Array, Math, Geometryhttps://leetcode-solutions-5zk.pages.dev/posts/1458-max-dot-product-of-two-subsequences/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1458-max-dot-product-of-two-subsequences/Hard | Array, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/1463-cherry-pickup-ii/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1463-cherry-pickup-ii/Hard | Array, Dynamic Programming, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/1467-probability-of-a-two-boxes-having-the-same-number-of-distinct-balls/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1467-probability-of-a-two-boxes-having-the-same-number-of-distinct-balls/Hard | Array, Math, Dynamic Programming, Backtracking, Combinatorics, Probability and Statisticshttps://leetcode-solutions-5zk.pages.dev/posts/1478-allocate-mailboxes/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1478-allocate-mailboxes/Hard | Array, Math, Dynamic Programming, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/1494-parallel-courses-ii/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1494-parallel-courses-ii/Hard | Dynamic Programming, Bit Manipulation, Graph Theory, Bitmaskhttps://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/1510-stone-game-iv/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1510-stone-game-iv/Hard | Math, Dynamic Programming, Game Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/1515-best-position-for-a-service-centre/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1515-best-position-for-a-service-centre/Hard | Array, Math, Geometry, Randomizedhttps://leetcode-solutions-5zk.pages.dev/posts/1520-maximum-number-of-non-overlapping-substrings/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1520-maximum-number-of-non-overlapping-substrings/Hard | Hash Table, String, Greedy, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/1521-find-a-value-of-a-mysterious-function-closest-to-target/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1521-find-a-value-of-a-mysterious-function-closest-to-target/Hard | Array, Binary Search, Bit Manipulation, Segment Treehttps://leetcode-solutions-5zk.pages.dev/posts/1526-minimum-number-of-increments-on-subarrays-to-form-a-target-array/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1526-minimum-number-of-increments-on-subarrays-to-form-a-target-array/Hard | Array, Dynamic Programming, Stack, Greedy, Monotonic Stackhttps://leetcode-solutions-5zk.pages.dev/posts/1531-string-compression-ii/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1531-string-compression-ii/Hard | String, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/1537-get-the-maximum-score/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1537-get-the-maximum-score/Hard | Array, Two Pointers, Dynamic Programming, Greedyhttps://leetcode-solutions-5zk.pages.dev/posts/1542-find-longest-awesome-substring/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1542-find-longest-awesome-substring/Hard | Hash Table, String, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/1547-minimum-cost-to-cut-a-stick/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1547-minimum-cost-to-cut-a-stick/Hard | Array, Dynamic Programming, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/1553-minimum-number-of-days-to-eat-n-oranges/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1553-minimum-number-of-days-to-eat-n-oranges/Hard | Dynamic Programming, Memoizationhttps://leetcode-solutions-5zk.pages.dev/posts/1563-stone-game-v/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1563-stone-game-v/Hard | Array, Math, Dynamic Programming, Game Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/1569-number-of-ways-to-reorder-array-to-get-same-bst/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1569-number-of-ways-to-reorder-array-to-get-same-bst/Hard | Array, Math, Divide and Conquer, Dynamic Programming, Tree, Union-Find, Binary Search Tree, Memoization, Combinatorics, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/1575-count-all-possible-routes/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1575-count-all-possible-routes/Hard | Array, Dynamic Programming, Memoizationhttps://leetcode-solutions-5zk.pages.dev/posts/1585-check-if-string-is-transformable-with-substring-sort-operations/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1585-check-if-string-is-transformable-with-substring-sort-operations/Hard | String, Greedy, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/1591-strange-printer-ii/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1591-strange-printer-ii/Hard | Array, Graph Theory, Topological Sort, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/1601-maximum-number-of-achievable-transfer-requests/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1601-maximum-number-of-achievable-transfer-requests/Hard | Array, Backtracking, Bit Manipulation, Enumerationhttps://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/1610-maximum-number-of-visible-points/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1610-maximum-number-of-visible-points/Hard | Array, Math, Geometry, Sliding Window, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/1611-minimum-one-bit-operations-to-make-integers-zero/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1611-minimum-one-bit-operations-to-make-integers-zero/Hard | Math, Dynamic Programming, Bit Manipulation, Recursion, Memoizationhttps://leetcode-solutions-5zk.pages.dev/posts/1617-count-subtrees-with-max-distance-between-cities/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1617-count-subtrees-with-max-distance-between-cities/Hard | Dynamic Programming, Bit Manipulation, Tree, Enumeration, Bitmaskhttps://leetcode-solutions-5zk.pages.dev/posts/1622-fancy-sequence/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1622-fancy-sequence/Hard | Math, Design, Segment Tree, Number Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/1627-graph-connectivity-with-threshold/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1627-graph-connectivity-with-threshold/Hard | Array, Math, Union-Find, Number Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/1632-rank-transform-of-a-matrix/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1632-rank-transform-of-a-matrix/Hard | Array, Union-Find, Graph Theory, Topological Sort, Sorting, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/1639-number-of-ways-to-form-a-target-string-given-a-dictionary/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1639-number-of-ways-to-form-a-target-string-given-a-dictionary/Hard | Array, String, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/1643-kth-smallest-instructions/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1643-kth-smallest-instructions/Hard | Array, Math, Dynamic Programming, Combinatoricshttps://leetcode-solutions-5zk.pages.dev/posts/1649-create-sorted-array-through-instructions/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1649-create-sorted-array-through-instructions/Hard | Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Sethttps://leetcode-solutions-5zk.pages.dev/posts/1655-distribute-repeating-integers/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1655-distribute-repeating-integers/Hard | Array, Hash Table, Dynamic Programming, Backtracking, Bit Manipulation, Counting, Bitmaskhttps://leetcode-solutions-5zk.pages.dev/posts/1665-minimum-initial-energy-to-finish-tasks/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1665-minimum-initial-energy-to-finish-tasks/Hard | Array, Greedy, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/1671-minimum-number-of-removals-to-make-mountain-array/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1671-minimum-number-of-removals-to-make-mountain-array/Hard | Array, Binary Search, Dynamic Programming, Greedyhttps://leetcode-solutions-5zk.pages.dev/posts/1681-minimum-incompatibility/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1681-minimum-incompatibility/Hard | Array, Hash Table, Dynamic Programming, Bit Manipulation, Bitmaskhttps://leetcode-solutions-5zk.pages.dev/posts/1691-maximum-height-by-stacking-cuboids/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1691-maximum-height-by-stacking-cuboids/Hard | Array, Dynamic Programming, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/1697-checking-existence-of-edge-length-limited-paths/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1697-checking-existence-of-edge-length-limited-paths/Hard | Array, Two Pointers, Union-Find, Graph Theory, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/1703-minimum-adjacent-swaps-for-k-consecutive-ones/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1703-minimum-adjacent-swaps-for-k-consecutive-ones/Hard | Array, Greedy, Sliding Window, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/1707-maximum-xor-with-an-element-from-array/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1707-maximum-xor-with-an-element-from-array/Hard | Array, Bit Manipulation, Triehttps://leetcode-solutions-5zk.pages.dev/posts/1713-minimum-operations-to-make-a-subsequence/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1713-minimum-operations-to-make-a-subsequence/Hard | Array, Hash Table, Binary Search, Greedyhttps://leetcode-solutions-5zk.pages.dev/posts/1723-find-minimum-time-to-finish-all-jobs/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1723-find-minimum-time-to-finish-all-jobs/Hard | Array, Dynamic Programming, Backtracking, Bit Manipulation, Bitmaskhttps://leetcode-solutions-5zk.pages.dev/posts/1735-count-ways-to-make-array-with-product/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1735-count-ways-to-make-array-with-product/Hard | Array, Math, Dynamic Programming, Combinatorics, Number Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/1739-building-boxes/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1739-building-boxes/Hard | Math, Binary Search, Greedyhttps://leetcode-solutions-5zk.pages.dev/posts/1745-palindrome-partitioning-iv/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1745-palindrome-partitioning-iv/Hard | String, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/1751-maximum-number-of-events-that-can-be-attended-ii/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1751-maximum-number-of-events-that-can-be-attended-ii/Hard | Array, Binary Search, Dynamic Programming, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/1755-closest-subsequence-sum/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1755-closest-subsequence-sum/Hard | Array, Two Pointers, Dynamic Programming, Bit Manipulation, Sorting, Bitmaskhttps://leetcode-solutions-5zk.pages.dev/posts/1761-minimum-degree-of-a-connected-trio-in-a-graph/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1761-minimum-degree-of-a-connected-trio-in-a-graph/Hard | Graph Theory, Enumerationhttps://leetcode-solutions-5zk.pages.dev/posts/1766-tree-of-coprimes/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1766-tree-of-coprimes/Hard | Array, Math, Tree, Depth-First Search, Number Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/1782-count-pairs-of-nodes/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1782-count-pairs-of-nodes/Hard | Array, Hash Table, Two Pointers, Binary Search, Graph Theory, Sorting, Countinghttps://leetcode-solutions-5zk.pages.dev/posts/1793-maximum-score-of-a-good-subarray/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1793-maximum-score-of-a-good-subarray/Hard | Array, Two Pointers, Binary Search, Stack, Monotonic Stackhttps://leetcode-solutions-5zk.pages.dev/posts/1799-maximize-score-after-n-operations/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1799-maximize-score-after-n-operations/Hard | Array, Math, Dynamic Programming, Backtracking, Bit Manipulation, Number Theory, Bitmaskhttps://leetcode-solutions-5zk.pages.dev/posts/1808-maximize-number-of-nice-divisors/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1808-maximize-number-of-nice-divisors/Hard | Math, Recursion, Number Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/1815-maximum-number-of-groups-getting-fresh-donuts/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1815-maximum-number-of-groups-getting-fresh-donuts/Hard | Array, Dynamic Programming, Bit Manipulation, Memoization, Bitmaskhttps://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/1830-minimum-number-of-operations-to-make-string-sorted/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1830-minimum-number-of-operations-to-make-string-sorted/Hard | Hash Table, Math, String, Combinatorics, Countinghttps://leetcode-solutions-5zk.pages.dev/posts/1835-find-xor-sum-of-all-pairs-bitwise-and/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1835-find-xor-sum-of-all-pairs-bitwise-and/Hard | Array, Math, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/1840-maximum-building-height/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1840-maximum-building-height/Hard | Array, Math, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/1847-closest-room/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1847-closest-room/Hard | Array, Binary Search, Sorting, Ordered Sethttps://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/1857-largest-color-value-in-a-directed-graph/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1857-largest-color-value-in-a-directed-graph/Hard | Hash Table, String, Dynamic Programming, Graph Theory, Topological Sort, Memoization, Countinghttps://leetcode-solutions-5zk.pages.dev/posts/1862-sum-of-floored-pairs/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1862-sum-of-floored-pairs/Hard | Array, Math, Binary Search, Counting, Enumeration, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/1866-number-of-ways-to-rearrange-sticks-with-k-sticks-visible/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1866-number-of-ways-to-rearrange-sticks-with-k-sticks-visible/Hard | Math, Dynamic Programming, Combinatoricshttps://leetcode-solutions-5zk.pages.dev/posts/1872-stone-game-viii/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1872-stone-game-viii/Hard | Array, Math, Dynamic Programming, Prefix Sum, Game Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/1879-minimum-xor-sum-of-two-arrays/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1879-minimum-xor-sum-of-two-arrays/Hard | Array, Dynamic Programming, Bit Manipulation, Bitmaskhttps://leetcode-solutions-5zk.pages.dev/posts/1889-minimum-space-wasted-from-packaging/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1889-minimum-space-wasted-from-packaging/Hard | Array, Binary Search, Sorting, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/1900-the-earliest-and-latest-rounds-where-players-compete/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1900-the-earliest-and-latest-rounds-where-players-compete/Hard | Dynamic Programming, Memoizationhttps://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/1923-longest-common-subpath/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1923-longest-common-subpath/Hard | Array, Binary Search, Rolling Hash, Suffix Array, Hash Functionhttps://leetcode-solutions-5zk.pages.dev/posts/1928-minimum-cost-to-reach-destination-in-time/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1928-minimum-cost-to-reach-destination-in-time/Hard | Array, Dynamic Programming, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/1931-painting-a-grid-with-three-different-colors/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1931-painting-a-grid-with-three-different-colors/Hard | Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/1932-merge-bsts-to-create-single-bst/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1932-merge-bsts-to-create-single-bst/Hard | Array, Hash Table, Tree, Depth-First Search, Binary Search Tree, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/1938-maximum-genetic-difference-query/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1938-maximum-genetic-difference-query/Hard | Array, Hash Table, Bit Manipulation, Depth-First Search, Triehttps://leetcode-solutions-5zk.pages.dev/posts/1944-number-of-visible-people-in-a-queue/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1944-number-of-visible-people-in-a-queue/Hard | Array, Stack, Monotonic Stackhttps://leetcode-solutions-5zk.pages.dev/posts/1948-delete-duplicate-folders-in-system/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1948-delete-duplicate-folders-in-system/Hard | Array, Hash Table, String, Trie, Hash Functionhttps://leetcode-solutions-5zk.pages.dev/posts/1955-count-number-of-special-subsequences/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1955-count-number-of-special-subsequences/Hard | Array, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/1960-maximum-product-of-the-length-of-two-palindromic-substrings/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1960-maximum-product-of-the-length-of-two-palindromic-substrings/Hard | Two Pointers, String, Rolling Hash, Hash Functionhttps://leetcode-solutions-5zk.pages.dev/posts/1964-find-the-longest-valid-obstacle-course-at-each-position/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1964-find-the-longest-valid-obstacle-course-at-each-position/Hard | Array, Binary Search, Binary Indexed Treehttps://leetcode-solutions-5zk.pages.dev/posts/1970-last-day-where-you-can-still-cross/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1970-last-day-where-you-can-still-cross/Hard | Array, Binary Search, Depth-First Search, Breadth-First Search, Union-Find, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/1977-number-of-ways-to-separate-numbers/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1977-number-of-ways-to-separate-numbers/Hard | String, Dynamic Programming, Suffix Arrayhttps://leetcode-solutions-5zk.pages.dev/posts/1982-find-array-given-subset-sums/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1982-find-array-given-subset-sums/Hard | Array, Hash Table, Sorting, Countinghttps://leetcode-solutions-5zk.pages.dev/posts/1987-number-of-unique-good-subsequences/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1987-number-of-unique-good-subsequences/Hard | String, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/1998-gcd-sort-of-an-array/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1998-gcd-sort-of-an-array/Hard | Array, Math, Union-Find, Sorting, Number Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/1000-minimum-cost-to-merge-stones/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1000-minimum-cost-to-merge-stones/Hard | Array, Dynamic Programming, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/1001-grid-illumination/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1001-grid-illumination/Hard | Array, Hash Tablehttps://leetcode-solutions-5zk.pages.dev/posts/1012-numbers-with-repeated-digits/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1012-numbers-with-repeated-digits/Hard | Math, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/1028-recover-a-tree-from-preorder-traversal/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1028-recover-a-tree-from-preorder-traversal/Hard | String, Tree, Depth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/1032-stream-of-characters/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1032-stream-of-characters/Hard | Array, String, Design, Trie, Data Streamhttps://leetcode-solutions-5zk.pages.dev/posts/1036-escape-a-large-maze/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1036-escape-a-large-maze/Hard | Array, Hash Table, Depth-First Search, Breadth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/1044-longest-duplicate-substring/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1044-longest-duplicate-substring/Hard | String, Binary Search, Sliding Window, Rolling Hash, Suffix Array, Hash Functionhttps://leetcode-solutions-5zk.pages.dev/posts/1074-number-of-submatrices-that-sum-to-target/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1074-number-of-submatrices-that-sum-to-target/Hard | Array, Hash Table, Matrix, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/1095-find-in-mountain-array/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1095-find-in-mountain-array/Hard | Array, Binary Search, Interactivehttps://leetcode-solutions-5zk.pages.dev/posts/1096-brace-expansion-ii/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1096-brace-expansion-ii/Hard | Hash Table, String, Backtracking, Stack, Breadth-First Search, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/1106-parsing-a-boolean-expression/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1106-parsing-a-boolean-expression/Hard | String, Stack, Recursionhttps://leetcode-solutions-5zk.pages.dev/posts/1125-smallest-sufficient-team/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1125-smallest-sufficient-team/Hard | Array, Dynamic Programming, Bit Manipulation, Bitmaskhttps://leetcode-solutions-5zk.pages.dev/posts/1147-longest-chunked-palindrome-decomposition/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1147-longest-chunked-palindrome-decomposition/Hard | Two Pointers, String, Dynamic Programming, Greedy, Rolling Hash, Hash Functionhttps://leetcode-solutions-5zk.pages.dev/posts/1157-online-majority-element-in-subarray/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1157-online-majority-element-in-subarray/Hard | Array, Binary Search, Design, Binary Indexed Tree, Segment Treehttps://leetcode-solutions-5zk.pages.dev/posts/1163-last-substring-in-lexicographical-order/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1163-last-substring-in-lexicographical-order/Hard | Two Pointers, Stringhttps://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/1178-number-of-valid-words-for-each-puzzle/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1178-number-of-valid-words-for-each-puzzle/Hard | Array, Hash Table, String, Bit Manipulation, Triehttps://leetcode-solutions-5zk.pages.dev/posts/1187-make-array-strictly-increasing/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1187-make-array-strictly-increasing/Hard | Array, Binary Search, Dynamic Programming, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/1203-sort-items-by-groups-respecting-dependencies/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1203-sort-items-by-groups-respecting-dependencies/Hard | Depth-First Search, Breadth-First Search, Graph Theory, Topological Sorthttps://leetcode-solutions-5zk.pages.dev/posts/1206-design-skiplist/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1206-design-skiplist/Hard | Linked List, Designhttps://leetcode-solutions-5zk.pages.dev/posts/1210-minimum-moves-to-reach-target-with-rotations/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1210-minimum-moves-to-reach-target-with-rotations/Hard | Array, Breadth-First Search, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/1220-count-vowels-permutation/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1220-count-vowels-permutation/Hard | Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/1235-maximum-profit-in-job-scheduling/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1235-maximum-profit-in-job-scheduling/Hard | Array, Binary Search, Dynamic Programming, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/1240-tiling-a-rectangle-with-the-fewest-squares/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1240-tiling-a-rectangle-with-the-fewest-squares/Hard | Backtrackinghttps://leetcode-solutions-5zk.pages.dev/posts/1250-check-if-it-is-a-good-array/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1250-check-if-it-is-a-good-array/Hard | Array, Math, Number Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/1255-maximum-score-words-formed-by-letters/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1255-maximum-score-words-formed-by-letters/Hard | Array, Hash Table, String, Dynamic Programming, Backtracking, Bit Manipulation, Counting, Bitmaskhttps://leetcode-solutions-5zk.pages.dev/posts/1269-number-of-ways-to-stay-in-the-same-place-after-some-steps/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1269-number-of-ways-to-stay-in-the-same-place-after-some-steps/Hard | Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/1278-palindrome-partitioning-iii/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1278-palindrome-partitioning-iii/Hard | String, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/0726-number-of-atoms/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0726-number-of-atoms/Hard | Hash Table, String, Stack, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/0732-my-calendar-iii/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0732-my-calendar-iii/Hard | Binary Search, Design, Segment Tree, Prefix Sum, Ordered Sethttps://leetcode-solutions-5zk.pages.dev/posts/0741-cherry-pickup/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0741-cherry-pickup/Hard | Array, Dynamic Programming, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/0753-cracking-the-safe/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0753-cracking-the-safe/Hard | String, Depth-First Search, Graph Theory, Eulerian Circuithttps://leetcode-solutions-5zk.pages.dev/posts/0757-set-intersection-size-at-least-two/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0757-set-intersection-size-at-least-two/Hard | Array, Greedy, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/0761-special-binary-string/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0761-special-binary-string/Hard | String, Divide and Conquer, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/0765-couples-holding-hands/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0765-couples-holding-hands/Hard | Greedy, Depth-First Search, Breadth-First Search, Union-Find, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/0768-max-chunks-to-make-sorted-ii/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0768-max-chunks-to-make-sorted-ii/Hard | Array, Stack, Greedy, Sorting, Monotonic Stackhttps://leetcode-solutions-5zk.pages.dev/posts/0773-sliding-puzzle/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0773-sliding-puzzle/Hard | Array, Dynamic Programming, Backtracking, Breadth-First Search, Memoization, Matrixhttps://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/0780-reaching-points/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0780-reaching-points/Hard | Mathhttps://leetcode-solutions-5zk.pages.dev/posts/0782-transform-to-chessboard/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0782-transform-to-chessboard/Hard | Array, Math, Bit Manipulation, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/0793-preimage-size-of-factorial-zeroes-function/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0793-preimage-size-of-factorial-zeroes-function/Hard | Math, Binary Searchhttps://leetcode-solutions-5zk.pages.dev/posts/0798-smallest-rotation-with-highest-score/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0798-smallest-rotation-with-highest-score/Hard | Array, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/0801-minimum-swaps-to-make-sequences-increasing/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0801-minimum-swaps-to-make-sequences-increasing/Hard | Array, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/0803-bricks-falling-when-hit/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0803-bricks-falling-when-hit/Hard | Array, Union-Find, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/0805-split-array-with-same-average/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0805-split-array-with-same-average/Hard | Array, Hash Table, Math, Dynamic Programming, Bit Manipulation, Bitmaskhttps://leetcode-solutions-5zk.pages.dev/posts/0810-chalkboard-xor-game/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0810-chalkboard-xor-game/Hard | Array, Math, Bit Manipulation, Brainteaser, Game Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/0815-bus-routes/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0815-bus-routes/Hard | Array, Hash Table, Breadth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/0818-race-car/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0818-race-car/Hard | Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/0828-count-unique-characters-of-all-substrings-of-a-given-string/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0828-count-unique-characters-of-all-substrings-of-a-given-string/Hard | Hash Table, String, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/0829-consecutive-numbers-sum/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0829-consecutive-numbers-sum/Hard | Math, Enumerationhttps://leetcode-solutions-5zk.pages.dev/posts/0834-sum-of-distances-in-tree/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0834-sum-of-distances-in-tree/Hard | Dynamic Programming, Tree, Depth-First Search, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/0847-shortest-path-visiting-all-nodes/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0847-shortest-path-visiting-all-nodes/Hard | Dynamic Programming, Bit Manipulation, Breadth-First Search, Graph Theory, Bitmaskhttps://leetcode-solutions-5zk.pages.dev/posts/0850-rectangle-area-ii/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0850-rectangle-area-ii/Hard | Array, Segment Tree, Sweep Line, Ordered Sethttps://leetcode-solutions-5zk.pages.dev/posts/0854-k-similar-strings/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0854-k-similar-strings/Hard | Hash Table, String, Breadth-First Searchhttps://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/0878-nth-magical-number/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0878-nth-magical-number/Hard | Math, Binary Searchhttps://leetcode-solutions-5zk.pages.dev/posts/0879-profitable-schemes/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0879-profitable-schemes/Hard | Array, Dynamic Programminghttps://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/0887-super-egg-drop/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0887-super-egg-drop/Hard | Math, Binary Search, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/0891-sum-of-subsequence-widths/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0891-sum-of-subsequence-widths/Hard | Array, Math, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/0895-maximum-frequency-stack/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0895-maximum-frequency-stack/Hard | Hash Table, Stack, Design, Ordered Sethttps://leetcode-solutions-5zk.pages.dev/posts/0899-orderly-queue/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0899-orderly-queue/Hard | Math, String, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/0902-numbers-at-most-n-given-digit-set/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0902-numbers-at-most-n-given-digit-set/Hard | Array, Math, String, Binary Search, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/0903-valid-permutations-for-di-sequence/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0903-valid-permutations-for-di-sequence/Hard | String, Dynamic Programming, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/0906-super-palindromes/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0906-super-palindromes/Hard | Math, String, Enumerationhttps://leetcode-solutions-5zk.pages.dev/posts/0920-number-of-music-playlists/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0920-number-of-music-playlists/Hard | Math, Dynamic Programming, Combinatoricshttps://leetcode-solutions-5zk.pages.dev/posts/0924-minimize-malware-spread/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0924-minimize-malware-spread/Hard | Array, Hash Table, Depth-First Search, Breadth-First Search, Union-Find, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/0927-three-equal-parts/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0927-three-equal-parts/Hard | Array, Mathhttps://leetcode-solutions-5zk.pages.dev/posts/0928-minimize-malware-spread-ii/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0928-minimize-malware-spread-ii/Hard | Array, Hash Table, Depth-First Search, Breadth-First Search, Union-Find, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/0936-stamping-the-sequence/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0936-stamping-the-sequence/Hard | String, Stack, Greedy, Queuehttps://leetcode-solutions-5zk.pages.dev/posts/0940-distinct-subsequences-ii/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0940-distinct-subsequences-ii/Hard | String, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/0952-largest-component-size-by-common-factor/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0952-largest-component-size-by-common-factor/Hard | Array, Hash Table, Math, Union-Find, Number Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/0956-tallest-billboard/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0956-tallest-billboard/Hard | Array, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/0960-delete-columns-to-make-sorted-iii/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0960-delete-columns-to-make-sorted-iii/Hard | Array, String, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/0964-least-operators-to-express-number/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0964-least-operators-to-express-number/Hard | Math, Dynamic Programming, Memoizationhttps://leetcode-solutions-5zk.pages.dev/posts/0968-binary-tree-cameras/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0968-binary-tree-cameras/Hard | Dynamic Programming, Tree, Depth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0972-equal-rational-numbers/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0972-equal-rational-numbers/Hard | Math, Stringhttps://leetcode-solutions-5zk.pages.dev/posts/0975-odd-even-jump/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0975-odd-even-jump/Hard | Array, Dynamic Programming, Stack, Sorting, Monotonic Stack, Ordered Sethttps://leetcode-solutions-5zk.pages.dev/posts/0987-vertical-order-traversal-of-a-binary-tree/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0987-vertical-order-traversal-of-a-binary-tree/Hard | Hash Table, Tree, Depth-First Search, Breadth-First Search, Sorting, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0992-subarrays-with-k-different-integers/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0992-subarrays-with-k-different-integers/Hard | Array, Hash Table, Sliding Window, Countinghttps://leetcode-solutions-5zk.pages.dev/posts/0995-minimum-number-of-k-consecutive-bit-flips/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0995-minimum-number-of-k-consecutive-bit-flips/Hard | Array, Bit Manipulation, Queue, Sliding Window, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/0493-reverse-pairs/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0493-reverse-pairs/Hard | Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Sethttps://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/0517-super-washing-machines/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0517-super-washing-machines/Hard | Array, Greedyhttps://leetcode-solutions-5zk.pages.dev/posts/0546-remove-boxes/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0546-remove-boxes/Hard | Array, Dynamic Programming, Memoizationhttps://leetcode-solutions-5zk.pages.dev/posts/0564-find-the-closest-palindrome/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0564-find-the-closest-palindrome/Hard | Math, Stringhttps://leetcode-solutions-5zk.pages.dev/posts/0591-tag-validator/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0591-tag-validator/Hard | String, Stackhttps://leetcode-solutions-5zk.pages.dev/posts/0600-non-negative-integers-without-consecutive-ones/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0600-non-negative-integers-without-consecutive-ones/Hard | Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/0629-k-inverse-pairs-array/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0629-k-inverse-pairs-array/Hard | Dynamic Programminghttps://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/0639-decode-ways-ii/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0639-decode-ways-ii/Hard | String, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/0664-strange-printer/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0664-strange-printer/Hard | String, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/0668-kth-smallest-number-in-multiplication-table/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0668-kth-smallest-number-in-multiplication-table/Hard | Math, Binary Searchhttps://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/0679-24-game/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0679-24-game/Hard | Array, Math, Backtrackinghttps://leetcode-solutions-5zk.pages.dev/posts/0685-redundant-connection-ii/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0685-redundant-connection-ii/Hard | Depth-First Search, Breadth-First Search, Union-Find, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/0689-maximum-sum-of-3-non-overlapping-subarrays/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0689-maximum-sum-of-3-non-overlapping-subarrays/Hard | Array, Dynamic Programming, Sliding Window, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/0691-stickers-to-spell-word/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0691-stickers-to-spell-word/Hard | Array, Hash Table, String, Dynamic Programming, Backtracking, Bit Manipulation, Memoization, Bitmaskhttps://leetcode-solutions-5zk.pages.dev/posts/0699-falling-squares/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0699-falling-squares/Hard | Array, Segment Tree, Ordered Sethttps://leetcode-solutions-5zk.pages.dev/posts/0710-random-pick-with-blacklist/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0710-random-pick-with-blacklist/Hard | Array, Hash Table, Math, Binary Search, Sorting, Randomizedhttps://leetcode-solutions-5zk.pages.dev/posts/0715-range-module/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0715-range-module/Hard | Design, Segment Tree, Ordered Sethttps://leetcode-solutions-5zk.pages.dev/posts/0719-find-k-th-smallest-pair-distance/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0719-find-k-th-smallest-pair-distance/Hard | Array, Two Pointers, Binary Search, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/0321-create-maximum-number/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0321-create-maximum-number/Hard | Array, Two Pointers, Stack, Greedy, Monotonic Stackhttps://leetcode-solutions-5zk.pages.dev/posts/0327-count-of-range-sum/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0327-count-of-range-sum/Hard | Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Sethttps://leetcode-solutions-5zk.pages.dev/posts/0329-longest-increasing-path-in-a-matrix/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0329-longest-increasing-path-in-a-matrix/Hard | Array, Dynamic Programming, Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort, Memoization, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/0330-patching-array/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0330-patching-array/Hard | Array, Greedyhttps://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/0336-palindrome-pairs/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0336-palindrome-pairs/Hard | Array, Hash Table, String, Trie, Hash Functionhttps://leetcode-solutions-5zk.pages.dev/posts/0352-data-stream-as-disjoint-intervals/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0352-data-stream-as-disjoint-intervals/Hard | Hash Table, Binary Search, Union-Find, Design, Data Stream, Ordered Sethttps://leetcode-solutions-5zk.pages.dev/posts/0381-insert-delete-getrandom-o1-duplicates-allowed/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0381-insert-delete-getrandom-o1-duplicates-allowed/Hard | Array, Hash Table, Math, Design, Randomizedhttps://leetcode-solutions-5zk.pages.dev/posts/0391-perfect-rectangle/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0391-perfect-rectangle/Hard | Array, Hash Table, Math, Geometry, Sweep Linehttps://leetcode-solutions-5zk.pages.dev/posts/0403-frog-jump/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0403-frog-jump/Hard | Array, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/0410-split-array-largest-sum/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0410-split-array-largest-sum/Hard | Array, Binary Search, Dynamic Programming, Greedy, Prefix Sumhttps://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/0432-all-oone-data-structure/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0432-all-oone-data-structure/Hard | Hash Table, Linked List, Design, Doubly-Linked Listhttps://leetcode-solutions-5zk.pages.dev/posts/0440-k-th-smallest-in-lexicographical-order/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0440-k-th-smallest-in-lexicographical-order/Hard | Triehttps://leetcode-solutions-5zk.pages.dev/posts/0446-arithmetic-slices-ii-subsequence/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0446-arithmetic-slices-ii-subsequence/Hard | Array, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/0458-poor-pigs/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0458-poor-pigs/Hard | Math, Dynamic Programming, Combinatoricshttps://leetcode-solutions-5zk.pages.dev/posts/0460-lfu-cache/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0460-lfu-cache/Hard | Hash Table, Linked List, Design, Doubly-Linked Listhttps://leetcode-solutions-5zk.pages.dev/posts/0466-count-the-repetitions/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0466-count-the-repetitions/Hard | Two Pointers, String, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/0479-largest-palindrome-product/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0479-largest-palindrome-product/Hard | Math, Enumerationhttps://leetcode-solutions-5zk.pages.dev/posts/0010-regular-expression-matching/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0010-regular-expression-matching/Hard | String, Dynamic Programming, Recursionhttps://leetcode-solutions-5zk.pages.dev/posts/0123-best-time-to-buy-and-sell-stock-iii/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0123-best-time-to-buy-and-sell-stock-iii/Hard | Array, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/0124-binary-tree-maximum-path-sum/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0124-binary-tree-maximum-path-sum/Hard | Dynamic Programming, Tree, Depth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0135-candy/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0135-candy/Hard | Array, Greedyhttps://leetcode-solutions-5zk.pages.dev/posts/0140-word-break-ii/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0140-word-break-ii/Hard | Array, Hash Table, String, Dynamic Programming, Backtracking, Trie, Memoizationhttps://leetcode-solutions-5zk.pages.dev/posts/0149-max-points-on-a-line/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0149-max-points-on-a-line/Hard | Array, Hash Table, Math, Geometryhttps://leetcode-solutions-5zk.pages.dev/posts/0154-find-minimum-in-rotated-sorted-array-ii/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0154-find-minimum-in-rotated-sorted-array-ii/Hard | Array, Binary Searchhttps://leetcode-solutions-5zk.pages.dev/posts/0174-dungeon-game/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0174-dungeon-game/Hard | Array, Dynamic Programming, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/0188-best-time-to-buy-and-sell-stock-iv/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0188-best-time-to-buy-and-sell-stock-iv/Hard | Array, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/0212-word-search-ii/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0212-word-search-ii/Hard | Array, String, Backtracking, Trie, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/0214-shortest-palindrome/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0214-shortest-palindrome/Hard | String, Rolling Hash, String Matching, Hash Functionhttps://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/0220-contains-duplicate-iii/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0220-contains-duplicate-iii/Hard | Array, Sliding Window, Sorting, Bucket Sort, Ordered Sethttps://leetcode-solutions-5zk.pages.dev/posts/0224-basic-calculator/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0224-basic-calculator/Hard | Math, String, Stack, Recursionhttps://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/0233-number-of-digit-one/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0233-number-of-digit-one/Hard | Math, Dynamic Programming, Recursionhttps://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/0025-reverse-nodes-in-k-group/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0025-reverse-nodes-in-k-group/Hard | Linked List, Recursionhttps://leetcode-solutions-5zk.pages.dev/posts/0273-integer-to-english-words/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0273-integer-to-english-words/Hard | Math, String, Recursionhttps://leetcode-solutions-5zk.pages.dev/posts/0282-expression-add-operators/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0282-expression-add-operators/Hard | Math, String, Backtrackinghttps://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 Streamhttps://leetcode-solutions-5zk.pages.dev/posts/0297-serialize-and-deserialize-binary-tree/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0297-serialize-and-deserialize-binary-tree/Hard | String, Tree, Depth-First Search, Breadth-First Search, Design, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0030-substring-with-concatenation-of-all-words/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0030-substring-with-concatenation-of-all-words/Hard | Hash Table, String, Sliding Windowhttps://leetcode-solutions-5zk.pages.dev/posts/0301-remove-invalid-parentheses/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0301-remove-invalid-parentheses/Hard | String, Backtracking, Breadth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/0312-burst-balloons/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0312-burst-balloons/Hard | Array, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/0315-count-of-smaller-numbers-after-self/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0315-count-of-smaller-numbers-after-self/Hard | Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Sethttps://leetcode-solutions-5zk.pages.dev/posts/0032-longest-valid-parentheses/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0032-longest-valid-parentheses/Hard | String, Dynamic Programming, Stackhttps://leetcode-solutions-5zk.pages.dev/posts/0004-median-of-two-sorted-arrays/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0004-median-of-two-sorted-arrays/Hard | Array, Binary Search, Divide and Conquerhttps://leetcode-solutions-5zk.pages.dev/posts/0041-first-missing-positive/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0041-first-missing-positive/Hard | Array, Hash Tablehttps://leetcode-solutions-5zk.pages.dev/posts/0042-trapping-rain-water/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0042-trapping-rain-water/Hard | Array, Two Pointers, Dynamic Programming, Stack, Monotonic Stackhttps://leetcode-solutions-5zk.pages.dev/posts/0044-wildcard-matching/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0044-wildcard-matching/Hard | String, Dynamic Programming, Greedy, Recursionhttps://leetcode-solutions-5zk.pages.dev/posts/0051-n-queens/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0051-n-queens/Hard | Array, Backtrackinghttps://leetcode-solutions-5zk.pages.dev/posts/0052-n-queens-ii/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0052-n-queens-ii/Hard | Backtrackinghttps://leetcode-solutions-5zk.pages.dev/posts/0060-permutation-sequence/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0060-permutation-sequence/Hard | Math, Recursionhttps://leetcode-solutions-5zk.pages.dev/posts/0065-valid-number/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0065-valid-number/Hard | Stringhttps://leetcode-solutions-5zk.pages.dev/posts/0068-text-justification/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0068-text-justification/Hard | Array, String, Simulationhttps://leetcode-solutions-5zk.pages.dev/posts/0084-largest-rectangle-in-histogram/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0084-largest-rectangle-in-histogram/Hard | Array, Stack, Monotonic Stackhttps://leetcode-solutions-5zk.pages.dev/posts/0085-maximal-rectangle/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0085-maximal-rectangle/Hard | Array, Dynamic Programming, Stack, Matrix, Monotonic Stackhttps://leetcode-solutions-5zk.pages.dev/posts/0087-scramble-string/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0087-scramble-string/Hard | String, Dynamic Programming