https://leetcode-solutions-5zk.pages.dev/tags/dynamic-programming/Recent content in Dynamic Programming on LeetCode 题解笔记Hugozh-cn2026 ZenzZweiMon, 11 May 2026 12:12:02 +0800https://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/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/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/3418-maximum-amount-of-money-robot-can-earn/Wed, 06 May 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3418-maximum-amount-of-money-robot-can-earn/Medium | Array, Dynamic Programming, Matrixhttps://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/1638-count-substrings-that-differ-by-one-character/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1638-count-substrings-that-differ-by-one-character/Medium | Hash Table, String, Dynamic Programming, Enumerationhttps://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/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/1774-closest-dessert-cost/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1774-closest-dessert-cost/Medium | Array, Dynamic Programming, Backtrackinghttps://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/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/1947-maximum-compatibility-score-sum/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1947-maximum-compatibility-score-sum/Medium | Array, Dynamic Programming, Backtracking, Bit Manipulation, Bitmaskhttps://leetcode-solutions-5zk.pages.dev/posts/1976-number-of-ways-to-arrive-at-destination/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1976-number-of-ways-to-arrive-at-destination/Medium | Dynamic Programming, Graph Theory, Topological Sort, Shortest Pathhttps://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/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/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/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/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/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/2400-number-of-ways-to-reach-a-position-after-exactly-k-steps/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2400-number-of-ways-to-reach-a-position-after-exactly-k-steps/Medium | Math, Dynamic Programming, Combinatoricshttps://leetcode-solutions-5zk.pages.dev/posts/0072-edit-distance/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0072-edit-distance/Medium | String, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/1035-uncrossed-lines/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1035-uncrossed-lines/Medium | Array, Dynamic Programminghttps://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/1139-largest-1-bordered-square/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1139-largest-1-bordered-square/Medium | Array, Dynamic Programming, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/1143-longest-common-subsequence/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1143-longest-common-subsequence/Medium | 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/1162-as-far-from-land-as-possible/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1162-as-far-from-land-as-possible/Medium | Array, Dynamic Programming, Breadth-First Search, Matrixhttps://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/1277-count-square-submatrices-with-all-ones/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1277-count-square-submatrices-with-all-ones/Medium | Array, Dynamic Programming, Matrixhttps://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/0131-palindrome-partitioning/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0131-palindrome-partitioning/Medium | String, Dynamic Programming, Backtrackinghttps://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/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/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/1504-count-submatrices-with-all-ones/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1504-count-submatrices-with-all-ones/Medium | Array, Dynamic Programming, Stack, Matrix, Monotonic Stackhttps://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/0221-maximal-square/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0221-maximal-square/Medium | Array, Dynamic Programming, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/2767-partition-string-into-minimum-beautiful-substrings/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2767-partition-string-into-minimum-beautiful-substrings/Medium | Hash Table, String, Dynamic Programming, Backtrackinghttps://leetcode-solutions-5zk.pages.dev/posts/2770-maximum-number-of-jumps-to-reach-the-last-index/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2770-maximum-number-of-jumps-to-reach-the-last-index/Medium | Array, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/2771-longest-non-decreasing-subarray-from-two-arrays/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2771-longest-non-decreasing-subarray-from-two-arrays/Medium | Array, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/2786-visit-array-positions-to-maximize-score/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2786-visit-array-positions-to-maximize-score/Medium | Array, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/2787-ways-to-express-an-integer-as-sum-of-powers/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2787-ways-to-express-an-integer-as-sum-of-powers/Medium | Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/0313-super-ugly-number/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0313-super-ugly-number/Medium | Array, Math, Dynamic Programminghttps://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/3573-best-time-to-buy-and-sell-stock-v/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3573-best-time-to-buy-and-sell-stock-v/Medium | Array, Dynamic Programminghttps://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/3578-count-partitions-with-max-min-difference-at-most-k/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3578-count-partitions-with-max-min-difference-at-most-k/Medium | Array, Dynamic Programming, Queue, Sliding Window, Prefix Sum, Monotonic Queuehttps://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/0368-largest-divisible-subset/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0368-largest-divisible-subset/Medium | Array, Math, Dynamic Programming, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/0467-unique-substrings-in-wraparound-string/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0467-unique-substrings-in-wraparound-string/Medium | String, Dynamic Programminghttps://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/0474-ones-and-zeroes/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0474-ones-and-zeroes/Medium | Array, String, Dynamic Programminghttps://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/0516-longest-palindromic-subsequence/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0516-longest-palindromic-subsequence/Medium | String, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/0526-beautiful-arrangement/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0526-beautiful-arrangement/Medium | Array, Dynamic Programming, Backtracking, Bit Manipulation, Bitmaskhttps://leetcode-solutions-5zk.pages.dev/posts/0542-01-matrix/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0542-01-matrix/Medium | Array, Dynamic Programming, Breadth-First Search, Matrixhttps://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/0583-delete-operation-for-two-strings/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0583-delete-operation-for-two-strings/Medium | String, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/0712-minimum-ascii-delete-sum-for-two-strings/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0712-minimum-ascii-delete-sum-for-two-strings/Medium | String, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/0718-maximum-length-of-repeated-subarray/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0718-maximum-length-of-repeated-subarray/Medium | Array, Binary Search, Dynamic Programming, Sliding Window, Rolling Hash, Hash Functionhttps://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/0792-number-of-matching-subsequences/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0792-number-of-matching-subsequences/Medium | Array, Hash Table, String, Binary Search, Dynamic Programming, Trie, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/0823-binary-trees-with-factors/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0823-binary-trees-with-factors/Medium | Array, Hash Table, Dynamic Programming, Sortinghttps://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/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/3201-find-the-maximum-length-of-valid-subsequence-i/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3201-find-the-maximum-length-of-valid-subsequence-i/Medium | Array, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/3202-find-the-maximum-length-of-valid-subsequence-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3202-find-the-maximum-length-of-valid-subsequence-ii/Medium | Array, Dynamic Programminghttps://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/3218-minimum-cost-for-cutting-cake-i/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3218-minimum-cost-for-cutting-cake-i/Medium | Array, Two Pointers, Dynamic Programming, 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/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/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/3259-maximum-energy-boost-from-two-drinks/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3259-maximum-energy-boost-from-two-drinks/Medium | Array, Dynamic Programminghttps://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/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/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/3290-maximum-multiplication-score/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3290-maximum-multiplication-score/Medium | Array, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/3291-minimum-number-of-valid-strings-to-form-target-i/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3291-minimum-number-of-valid-strings-to-form-target-i/Medium | Array, String, Binary Search, Dynamic Programming, Greedy, Trie, Segment Tree, Rolling Hash, String Matching, Hash Functionhttps://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/3302-find-the-lexicographically-smallest-valid-sequence/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3302-find-the-lexicographically-smallest-valid-sequence/Medium | Two Pointers, String, Dynamic Programming, Greedyhttps://leetcode-solutions-5zk.pages.dev/posts/3316-find-maximum-removals-from-source-string/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3316-find-maximum-removals-from-source-string/Medium | Array, Hash Table, Two Pointers, String, Dynamic Programminghttps://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/3332-maximum-points-tourist-can-earn/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3332-maximum-points-tourist-can-earn/Medium | Array, Dynamic Programming, Matrixhttps://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/3335-total-characters-in-string-after-transformations-i/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3335-total-characters-in-string-after-transformations-i/Medium | Hash Table, Math, String, Dynamic Programming, Countinghttps://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/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/3366-minimum-array-sum/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3366-minimum-array-sum/Medium | Array, Dynamic Programminghttps://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/3376-minimum-time-to-break-locks-i/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3376-minimum-time-to-break-locks-i/Medium | Array, Dynamic Programming, Backtracking, Bit Manipulation, Breadth-First Search, Bitmaskhttps://leetcode-solutions-5zk.pages.dev/posts/3388-count-beautiful-splits-in-an-array/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3388-count-beautiful-splits-in-an-array/Medium | Array, Dynamic Programminghttps://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/3393-count-paths-with-the-given-xor-value/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3393-count-paths-with-the-given-xor-value/Medium | Array, Dynamic Programming, Bit Manipulation, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/3409-longest-subsequence-with-decreasing-adjacent-difference/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3409-longest-subsequence-with-decreasing-adjacent-difference/Medium | Array, Dynamic Programminghttps://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/3428-maximum-and-minimum-sums-of-at-most-size-k-subsequences/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3428-maximum-and-minimum-sums-of-at-most-size-k-subsequences/Medium | Array, Math, Dynamic Programming, Sorting, Combinatoricshttps://leetcode-solutions-5zk.pages.dev/posts/3429-paint-house-iv/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3429-paint-house-iv/Medium | Array, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/3434-maximum-frequency-after-subarray-operation/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3434-maximum-frequency-after-subarray-operation/Medium | Array, Hash Table, Dynamic Programming, Greedy, Enumeration, Prefix Sumhttps://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/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/3458-select-k-disjoint-special-substrings/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3458-select-k-disjoint-special-substrings/Medium | Hash Table, String, Dynamic Programming, Greedy, Sortinghttps://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/3469-find-minimum-cost-to-remove-array-elements/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3469-find-minimum-cost-to-remove-array-elements/Medium | Array, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/3472-longest-palindromic-subsequence-after-at-most-k-operations/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3472-longest-palindromic-subsequence-after-at-most-k-operations/Medium | String, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/3473-sum-of-k-subarrays-with-length-at-least-m/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3473-sum-of-k-subarrays-with-length-at-least-m/Medium | Array, Dynamic Programming, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/3489-zero-array-transformation-iv/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3489-zero-array-transformation-iv/Medium | Array, Dynamic Programminghttps://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/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/3503-longest-palindrome-after-substring-concatenation-i/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3503-longest-palindrome-after-substring-concatenation-i/Medium | Two Pointers, String, Dynamic Programming, Enumerationhttps://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/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/3524-find-x-value-of-array-i/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3524-find-x-value-of-array-i/Medium | Array, Math, Dynamic Programminghttps://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/3543-maximum-weighted-k-edge-path/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3543-maximum-weighted-k-edge-path/Medium | Hash Table, Dynamic Programming, Graph Theoryhttps://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/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/3557-find-maximum-number-of-non-intersecting-substrings/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3557-find-maximum-number-of-non-intersecting-substrings/Medium | Hash Table, String, Dynamic Programming, Greedyhttps://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/3592-inverse-coin-change/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3592-inverse-coin-change/Medium | Array, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/3593-minimum-increments-to-equalize-leaf-paths/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3593-minimum-increments-to-equalize-leaf-paths/Medium | Array, Dynamic Programming, Tree, Depth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/3599-partition-array-to-minimize-xor/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3599-partition-array-to-minimize-xor/Medium | Array, Dynamic Programming, Bit Manipulation, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/3603-minimum-cost-path-with-alternating-directions-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3603-minimum-cost-path-with-alternating-directions-ii/Medium | Array, Dynamic Programming, Matrixhttps://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/3628-maximum-number-of-subsequences-after-one-inserting/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3628-maximum-number-of-subsequences-after-one-inserting/Medium | String, Dynamic Programming, Greedy, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/3638-maximum-balanced-shipments/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3638-maximum-balanced-shipments/Medium | Array, Dynamic Programming, Stack, Greedy, Monotonic Stackhttps://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/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/3654-minimum-sum-after-divisible-sum-deletions/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3654-minimum-sum-after-divisible-sum-deletions/Medium | Array, Hash Table, Dynamic Programming, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/3660-jump-game-ix/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3660-jump-game-ix/Medium | Array, Dynamic Programminghttps://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/3665-twisted-mirror-path-count/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3665-twisted-mirror-path-count/Medium | Array, Dynamic Programming, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/3670-maximum-product-of-two-integers-with-no-common-bits/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3670-maximum-product-of-two-integers-with-no-common-bits/Medium | Array, Dynamic Programming, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/3685-subsequence-sum-after-capping-elements/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3685-subsequence-sum-after-capping-elements/Medium | Array, Two Pointers, Dynamic Programming, Sortinghttps://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/3693-climbing-stairs-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3693-climbing-stairs-ii/Medium | Array, Dynamic Programminghttps://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/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/3738-longest-non-decreasing-subarray-after-replacing-at-most-one-element/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3738-longest-non-decreasing-subarray-after-replacing-at-most-one-element/Medium | Array, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/3742-maximum-path-score-in-a-grid/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3742-maximum-path-score-in-a-grid/Medium | Array, Dynamic Programming, Matrixhttps://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/3747-count-distinct-integers-after-removing-zeros/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3747-count-distinct-integers-after-removing-zeros/Medium | Math, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/3751-total-waviness-of-numbers-in-range-i/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3751-total-waviness-of-numbers-in-range-i/Medium | Math, Dynamic Programming, Enumerationhttps://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/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/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/3811-number-of-alternating-xor-partitions/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3811-number-of-alternating-xor-partitions/Medium | Array, Hash Table, Dynamic Programming, Bit Manipulationhttps://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/3840-house-robber-v/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3840-house-robber-v/Medium | Array, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/3844-longest-almost-palindromic-substring/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3844-longest-almost-palindromic-substring/Medium | Two Pointers, String, Dynamic Programminghttps://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/3857-minimum-cost-to-split-into-ones/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3857-minimum-cost-to-split-into-ones/Medium | Math, Dynamic Programminghttps://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/3877-minimum-removals-to-achieve-target-xor/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3877-minimum-removals-to-achieve-target-xor/Medium | Array, Dynamic Programming, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/3882-minimum-xor-path-in-a-grid/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3882-minimum-xor-path-in-a-grid/Medium | Array, Dynamic Programming, Bit Manipulation, Matrixhttps://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/3891-minimum-increase-to-maximize-special-indices/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3891-minimum-increase-to-maximize-special-indices/Medium | Array, Dynamic Programming, Greedy, Prefix Sumhttps://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/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/2998-minimum-number-of-operations-to-make-x-and-y-equal/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2998-minimum-number-of-operations-to-make-x-and-y-equal/Medium | Dynamic Programming, Breadth-First Search, Memoizationhttps://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/3007-maximum-number-that-sum-of-the-prices-is-less-than-or-equal-to-k/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3007-maximum-number-that-sum-of-the-prices-is-less-than-or-equal-to-k/Medium | Math, Binary Search, Dynamic Programming, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/3040-maximum-number-of-operations-with-the-same-score-ii/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3040-maximum-number-of-operations-with-the-same-score-ii/Medium | Array, Dynamic Programming, Memoizationhttps://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/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/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/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/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/3122-minimum-number-of-operations-to-satisfy-conditions/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3122-minimum-number-of-operations-to-satisfy-conditions/Medium | Array, Dynamic Programming, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/3129-find-all-possible-stable-binary-arrays-i/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3129-find-all-possible-stable-binary-arrays-i/Medium | Dynamic Programming, Prefix Sumhttps://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/3144-minimum-substring-partition-of-equal-character-frequency/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3144-minimum-substring-partition-of-equal-character-frequency/Medium | Hash Table, String, Dynamic Programming, Countinghttps://leetcode-solutions-5zk.pages.dev/posts/3147-taking-maximum-energy-from-the-mystic-dungeon/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3147-taking-maximum-energy-from-the-mystic-dungeon/Medium | Array, Dynamic Programming, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/3148-maximum-difference-score-in-a-grid/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3148-maximum-difference-score-in-a-grid/Medium | Array, Dynamic Programming, Matrixhttps://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/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/3176-find-the-maximum-length-of-a-good-subsequence-i/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3176-find-the-maximum-length-of-a-good-subsequence-i/Medium | Array, Hash Table, Dynamic Programminghttps://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/3180-maximum-total-reward-using-operations-i/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3180-maximum-total-reward-using-operations-i/Medium | Array, 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/3186-maximum-total-damage-with-spell-casting/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3186-maximum-total-damage-with-spell-casting/Medium | Array, Hash Table, Two Pointers, Binary Search, Dynamic Programming, Sorting, Countinghttps://leetcode-solutions-5zk.pages.dev/posts/3192-minimum-operations-to-make-binary-array-elements-equal-to-one-ii/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3192-minimum-operations-to-make-binary-array-elements-equal-to-one-ii/Medium | Array, Dynamic Programming, Greedyhttps://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/3196-maximize-total-cost-of-alternating-subarrays/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3196-maximize-total-cost-of-alternating-subarrays/Medium | Array, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/2645-minimum-additions-to-make-valid-string/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2645-minimum-additions-to-make-valid-string/Medium | String, Dynamic Programming, Stack, Greedyhttps://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/2673-make-costs-of-paths-equal-in-a-binary-tree/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2673-make-costs-of-paths-equal-in-a-binary-tree/Medium | Array, Dynamic Programming, Greedy, Tree, Binary Treehttps://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/2684-maximum-number-of-moves-in-a-grid/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2684-maximum-number-of-moves-in-a-grid/Medium | Array, Dynamic Programming, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/2707-extra-characters-in-a-string/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2707-extra-characters-in-a-string/Medium | Array, Hash Table, String, Dynamic Programming, Triehttps://leetcode-solutions-5zk.pages.dev/posts/2708-maximum-strength-of-a-group/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2708-maximum-strength-of-a-group/Medium | Array, Dynamic Programming, Backtracking, Greedy, Bit Manipulation, Sorting, Enumerationhttps://leetcode-solutions-5zk.pages.dev/posts/2712-minimum-cost-to-make-all-characters-equal/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2712-minimum-cost-to-make-all-characters-equal/Medium | String, Dynamic Programming, Greedyhttps://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/2741-special-permutations/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2741-special-permutations/Medium | Array, Dynamic Programming, Bit Manipulation, Bitmaskhttps://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/2745-construct-the-longest-new-string/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2745-construct-the-longest-new-string/Medium | Math, Dynamic Programming, Greedy, Brainteaserhttps://leetcode-solutions-5zk.pages.dev/posts/2746-decremental-string-concatenation/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2746-decremental-string-concatenation/Medium | Array, String, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/2750-ways-to-split-array-into-good-subarrays/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2750-ways-to-split-array-into-good-subarrays/Medium | Array, Math, Dynamic Programminghttps://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/2811-check-if-it-is-possible-to-split-array/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2811-check-if-it-is-possible-to-split-array/Medium | Array, Dynamic Programming, Greedyhttps://leetcode-solutions-5zk.pages.dev/posts/2826-sorting-three-groups/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2826-sorting-three-groups/Medium | Array, Binary Search, Dynamic Programminghttps://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/2830-maximize-the-profit-as-the-salesman/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2830-maximize-the-profit-as-the-salesman/Medium | Array, Hash Table, Binary Search, Dynamic Programming, Sortinghttps://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/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/2850-minimum-moves-to-spread-stones-over-grid/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2850-minimum-moves-to-spread-stones-over-grid/Medium | Array, Dynamic Programming, Backtracking, Bit Manipulation, Matrix, Bitmaskhttps://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/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/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/2896-apply-operations-to-make-two-strings-equal/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2896-apply-operations-to-make-two-strings-equal/Medium | String, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/2900-longest-unequal-adjacent-groups-subsequence-i/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2900-longest-unequal-adjacent-groups-subsequence-i/Easy | Array, String, Dynamic Programming, Greedyhttps://leetcode-solutions-5zk.pages.dev/posts/2901-longest-unequal-adjacent-groups-subsequence-ii/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2901-longest-unequal-adjacent-groups-subsequence-ii/Medium | Array, String, Dynamic Programminghttps://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/2915-length-of-the-longest-subsequence-that-sums-to-target/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2915-length-of-the-longest-subsequence-that-sums-to-target/Medium | Array, 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/2919-minimum-increment-operations-to-make-array-beautiful/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2919-minimum-increment-operations-to-make-array-beautiful/Medium | Array, Dynamic Programminghttps://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/2925-maximum-score-after-applying-operations-on-a-tree/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2925-maximum-score-after-applying-operations-on-a-tree/Medium | Dynamic Programming, Tree, Depth-First Searchhttps://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/2930-number-of-strings-which-can-be-rearranged-to-contain-substring/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2930-number-of-strings-which-can-be-rearranged-to-contain-substring/Medium | Math, Dynamic Programming, Combinatoricshttps://leetcode-solutions-5zk.pages.dev/posts/2944-minimum-number-of-coins-for-fruits/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2944-minimum-number-of-coins-for-fruits/Medium | Array, Dynamic Programming, Queue, Heap (Priority Queue), Monotonic Queuehttps://leetcode-solutions-5zk.pages.dev/posts/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/2957-remove-adjacent-almost-equal-characters/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2957-remove-adjacent-almost-equal-characters/Medium | String, Dynamic Programming, Greedyhttps://leetcode-solutions-5zk.pages.dev/posts/2002-maximum-product-of-the-length-of-two-palindromic-subsequences/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2002-maximum-product-of-the-length-of-two-palindromic-subsequences/Medium | String, Dynamic Programming, Backtracking, Bit Manipulation, Bitmaskhttps://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/2008-maximum-earnings-from-taxi/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2008-maximum-earnings-from-taxi/Medium | Array, Hash Table, Binary Search, Dynamic Programming, Sortinghttps://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/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/2054-two-best-non-overlapping-events/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2054-two-best-non-overlapping-events/Medium | Array, Binary Search, Dynamic Programming, Sorting, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/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/2063-vowels-of-all-substrings/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2063-vowels-of-all-substrings/Medium | Math, String, Dynamic Programming, Combinatoricshttps://leetcode-solutions-5zk.pages.dev/posts/2086-minimum-number-of-food-buckets-to-feed-the-hamsters/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2086-minimum-number-of-food-buckets-to-feed-the-hamsters/Medium | String, Dynamic Programming, Greedyhttps://leetcode-solutions-5zk.pages.dev/posts/2100-find-good-days-to-rob-the-bank/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2100-find-good-days-to-rob-the-bank/Medium | Array, Dynamic Programming, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/2110-number-of-smooth-descent-periods-of-a-stock/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2110-number-of-smooth-descent-periods-of-a-stock/Medium | Array, Math, Two Pointers, Dynamic Programming, Sliding Windowhttps://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/2140-solving-questions-with-brainpower/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2140-solving-questions-with-brainpower/Medium | Array, Dynamic Programminghttps://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/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/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/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/2222-number-of-ways-to-select-buildings/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2222-number-of-ways-to-select-buildings/Medium | String, Dynamic Programming, Prefix Sumhttps://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/2266-count-number-of-texts/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2266-count-number-of-texts/Medium | Hash Table, Math, 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/2289-steps-to-make-array-non-decreasing/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2289-steps-to-make-array-non-decreasing/Medium | Array, Linked List, Dynamic Programming, Stack, Monotonic Stack, Simulationhttps://leetcode-solutions-5zk.pages.dev/posts/2304-minimum-path-cost-in-a-grid/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2304-minimum-path-cost-in-a-grid/Medium | Array, Dynamic Programming, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/2305-fair-distribution-of-cookies/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2305-fair-distribution-of-cookies/Medium | Array, Dynamic Programming, Backtracking, Bit Manipulation, Bitmaskhttps://leetcode-solutions-5zk.pages.dev/posts/2310-sum-of-numbers-with-units-digit-k/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2310-sum-of-numbers-with-units-digit-k/Medium | Math, Dynamic Programming, Greedy, Enumerationhttps://leetcode-solutions-5zk.pages.dev/posts/2311-longest-binary-subsequence-less-than-or-equal-to-k/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2311-longest-binary-subsequence-less-than-or-equal-to-k/Medium | String, Dynamic Programming, Greedy, Memoizationhttps://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/2320-count-number-of-ways-to-place-houses/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2320-count-number-of-ways-to-place-houses/Medium | Dynamic Programminghttps://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/2327-number-of-people-aware-of-a-secret/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2327-number-of-people-aware-of-a-secret/Medium | Dynamic Programming, Queue, Simulationhttps://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/2369-check-if-there-is-a-valid-partition-for-the-array/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2369-check-if-there-is-a-valid-partition-for-the-array/Medium | Array, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/2370-longest-ideal-subsequence/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2370-longest-ideal-subsequence/Medium | Hash Table, String, Dynamic Programminghttps://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/2380-time-needed-to-rearrange-a-binary-string/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2380-time-needed-to-rearrange-a-binary-string/Medium | String, Dynamic Programming, 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/2420-find-all-good-indices/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2420-find-all-good-indices/Medium | Array, Dynamic Programming, Prefix Sumhttps://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/2439-minimize-maximum-of-array/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2439-minimize-maximum-of-array/Medium | Array, Binary Search, Dynamic Programming, Greedy, Prefix Sumhttps://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/2466-count-ways-to-build-good-strings/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2466-count-ways-to-build-good-strings/Medium | Dynamic Programminghttps://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/2501-longest-square-streak-in-an-array/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2501-longest-square-streak-in-an-array/Medium | Array, Hash Table, Binary Search, Dynamic Programming, Sortinghttps://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/2522-partition-string-into-substrings-with-values-at-most-k/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2522-partition-string-into-substrings-with-values-at-most-k/Medium | String, Dynamic Programming, Greedyhttps://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/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/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/2556-disconnect-path-in-a-binary-matrix-by-at-most-one-flip/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2556-disconnect-path-in-a-binary-matrix-by-at-most-one-flip/Medium | Array, Dynamic Programming, Depth-First Search, Breadth-First Search, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/2560-house-robber-iv/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2560-house-robber-iv/Medium | Array, Binary Search, Dynamic Programming, Greedyhttps://leetcode-solutions-5zk.pages.dev/posts/2571-minimum-operations-to-reduce-an-integer-to-0/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2571-minimum-operations-to-reduce-an-integer-to-0/Medium | Dynamic Programming, Greedy, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/2572-count-the-number-of-square-free-subsets/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2572-count-the-number-of-square-free-subsets/Medium | Array, Math, Dynamic Programming, Bit Manipulation, Number Theory, Bitmaskhttps://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/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/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/2597-the-number-of-beautiful-subsets/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2597-the-number-of-beautiful-subsets/Medium | Array, Hash Table, Math, Dynamic Programming, Backtracking, Sorting, Combinatoricshttps://leetcode-solutions-5zk.pages.dev/posts/2606-find-the-substring-with-maximum-cost/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2606-find-the-substring-with-maximum-cost/Medium | Array, Hash Table, String, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/2616-minimize-the-maximum-difference-of-pairs/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2616-minimize-the-maximum-difference-of-pairs/Medium | Array, Binary Search, Dynamic Programming, Greedy, Sortinghttps://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/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/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/1334-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1334-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance/Medium | Dynamic Programming, Graph Theory, Shortest Pathhttps://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/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/1372-longest-zigzag-path-in-a-binary-tree/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1372-longest-zigzag-path-in-a-binary-tree/Medium | Dynamic Programming, Tree, Depth-First Search, Binary Treehttps://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/1387-sort-integers-by-the-power-value/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1387-sort-integers-by-the-power-value/Medium | Dynamic Programming, Memoization, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/1395-count-number-of-teams/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1395-count-number-of-teams/Medium | Array, Dynamic Programming, Binary Indexed Tree, Segment Treehttps://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/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/1477-find-two-non-overlapping-sub-arrays-each-with-target-sum/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1477-find-two-non-overlapping-sub-arrays-each-with-target-sum/Medium | Array, Hash Table, Binary Search, Dynamic Programming, Sliding Windowhttps://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/1493-longest-subarray-of-1s-after-deleting-one-element/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1493-longest-subarray-of-1s-after-deleting-one-element/Medium | Array, Dynamic Programming, Sliding Windowhttps://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/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/1524-number-of-sub-arrays-with-odd-sum/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1524-number-of-sub-arrays-with-odd-sum/Medium | Array, Math, Dynamic Programming, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/1525-number-of-good-ways-to-split-a-string/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1525-number-of-good-ways-to-split-a-string/Medium | Hash Table, String, Dynamic Programming, Bit Manipulationhttps://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/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/1567-maximum-length-of-subarray-with-positive-product/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1567-maximum-length-of-subarray-with-positive-product/Medium | Array, Dynamic Programming, Greedyhttps://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/1578-minimum-time-to-make-rope-colorful/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1578-minimum-time-to-make-rope-colorful/Medium | Array, String, Dynamic Programming, Greedyhttps://leetcode-solutions-5zk.pages.dev/posts/1594-maximum-non-negative-product-in-a-matrix/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1594-maximum-non-negative-product-in-a-matrix/Medium | Array, Dynamic Programming, Matrixhttps://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/1621-number-of-sets-of-k-non-overlapping-line-segments/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1621-number-of-sets-of-k-non-overlapping-line-segments/Medium | Math, Dynamic Programming, Combinatorics, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/1626-best-team-with-no-conflicts/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1626-best-team-with-no-conflicts/Medium | Array, Dynamic Programming, Sortinghttps://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/1641-count-sorted-vowel-strings/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1641-count-sorted-vowel-strings/Medium | Math, Dynamic Programming, Combinatoricshttps://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/1653-minimum-deletions-to-make-string-balanced/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1653-minimum-deletions-to-make-string-balanced/Medium | String, Dynamic Programming, Stackhttps://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/1668-maximum-repeating-substring/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1668-maximum-repeating-substring/Easy | String, Dynamic Programming, String Matchinghttps://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/1690-stone-game-vii/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1690-stone-game-vii/Medium | Array, Math, Dynamic Programming, Game Theoryhttps://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/1696-jump-game-vi/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1696-jump-game-vi/Medium | Array, Dynamic Programming, Queue, Heap (Priority Queue), Monotonic Queuehttps://leetcode-solutions-5zk.pages.dev/posts/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/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/1749-maximum-absolute-sum-of-any-subarray/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1749-maximum-absolute-sum-of-any-subarray/Medium | Array, 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/1786-number-of-restricted-paths-from-first-to-last-node/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1786-number-of-restricted-paths-from-first-to-last-node/Medium | Dynamic Programming, Graph Theory, Topological Sort, Heap (Priority Queue), Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/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/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/1824-minimum-sideway-jumps/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1824-minimum-sideway-jumps/Medium | Array, Dynamic Programming, Greedyhttps://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/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/1871-jump-game-vii/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1871-jump-game-vii/Medium | String, Dynamic Programming, Sliding Window, Prefix Sumhttps://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/1884-egg-drop-with-2-eggs-and-n-floors/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1884-egg-drop-with-2-eggs-and-n-floors/Medium | Math, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/1888-minimum-number-of-flips-to-make-the-binary-string-alternating/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1888-minimum-number-of-flips-to-make-the-binary-string-alternating/Medium | String, Dynamic Programming, Sliding Windowhttps://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/1911-maximum-alternating-subsequence-sum/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1911-maximum-alternating-subsequence-sum/Medium | Array, Dynamic Programminghttps://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/1937-maximum-number-of-points-with-cost/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1937-maximum-number-of-points-with-cost/Medium | Array, Dynamic Programming, Matrixhttps://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/1959-minimum-total-space-wasted-with-k-resizing-operations/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1959-minimum-total-space-wasted-with-k-resizing-operations/Medium | Array, Dynamic Programming, Prefix Sumhttps://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/1981-minimize-the-difference-between-target-and-chosen-elements/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1981-minimize-the-difference-between-target-and-chosen-elements/Medium | Array, Dynamic Programming, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/1986-minimum-number-of-work-sessions-to-finish-the-tasks/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1986-minimum-number-of-work-sessions-to-finish-the-tasks/Medium | Array, Dynamic Programming, Backtracking, Bit Manipulation, Bitmaskhttps://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/1997-first-day-where-you-have-been-in-all-the-rooms/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1997-first-day-where-you-have-been-in-all-the-rooms/Medium | Array, Dynamic Programminghttps://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/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/1014-best-sightseeing-pair/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1014-best-sightseeing-pair/Medium | Array, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/1024-video-stitching/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1024-video-stitching/Medium | Array, Dynamic Programming, Greedyhttps://leetcode-solutions-5zk.pages.dev/posts/1025-divisor-game/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1025-divisor-game/Easy | Math, Dynamic Programming, Brainteaser, Game Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/1027-longest-arithmetic-subsequence/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1027-longest-arithmetic-subsequence/Medium | Array, Hash Table, Binary Search, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/1031-maximum-sum-of-two-non-overlapping-subarrays/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1031-maximum-sum-of-two-non-overlapping-subarrays/Medium | Array, Dynamic Programming, Sliding Windowhttps://leetcode-solutions-5zk.pages.dev/posts/1039-minimum-score-triangulation-of-polygon/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1039-minimum-score-triangulation-of-polygon/Medium | Array, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/1043-partition-array-for-maximum-sum/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1043-partition-array-for-maximum-sum/Medium | Array, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/1048-longest-string-chain/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1048-longest-string-chain/Medium | Array, Hash Table, Two Pointers, String, Dynamic Programming, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/1049-last-stone-weight-ii/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1049-last-stone-weight-ii/Medium | Array, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/1105-filling-bookcase-shelves/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1105-filling-bookcase-shelves/Medium | Array, Dynamic Programminghttps://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/1130-minimum-cost-tree-from-leaf-values/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1130-minimum-cost-tree-from-leaf-values/Medium | Array, Dynamic Programming, Stack, Greedy, Monotonic Stackhttps://leetcode-solutions-5zk.pages.dev/posts/1137-n-th-tribonacci-number/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1137-n-th-tribonacci-number/Easy | Math, Dynamic Programming, Memoizationhttps://leetcode-solutions-5zk.pages.dev/posts/1140-stone-game-ii/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1140-stone-game-ii/Medium | Array, Math, Dynamic Programming, Prefix Sum, Game Theoryhttps://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/1155-number-of-dice-rolls-with-target-sum/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1155-number-of-dice-rolls-with-target-sum/Medium | Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/1186-maximum-subarray-sum-with-one-deletion/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1186-maximum-subarray-sum-with-one-deletion/Medium | Array, Dynamic Programminghttps://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/1191-k-concatenation-maximum-sum/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1191-k-concatenation-maximum-sum/Medium | Array, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/1218-longest-arithmetic-subsequence-of-given-difference/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1218-longest-arithmetic-subsequence-of-given-difference/Medium | Array, Hash Table, Dynamic Programminghttps://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/1227-airplane-seat-assignment-probability/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1227-airplane-seat-assignment-probability/Medium | Math, Dynamic Programming, Brainteaser, Probability and Statisticshttps://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/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/1262-greatest-sum-divisible-by-three/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1262-greatest-sum-divisible-by-three/Medium | Array, Dynamic Programming, Greedy, Sortinghttps://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/0740-delete-and-earn/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0740-delete-and-earn/Medium | Array, Hash Table, Dynamic Programminghttps://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/0746-min-cost-climbing-stairs/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0746-min-cost-climbing-stairs/Easy | Array, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/0764-largest-plus-sign/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0764-largest-plus-sign/Medium | Array, Dynamic Programminghttps://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/0787-cheapest-flights-within-k-stops/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0787-cheapest-flights-within-k-stops/Medium | Dynamic Programming, Depth-First Search, Breadth-First Search, Graph Theory, Heap (Priority Queue), Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/0788-rotated-digits/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0788-rotated-digits/Medium | Math, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/0790-domino-and-tromino-tiling/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0790-domino-and-tromino-tiling/Medium | Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/0799-champagne-tower/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0799-champagne-tower/Medium | Dynamic Programminghttps://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/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/0808-soup-servings/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0808-soup-servings/Medium | Math, Dynamic Programming, Probability and Statisticshttps://leetcode-solutions-5zk.pages.dev/posts/0813-largest-sum-of-averages/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0813-largest-sum-of-averages/Medium | Array, Dynamic Programming, Prefix Sumhttps://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/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/0837-new-21-game/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0837-new-21-game/Medium | Math, Dynamic Programming, Sliding Window, Probability and Statisticshttps://leetcode-solutions-5zk.pages.dev/posts/0838-push-dominoes/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0838-push-dominoes/Medium | Two Pointers, String, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/0845-longest-mountain-in-array/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0845-longest-mountain-in-array/Medium | Array, Two Pointers, Dynamic Programming, Enumerationhttps://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/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/0873-length-of-longest-fibonacci-subsequence/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0873-length-of-longest-fibonacci-subsequence/Medium | Array, Hash Table, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/0877-stone-game/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0877-stone-game/Medium | Array, Math, Dynamic Programming, Game Theoryhttps://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/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/0894-all-possible-full-binary-trees/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0894-all-possible-full-binary-trees/Medium | Dynamic Programming, Tree, Recursion, Memoization, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0898-bitwise-ors-of-subarrays/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0898-bitwise-ors-of-subarrays/Medium | Array, Dynamic Programming, Bit Manipulationhttps://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/0907-sum-of-subarray-minimums/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0907-sum-of-subarray-minimums/Medium | Array, Dynamic Programming, Stack, Monotonic Stackhttps://leetcode-solutions-5zk.pages.dev/posts/0918-maximum-sum-circular-subarray/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0918-maximum-sum-circular-subarray/Medium | Array, Divide and Conquer, Dynamic Programming, Queue, Monotonic Queuehttps://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/0926-flip-string-to-monotone-increasing/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0926-flip-string-to-monotone-increasing/Medium | String, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/0931-minimum-falling-path-sum/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0931-minimum-falling-path-sum/Medium | Array, Dynamic Programming, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/0935-knight-dialer/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0935-knight-dialer/Medium | Dynamic Programminghttps://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/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/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/0978-longest-turbulent-subarray/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0978-longest-turbulent-subarray/Medium | Array, Dynamic Programming, Sliding Windowhttps://leetcode-solutions-5zk.pages.dev/posts/0983-minimum-cost-for-tickets/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0983-minimum-cost-for-tickets/Medium | Array, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/0486-predict-the-winner/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0486-predict-the-winner/Medium | Array, Math, Dynamic Programming, Recursion, Game Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/0494-target-sum/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0494-target-sum/Medium | Array, Dynamic Programming, Backtrackinghttps://leetcode-solutions-5zk.pages.dev/posts/0509-fibonacci-number/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0509-fibonacci-number/Easy | Math, Dynamic Programming, Recursion, Memoizationhttps://leetcode-solutions-5zk.pages.dev/posts/0518-coin-change-ii/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0518-coin-change-ii/Medium | Array, Dynamic Programminghttps://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/0553-optimal-division/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0553-optimal-division/Medium | Array, Math, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/0576-out-of-boundary-paths/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0576-out-of-boundary-paths/Medium | Dynamic Programminghttps://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/0638-shopping-offers/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0638-shopping-offers/Medium | Array, Dynamic Programming, Backtracking, Bit Manipulation, Memoization, Bitmaskhttps://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/0646-maximum-length-of-pair-chain/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0646-maximum-length-of-pair-chain/Medium | Array, Dynamic Programming, Greedy, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/0647-palindromic-substrings/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0647-palindromic-substrings/Medium | Two Pointers, String, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/0650-2-keys-keyboard/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0650-2-keys-keyboard/Medium | Math, 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/0673-number-of-longest-increasing-subsequence/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0673-number-of-longest-increasing-subsequence/Medium | Array, Dynamic Programming, Binary Indexed Tree, Segment Treehttps://leetcode-solutions-5zk.pages.dev/posts/0678-valid-parenthesis-string/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0678-valid-parenthesis-string/Medium | String, Dynamic Programming, Stack, Greedyhttps://leetcode-solutions-5zk.pages.dev/posts/0688-knight-probability-in-chessboard/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0688-knight-probability-in-chessboard/Medium | Dynamic Programminghttps://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/0698-partition-to-k-equal-sum-subsets/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0698-partition-to-k-equal-sum-subsets/Medium | Array, Dynamic Programming, Backtracking, Bit Manipulation, Memoization, Bitmaskhttps://leetcode-solutions-5zk.pages.dev/posts/0714-best-time-to-buy-and-sell-stock-with-transaction-fee/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0714-best-time-to-buy-and-sell-stock-with-transaction-fee/Medium | Array, Dynamic Programming, Greedyhttps://leetcode-solutions-5zk.pages.dev/posts/0322-coin-change/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0322-coin-change/Medium | Array, Dynamic Programming, Breadth-First Searchhttps://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/0337-house-robber-iii/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0337-house-robber-iii/Medium | Dynamic Programming, Tree, Depth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0338-counting-bits/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0338-counting-bits/Easy | Dynamic Programming, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/0343-integer-break/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0343-integer-break/Medium | Math, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/0357-count-numbers-with-unique-digits/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0357-count-numbers-with-unique-digits/Medium | Math, Dynamic Programming, Backtrackinghttps://leetcode-solutions-5zk.pages.dev/posts/0375-guess-number-higher-or-lower-ii/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0375-guess-number-higher-or-lower-ii/Medium | Math, Dynamic Programming, Game Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/0376-wiggle-subsequence/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0376-wiggle-subsequence/Medium | Array, Dynamic Programming, Greedyhttps://leetcode-solutions-5zk.pages.dev/posts/0377-combination-sum-iv/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0377-combination-sum-iv/Medium | Array, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/0392-is-subsequence/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0392-is-subsequence/Easy | Two Pointers, String, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/0396-rotate-function/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0396-rotate-function/Medium | Array, Math, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/0397-integer-replacement/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0397-integer-replacement/Medium | Dynamic Programming, Greedy, Bit Manipulation, Memoizationhttps://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/0413-arithmetic-slices/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0413-arithmetic-slices/Medium | Array, Dynamic Programming, Sliding Windowhttps://leetcode-solutions-5zk.pages.dev/posts/0416-partition-equal-subset-sum/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0416-partition-equal-subset-sum/Medium | Array, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/0435-non-overlapping-intervals/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0435-non-overlapping-intervals/Medium | Array, Dynamic Programming, Greedy, Sortinghttps://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/0464-can-i-win/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0464-can-i-win/Medium | Math, Dynamic Programming, Bit Manipulation, Memoization, Game Theory, Bitmaskhttps://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/0473-matchsticks-to-square/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0473-matchsticks-to-square/Medium | Array, Dynamic Programming, Backtracking, Bit Manipulation, Bitmaskhttps://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/0118-pascals-triangle/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0118-pascals-triangle/Easy | Array, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/0119-pascals-triangle-ii/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0119-pascals-triangle-ii/Easy | Array, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/0120-triangle/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0120-triangle/Medium | Array, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/0121-best-time-to-buy-and-sell-stock/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0121-best-time-to-buy-and-sell-stock/Easy | Array, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/0122-best-time-to-buy-and-sell-stock-ii/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0122-best-time-to-buy-and-sell-stock-ii/Medium | Array, Dynamic Programming, Greedyhttps://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/0139-word-break/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0139-word-break/Medium | Array, Hash Table, String, Dynamic Programming, Trie, Memoizationhttps://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/0152-maximum-product-subarray/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0152-maximum-product-subarray/Medium | Array, Dynamic Programminghttps://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/0198-house-robber/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0198-house-robber/Medium | Array, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/0213-house-robber-ii/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0213-house-robber-ii/Medium | Array, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/0022-generate-parentheses/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0022-generate-parentheses/Medium | String, Dynamic Programming, Backtrackinghttps://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/0241-different-ways-to-add-parentheses/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0241-different-ways-to-add-parentheses/Medium | Math, String, Dynamic Programming, Recursion, Memoizationhttps://leetcode-solutions-5zk.pages.dev/posts/0264-ugly-number-ii/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0264-ugly-number-ii/Medium | Hash Table, Math, Dynamic Programming, Heap (Priority Queue)https://leetcode-solutions-5zk.pages.dev/posts/0279-perfect-squares/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0279-perfect-squares/Medium | Math, Dynamic Programming, Breadth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/0300-longest-increasing-subsequence/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0300-longest-increasing-subsequence/Medium | Array, Binary Search, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/0309-best-time-to-buy-and-sell-stock-with-cooldown/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0309-best-time-to-buy-and-sell-stock-with-cooldown/Medium | Array, Dynamic Programminghttps://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/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/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/0045-jump-game-ii/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0045-jump-game-ii/Medium | Array, Dynamic Programming, Greedyhttps://leetcode-solutions-5zk.pages.dev/posts/0005-longest-palindromic-substring/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0005-longest-palindromic-substring/Medium | Two Pointers, String, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/0053-maximum-subarray/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0053-maximum-subarray/Medium | Array, Divide and Conquer, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/0055-jump-game/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0055-jump-game/Medium | Array, Dynamic Programming, Greedyhttps://leetcode-solutions-5zk.pages.dev/posts/0062-unique-paths/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0062-unique-paths/Medium | Math, Dynamic Programming, Combinatoricshttps://leetcode-solutions-5zk.pages.dev/posts/0063-unique-paths-ii/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0063-unique-paths-ii/Medium | Array, Dynamic Programming, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/0064-minimum-path-sum/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0064-minimum-path-sum/Medium | Array, Dynamic Programming, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/0070-climbing-stairs/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0070-climbing-stairs/Easy | Math, Dynamic Programming, Memoizationhttps://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 Programminghttps://leetcode-solutions-5zk.pages.dev/posts/0091-decode-ways/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0091-decode-ways/Medium | String, Dynamic Programminghttps://leetcode-solutions-5zk.pages.dev/posts/0095-unique-binary-search-trees-ii/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0095-unique-binary-search-trees-ii/Medium | Dynamic Programming, Backtracking, Tree, Binary Search Tree, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0096-unique-binary-search-trees/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0096-unique-binary-search-trees/Medium | Math, Dynamic Programming, Tree, Binary Search Tree, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0097-interleaving-string/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0097-interleaving-string/Medium | String, Dynamic Programming