https://leetcode-solutions-5zk.pages.dev/tags/bitmask/Recent content in Bitmask 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/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/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/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/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/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/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/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/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/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/3283-maximum-number-of-moves-to-kill-all-pawns/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3283-maximum-number-of-moves-to-kill-all-pawns/Hard | Array, Math, Bit Manipulation, Breadth-First Search, Game Theory, Bitmaskhttps://leetcode-solutions-5zk.pages.dev/posts/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/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/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/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/3594-minimum-time-to-transport-all-individuals/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3594-minimum-time-to-transport-all-individuals/Hard | Array, Bit Manipulation, Graph Theory, Heap (Priority Queue), Shortest Path, Bitmaskhttps://leetcode-solutions-5zk.pages.dev/posts/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/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/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/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/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/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/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/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/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/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/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/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/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/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/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/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/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/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/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/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/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/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/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/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/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/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/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, Bitmask