https://leetcode-solutions-5zk.pages.dev/tags/bit-manipulation/Recent content in Bit Manipulation 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/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/1684-count-the-number-of-consistent-strings/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1684-count-the-number-of-consistent-strings/Easy | Array, Hash Table, String, Bit Manipulation, Countinghttps://leetcode-solutions-5zk.pages.dev/posts/1787-make-the-xor-of-all-segments-equal-to-zero/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1787-make-the-xor-of-all-segments-equal-to-zero/Hard | Array, Hash Table, Dynamic Programming, Bit Manipulation, Countinghttps://leetcode-solutions-5zk.pages.dev/posts/1803-count-pairs-with-xor-in-a-range/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1803-count-pairs-with-xor-in-a-range/Hard | Array, Bit Manipulation, Triehttps://leetcode-solutions-5zk.pages.dev/posts/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/2151-maximum-good-people-based-on-statements/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2151-maximum-good-people-based-on-statements/Hard | Array, Backtracking, Bit Manipulation, Enumerationhttps://leetcode-solutions-5zk.pages.dev/posts/2397-maximum-rows-covered-by-columns/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2397-maximum-rows-covered-by-columns/Medium | Array, Backtracking, Bit Manipulation, Matrix, Enumerationhttps://leetcode-solutions-5zk.pages.dev/posts/1239-maximum-length-of-a-concatenated-string-with-unique-characters/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1239-maximum-length-of-a-concatenated-string-with-unique-characters/Medium | Array, String, Backtracking, Bit Manipulationhttps://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/1356-sort-integers-by-the-number-of-1-bits/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1356-sort-integers-by-the-number-of-1-bits/Easy | Array, Bit Manipulation, Sorting, Countinghttps://leetcode-solutions-5zk.pages.dev/posts/1442-count-triplets-that-can-form-two-arrays-of-equal-xor/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1442-count-triplets-that-can-form-two-arrays-of-equal-xor/Medium | Array, Hash Table, Math, Bit Manipulation, Prefix Sumhttps://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/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/1915-number-of-wonderful-substrings/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1915-number-of-wonderful-substrings/Medium | Hash Table, String, Bit Manipulation, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/2791-count-paths-that-can-form-a-palindrome-in-a-tree/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2791-count-paths-that-can-form-a-palindrome-in-a-tree/Hard | Hash Table, Bit Manipulation, Tree, Depth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/0318-maximum-product-of-word-lengths/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0318-maximum-product-of-word-lengths/Medium | Array, String, Bit Manipulationhttps://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/0401-binary-watch/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0401-binary-watch/Easy | Backtracking, Bit Manipulationhttps://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/0832-flipping-an-image/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0832-flipping-an-image/Easy | Array, Two Pointers, Bit Manipulation, Matrix, Simulationhttps://leetcode-solutions-5zk.pages.dev/posts/0864-shortest-path-to-get-all-keys/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0864-shortest-path-to-get-all-keys/Hard | Array, Bit Manipulation, Breadth-First Search, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/0090-subsets-ii/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0090-subsets-ii/Medium | Array, Backtracking, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/0943-find-the-shortest-superstring/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0943-find-the-shortest-superstring/Hard | Array, String, Dynamic Programming, Bit Manipulation, Bitmaskhttps://leetcode-solutions-5zk.pages.dev/posts/0980-unique-paths-iii/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0980-unique-paths-iii/Hard | Array, Backtracking, Bit Manipulation, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/0982-triples-with-bitwise-and-equal-to-zero/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0982-triples-with-bitwise-and-equal-to-zero/Hard | Array, Hash Table, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/0996-number-of-squareful-arrays/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0996-number-of-squareful-arrays/Hard | Array, Hash Table, Math, Dynamic Programming, Backtracking, Bit Manipulation, Bitmaskhttps://leetcode-solutions-5zk.pages.dev/posts/3209-number-of-subarrays-with-and-value-of-k/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3209-number-of-subarrays-with-and-value-of-k/Hard | Array, Binary Search, Bit Manipulation, Segment Treehttps://leetcode-solutions-5zk.pages.dev/posts/3211-generate-binary-strings-without-adjacent-zeros/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3211-generate-binary-strings-without-adjacent-zeros/Medium | String, Backtracking, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/3226-number-of-bit-changes-to-make-two-integers-equal/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3226-number-of-bit-changes-to-make-two-integers-equal/Easy | Bit Manipulationhttps://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/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/3304-find-the-k-th-character-in-string-game-i/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3304-find-the-k-th-character-in-string-game-i/Easy | Math, Bit Manipulation, Recursion, Simulationhttps://leetcode-solutions-5zk.pages.dev/posts/3307-find-the-k-th-character-in-string-game-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3307-find-the-k-th-character-in-string-game-ii/Hard | Math, Bit Manipulation, Recursionhttps://leetcode-solutions-5zk.pages.dev/posts/3309-maximum-possible-number-by-binary-concatenation/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3309-maximum-possible-number-by-binary-concatenation/Medium | Array, Bit Manipulation, Enumerationhttps://leetcode-solutions-5zk.pages.dev/posts/3314-construct-the-minimum-bitwise-array-i/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3314-construct-the-minimum-bitwise-array-i/Easy | Array, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/3315-construct-the-minimum-bitwise-array-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3315-construct-the-minimum-bitwise-array-ii/Medium | Array, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/3370-smallest-number-with-all-set-bits/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3370-smallest-number-with-all-set-bits/Easy | Math, Bit Manipulationhttps://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/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/3435-frequencies-of-shortest-supersequences/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3435-frequencies-of-shortest-supersequences/Hard | Array, String, Bit Manipulation, Graph Theory, Topological Sort, Enumerationhttps://leetcode-solutions-5zk.pages.dev/posts/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/3495-minimum-operations-to-make-array-elements-zero/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3495-minimum-operations-to-make-array-elements-zero/Hard | Array, Math, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/3513-number-of-unique-xor-triplets-i/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3513-number-of-unique-xor-triplets-i/Medium | Array, Math, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/3514-number-of-unique-xor-triplets-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3514-number-of-unique-xor-triplets-ii/Medium | Array, Math, Bit Manipulation, Enumerationhttps://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/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/3553-minimum-weighted-subgraph-with-the-required-paths-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3553-minimum-weighted-subgraph-with-the-required-paths-ii/Hard | Array, Dynamic Programming, Bit Manipulation, Tree, Depth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/3559-number-of-ways-to-assign-edge-weights-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3559-number-of-ways-to-assign-edge-weights-ii/Hard | Array, Math, Dynamic Programming, Bit Manipulation, Tree, Depth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/3566-partition-array-into-two-equal-product-subsets/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3566-partition-array-into-two-equal-product-subsets/Medium | Array, Bit Manipulation, Recursion, Enumerationhttps://leetcode-solutions-5zk.pages.dev/posts/3568-minimum-moves-to-clean-the-classroom/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3568-minimum-moves-to-clean-the-classroom/Medium | Array, Hash Table, Bit Manipulation, Breadth-First Search, Matrixhttps://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/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/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/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/3630-partition-array-for-maximum-xor-and-and/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3630-partition-array-for-maximum-xor-and-and/Hard | Array, Math, Greedy, Bit Manipulation, Enumerationhttps://leetcode-solutions-5zk.pages.dev/posts/3644-maximum-k-to-sort-a-permutation/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3644-maximum-k-to-sort-a-permutation/Medium | Array, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/3646-next-special-palindrome-number/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3646-next-special-palindrome-number/Hard | Backtracking, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/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/3674-minimum-operations-to-equalize-array/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3674-minimum-operations-to-equalize-array/Easy | Array, Bit Manipulation, Brainteaserhttps://leetcode-solutions-5zk.pages.dev/posts/3677-count-binary-palindromic-numbers/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3677-count-binary-palindromic-numbers/Hard | Math, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/3681-maximum-xor-of-subsequences/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3681-maximum-xor-of-subsequences/Hard | Array, Math, Greedy, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/3688-bitwise-or-of-even-numbers-in-an-array/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3688-bitwise-or-of-even-numbers-in-an-array/Easy | Array, Bit Manipulation, Simulationhttps://leetcode-solutions-5zk.pages.dev/posts/3702-longest-subsequence-with-non-zero-bitwise-xor/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3702-longest-subsequence-with-non-zero-bitwise-xor/Medium | Array, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/3750-minimum-number-of-flips-to-reverse-binary-string/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3750-minimum-number-of-flips-to-reverse-binary-string/Easy | Math, Two Pointers, String, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/3755-find-maximum-balanced-xor-subarray-length/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3755-find-maximum-balanced-xor-subarray-length/Medium | Array, Hash Table, Bit Manipulation, Prefix Sumhttps://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/3766-minimum-operations-to-make-binary-palindrome/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3766-minimum-operations-to-make-binary-palindrome/Medium | Array, Two Pointers, Binary Search, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/3801-minimum-cost-to-merge-sorted-lists/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3801-minimum-cost-to-merge-sorted-lists/Hard | Array, Two Pointers, Binary Search, Dynamic Programming, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/3806-maximum-bitwise-and-after-increment-operations/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3806-maximum-bitwise-and-after-increment-operations/Hard | Array, Greedy, Bit Manipulation, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/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/3821-find-nth-smallest-integer-with-k-one-bits/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3821-find-nth-smallest-integer-with-k-one-bits/Hard | Math, Bit Manipulation, Combinatoricshttps://leetcode-solutions-5zk.pages.dev/posts/3825-longest-strictly-increasing-subsequence-with-non-zero-bitwise-and/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3825-longest-strictly-increasing-subsequence-with-non-zero-bitwise-and/Medium | Array, Binary Search, Bit Manipulation, Enumerationhttps://leetcode-solutions-5zk.pages.dev/posts/3827-count-monobit-integers/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3827-count-monobit-integers/Easy | Bit Manipulation, Enumerationhttps://leetcode-solutions-5zk.pages.dev/posts/3845-maximum-subarray-xor-with-bounded-range/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3845-maximum-subarray-xor-with-bounded-range/Hard | Array, Bit Manipulation, Trie, Queue, Sliding Window, Prefix Sum, Monotonic Queuehttps://leetcode-solutions-5zk.pages.dev/posts/3849-maximum-bitwise-xor-after-rearrangement/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3849-maximum-bitwise-xor-after-rearrangement/Medium | String, Greedy, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/3858-minimum-bitwise-or-from-grid/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3858-minimum-bitwise-or-from-grid/Medium | Array, Greedy, Bit Manipulation, Matrixhttps://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/3878-count-good-subarrays/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3878-count-good-subarrays/Hard | Array, Stack, Bit Manipulation, Monotonic Stackhttps://leetcode-solutions-5zk.pages.dev/posts/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/2980-check-if-bitwise-or-has-trailing-zeros/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2980-check-if-bitwise-or-has-trailing-zeros/Easy | Array, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/2997-minimum-number-of-operations-to-make-array-xor-equal-to-k/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2997-minimum-number-of-operations-to-make-array-xor-equal-to-k/Medium | Array, Bit Manipulationhttps://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/3011-find-if-array-can-be-sorted/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3011-find-if-array-can-be-sorted/Medium | Array, Bit Manipulation, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/3022-minimize-or-of-remaining-elements-using-operations/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3022-minimize-or-of-remaining-elements-using-operations/Hard | Array, Greedy, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/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/3095-shortest-subarray-with-or-at-least-k-i/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3095-shortest-subarray-with-or-at-least-k-i/Easy | Array, Bit Manipulation, Sliding Windowhttps://leetcode-solutions-5zk.pages.dev/posts/3097-shortest-subarray-with-or-at-least-k-ii/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3097-shortest-subarray-with-or-at-least-k-ii/Medium | Array, Bit Manipulation, Sliding Windowhttps://leetcode-solutions-5zk.pages.dev/posts/3108-minimum-cost-walk-in-weighted-graph/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3108-minimum-cost-walk-in-weighted-graph/Hard | Array, Bit Manipulation, Union-Find, Graph Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/3116-kth-smallest-amount-with-single-denomination-combination/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3116-kth-smallest-amount-with-single-denomination-combination/Hard | Array, Math, Binary Search, Bit Manipulation, Combinatorics, Number Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/3117-minimum-sum-of-values-by-dividing-array/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3117-minimum-sum-of-values-by-dividing-array/Hard | Array, Binary Search, Dynamic Programming, Bit Manipulation, Segment Tree, Queuehttps://leetcode-solutions-5zk.pages.dev/posts/3133-minimum-array-end/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3133-minimum-array-end/Medium | Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/3145-find-products-of-elements-of-big-array/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3145-find-products-of-elements-of-big-array/Hard | Array, Binary Search, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/3149-find-the-minimum-cost-array-permutation/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3149-find-the-minimum-cost-array-permutation/Hard | Array, Dynamic Programming, Bit Manipulation, Bitmaskhttps://leetcode-solutions-5zk.pages.dev/posts/3154-find-number-of-ways-to-reach-the-k-th-stair/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3154-find-number-of-ways-to-reach-the-k-th-stair/Hard | Math, Dynamic Programming, Bit Manipulation, Memoization, Combinatoricshttps://leetcode-solutions-5zk.pages.dev/posts/3158-find-the-xor-of-numbers-which-appear-twice/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3158-find-the-xor-of-numbers-which-appear-twice/Easy | Array, Hash Table, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/3171-find-subarray-with-bitwise-or-closest-to-k/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3171-find-subarray-with-bitwise-or-closest-to-k/Hard | Array, Binary Search, Bit Manipulation, Segment Treehttps://leetcode-solutions-5zk.pages.dev/posts/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/3191-minimum-operations-to-make-binary-array-elements-equal-to-one-i/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3191-minimum-operations-to-make-binary-array-elements-equal-to-one-i/Medium | Array, Bit Manipulation, Queue, Sliding Window, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/2657-find-the-prefix-common-array-of-two-arrays/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2657-find-the-prefix-common-array-of-two-arrays/Medium | Array, Hash Table, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/2680-maximum-or/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2680-maximum-or/Medium | Array, Greedy, Bit Manipulation, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/2683-neighboring-bitwise-xor/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2683-neighboring-bitwise-xor/Medium | Array, Bit Manipulationhttps://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/2732-find-a-good-subset-of-the-matrix/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2732-find-a-good-subset-of-the-matrix/Hard | Array, Hash Table, Bit Manipulation, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/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/2749-minimum-operations-to-make-the-integer-zero/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2749-minimum-operations-to-make-the-integer-zero/Medium | Bit Manipulation, Brainteaser, Enumerationhttps://leetcode-solutions-5zk.pages.dev/posts/2835-minimum-operations-to-form-subsequence-with-target-sum/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2835-minimum-operations-to-form-subsequence-with-target-sum/Hard | Array, Greedy, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/2836-maximize-value-of-function-in-a-ball-passing-game/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2836-maximize-value-of-function-in-a-ball-passing-game/Hard | Array, Dynamic Programming, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/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/2857-count-pairs-of-points-with-distance-k/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2857-count-pairs-of-points-with-distance-k/Medium | Array, Hash Table, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/2859-sum-of-values-at-indices-with-k-set-bits/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2859-sum-of-values-at-indices-with-k-set-bits/Easy | Array, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/2869-minimum-operations-to-collect-elements/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2869-minimum-operations-to-collect-elements/Easy | Array, Hash Table, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/2871-split-array-into-maximum-number-of-subarrays/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2871-split-array-into-maximum-number-of-subarrays/Medium | Array, Greedy, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/2897-apply-operations-on-array-to-maximize-sum-of-squares/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2897-apply-operations-on-array-to-maximize-sum-of-squares/Hard | Array, Hash Table, Greedy, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/2917-find-the-k-or-of-an-array/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2917-find-the-k-or-of-an-array/Easy | Array, Bit Manipulationhttps://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/2932-maximum-strong-pair-xor-i/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2932-maximum-strong-pair-xor-i/Easy | Array, Hash Table, Bit Manipulation, Trie, Sliding Windowhttps://leetcode-solutions-5zk.pages.dev/posts/2935-maximum-strong-pair-xor-ii/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2935-maximum-strong-pair-xor-ii/Hard | Array, Hash Table, Bit Manipulation, Trie, Sliding Windowhttps://leetcode-solutions-5zk.pages.dev/posts/2939-maximum-xor-product/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2939-maximum-xor-product/Medium | Math, Greedy, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/2959-number-of-possible-sets-of-closing-branches/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2959-number-of-possible-sets-of-closing-branches/Hard | Bit Manipulation, Graph Theory, Heap (Priority Queue), Enumeration, Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/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/2032-two-out-of-three/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2032-two-out-of-three/Easy | Array, Hash Table, Bit Manipulationhttps://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/2044-count-number-of-maximum-bitwise-or-subsets/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2044-count-number-of-maximum-bitwise-or-subsets/Medium | Array, Backtracking, Bit Manipulation, Enumerationhttps://leetcode-solutions-5zk.pages.dev/posts/2135-count-words-obtained-after-adding-a-letter/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2135-count-words-obtained-after-adding-a-letter/Medium | Array, Hash Table, String, Bit Manipulation, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/2157-groups-of-strings/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2157-groups-of-strings/Hard | Array, Hash Table, String, Bit Manipulation, Union-Findhttps://leetcode-solutions-5zk.pages.dev/posts/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/2206-divide-array-into-equal-pairs/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2206-divide-array-into-equal-pairs/Easy | Array, Hash Table, Bit Manipulation, Countinghttps://leetcode-solutions-5zk.pages.dev/posts/2212-maximum-points-in-an-archery-competition/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2212-maximum-points-in-an-archery-competition/Medium | Array, Backtracking, Bit Manipulation, Enumerationhttps://leetcode-solutions-5zk.pages.dev/posts/2220-minimum-bit-flips-to-convert-number/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2220-minimum-bit-flips-to-convert-number/Easy | Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/2275-largest-combination-with-bitwise-and-greater-than-zero/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2275-largest-combination-with-bitwise-and-greater-than-zero/Medium | Array, Hash Table, Bit Manipulation, Countinghttps://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/2306-naming-a-company/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2306-naming-a-company/Hard | Array, Hash Table, String, Bit Manipulation, Enumerationhttps://leetcode-solutions-5zk.pages.dev/posts/2317-maximum-xor-after-operations/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2317-maximum-xor-after-operations/Medium | Array, Math, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/2322-minimum-score-after-removals-on-a-tree/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2322-minimum-score-after-removals-on-a-tree/Hard | Array, Bit Manipulation, Tree, Depth-First Searchhttps://leetcode-solutions-5zk.pages.dev/posts/2351-first-letter-to-appear-twice/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2351-first-letter-to-appear-twice/Easy | Hash Table, String, Bit Manipulation, Countinghttps://leetcode-solutions-5zk.pages.dev/posts/2354-number-of-excellent-pairs/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2354-number-of-excellent-pairs/Hard | Array, Hash Table, Binary Search, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/2401-longest-nice-subarray/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2401-longest-nice-subarray/Medium | Array, Bit Manipulation, Sliding Windowhttps://leetcode-solutions-5zk.pages.dev/posts/2411-smallest-subarrays-with-maximum-bitwise-or/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2411-smallest-subarrays-with-maximum-bitwise-or/Medium | Array, Binary Search, Bit Manipulation, Sliding Windowhttps://leetcode-solutions-5zk.pages.dev/posts/2419-longest-subarray-with-maximum-bitwise-and/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2419-longest-subarray-with-maximum-bitwise-and/Medium | Array, Bit Manipulation, Brainteaserhttps://leetcode-solutions-5zk.pages.dev/posts/2425-bitwise-xor-of-all-pairings/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2425-bitwise-xor-of-all-pairings/Medium | Array, Bit Manipulation, Brainteaserhttps://leetcode-solutions-5zk.pages.dev/posts/2429-minimize-xor/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2429-minimize-xor/Medium | Greedy, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/2433-find-the-original-array-of-prefix-xor/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2433-find-the-original-array-of-prefix-xor/Medium | Array, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/2438-range-product-queries-of-powers/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2438-range-product-queries-of-powers/Medium | Array, Bit Manipulation, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/2506-count-pairs-of-similar-strings/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2506-count-pairs-of-similar-strings/Easy | Array, Hash Table, String, Bit Manipulation, Countinghttps://leetcode-solutions-5zk.pages.dev/posts/2527-find-xor-beauty-of-array/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2527-find-xor-beauty-of-array/Medium | Array, Math, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/2546-apply-bitwise-operations-to-make-strings-equal/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2546-apply-bitwise-operations-to-make-strings-equal/Medium | String, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/2564-substring-xor-queries/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2564-substring-xor-queries/Medium | Array, Hash Table, String, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/2568-minimum-impossible-or/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2568-minimum-impossible-or/Medium | Array, Bit Manipulation, Brainteaserhttps://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/2588-count-the-number-of-beautiful-subarrays/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2588-count-the-number-of-beautiful-subarrays/Medium | Array, Hash Table, Bit Manipulation, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/2595-number-of-even-and-odd-bits/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2595-number-of-even-and-odd-bits/Easy | Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/1284-minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1284-minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix/Hard | Array, Hash Table, Bit Manipulation, Breadth-First Search, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/1310-xor-queries-of-a-subarray/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1310-xor-queries-of-a-subarray/Medium | Array, Bit Manipulation, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/1318-minimum-flips-to-make-a-or-b-equal-to-c/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1318-minimum-flips-to-make-a-or-b-equal-to-c/Medium | Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/1342-number-of-steps-to-reduce-a-number-to-zero/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1342-number-of-steps-to-reduce-a-number-to-zero/Easy | Math, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/1371-find-the-longest-substring-containing-vowels-in-even-counts/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1371-find-the-longest-substring-containing-vowels-in-even-counts/Medium | Hash Table, String, Bit Manipulation, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/1386-cinema-seat-allocation/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1386-cinema-seat-allocation/Medium | Array, Hash Table, Greedy, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/1404-number-of-steps-to-reduce-a-number-in-binary-representation-to-one/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1404-number-of-steps-to-reduce-a-number-in-binary-representation-to-one/Medium | String, Bit Manipulation, Simulationhttps://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/1457-pseudo-palindromic-paths-in-a-binary-tree/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1457-pseudo-palindromic-paths-in-a-binary-tree/Medium | Bit Manipulation, Tree, Depth-First Search, Breadth-First Search, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/1461-check-if-a-string-contains-all-binary-codes-of-size-k/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1461-check-if-a-string-contains-all-binary-codes-of-size-k/Medium | Hash Table, String, Bit Manipulation, Rolling Hash, Hash Functionhttps://leetcode-solutions-5zk.pages.dev/posts/1486-xor-operation-in-an-array/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1486-xor-operation-in-an-array/Easy | Math, Bit Manipulationhttps://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/1521-find-a-value-of-a-mysterious-function-closest-to-target/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1521-find-a-value-of-a-mysterious-function-closest-to-target/Hard | Array, Binary Search, Bit Manipulation, Segment Treehttps://leetcode-solutions-5zk.pages.dev/posts/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/1542-find-longest-awesome-substring/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1542-find-longest-awesome-substring/Hard | Hash Table, String, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/1558-minimum-numbers-of-function-calls-to-make-target-array/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1558-minimum-numbers-of-function-calls-to-make-target-array/Medium | Array, Greedy, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/1601-maximum-number-of-achievable-transfer-requests/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1601-maximum-number-of-achievable-transfer-requests/Hard | Array, Backtracking, Bit Manipulation, Enumerationhttps://leetcode-solutions-5zk.pages.dev/posts/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/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/1680-concatenation-of-consecutive-binary-numbers/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1680-concatenation-of-consecutive-binary-numbers/Medium | Math, Bit Manipulation, Simulationhttps://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/1707-maximum-xor-with-an-element-from-array/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1707-maximum-xor-with-an-element-from-array/Hard | Array, Bit Manipulation, Triehttps://leetcode-solutions-5zk.pages.dev/posts/1720-decode-xored-array/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1720-decode-xored-array/Easy | Array, Bit Manipulationhttps://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/1734-decode-xored-permutation/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1734-decode-xored-permutation/Medium | Array, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/1738-find-kth-largest-xor-coordinate-value/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1738-find-kth-largest-xor-coordinate-value/Medium | Array, Divide and Conquer, Bit Manipulation, Sorting, Heap (Priority Queue), Matrix, Prefix Sum, Quickselecthttps://leetcode-solutions-5zk.pages.dev/posts/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/1763-longest-nice-substring/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1763-longest-nice-substring/Easy | Hash Table, String, Divide and Conquer, Bit Manipulation, Sliding Windowhttps://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/1829-maximum-xor-for-each-query/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1829-maximum-xor-for-each-query/Medium | Array, Bit Manipulation, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/1835-find-xor-sum-of-all-pairs-bitwise-and/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1835-find-xor-sum-of-all-pairs-bitwise-and/Hard | Array, Math, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/1863-sum-of-all-subset-xor-totals/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1863-sum-of-all-subset-xor-totals/Easy | Array, Math, Backtracking, Bit Manipulation, Combinatorics, Enumerationhttps://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/1930-unique-length-3-palindromic-subsequences/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1930-unique-length-3-palindromic-subsequences/Medium | Hash Table, String, Bit Manipulation, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/1938-maximum-genetic-difference-query/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1938-maximum-genetic-difference-query/Hard | Array, Hash Table, Bit Manipulation, Depth-First Search, Triehttps://leetcode-solutions-5zk.pages.dev/posts/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/1009-complement-of-base-10-integer/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1009-complement-of-base-10-integer/Easy | Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/1016-binary-string-with-substrings-representing-1-to-n/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1016-binary-string-with-substrings-representing-1-to-n/Medium | Hash Table, String, Bit Manipulation, Sliding Windowhttps://leetcode-solutions-5zk.pages.dev/posts/1018-binary-prefix-divisible-by-5/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1018-binary-prefix-divisible-by-5/Easy | Array, Bit Manipulationhttps://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/1177-can-make-palindrome-from-substring/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1177-can-make-palindrome-from-substring/Medium | Array, Hash Table, String, Bit Manipulation, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/1178-number-of-valid-words-for-each-puzzle/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1178-number-of-valid-words-for-each-puzzle/Hard | Array, Hash Table, String, Bit Manipulation, Triehttps://leetcode-solutions-5zk.pages.dev/posts/1238-circular-permutation-in-binary-representation/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1238-circular-permutation-in-binary-representation/Medium | Math, Backtracking, Bit Manipulationhttps://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/0756-pyramid-transition-matrix/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0756-pyramid-transition-matrix/Medium | Hash Table, String, Backtracking, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/0762-prime-number-of-set-bits-in-binary-representation/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0762-prime-number-of-set-bits-in-binary-representation/Easy | Math, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/0779-k-th-symbol-in-grammar/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0779-k-th-symbol-in-grammar/Medium | Math, Bit Manipulation, Recursionhttps://leetcode-solutions-5zk.pages.dev/posts/0782-transform-to-chessboard/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0782-transform-to-chessboard/Hard | Array, Math, Bit Manipulation, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/0784-letter-case-permutation/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0784-letter-case-permutation/Medium | String, Backtracking, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/0805-split-array-with-same-average/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0805-split-array-with-same-average/Hard | Array, Hash Table, Math, Dynamic Programming, Bit Manipulation, Bitmaskhttps://leetcode-solutions-5zk.pages.dev/posts/0810-chalkboard-xor-game/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0810-chalkboard-xor-game/Hard | Array, Math, Bit Manipulation, Brainteaser, Game Theoryhttps://leetcode-solutions-5zk.pages.dev/posts/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/0861-score-after-flipping-matrix/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0861-score-after-flipping-matrix/Medium | Array, Greedy, Bit Manipulation, Matrixhttps://leetcode-solutions-5zk.pages.dev/posts/0868-binary-gap/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0868-binary-gap/Easy | Bit Manipulationhttps://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/0957-prison-cells-after-n-days/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0957-prison-cells-after-n-days/Medium | Array, Hash Table, Math, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/0995-minimum-number-of-k-consecutive-bit-flips/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0995-minimum-number-of-k-consecutive-bit-flips/Hard | Array, Bit Manipulation, Queue, Sliding Window, Prefix Sumhttps://leetcode-solutions-5zk.pages.dev/posts/0491-non-decreasing-subsequences/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0491-non-decreasing-subsequences/Medium | Array, Hash Table, Backtracking, Bit Manipulationhttps://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/0645-set-mismatch/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0645-set-mismatch/Easy | Array, Hash Table, Bit Manipulation, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/0672-bulb-switcher-ii/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0672-bulb-switcher-ii/Medium | Math, Bit Manipulation, Depth-First Search, Breadth-First Searchhttps://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/0693-binary-number-with-alternating-bits/Tue, 21 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0693-binary-number-with-alternating-bits/Easy | Bit Manipulationhttps://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/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/0342-power-of-four/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0342-power-of-four/Easy | Math, Bit Manipulation, Recursionhttps://leetcode-solutions-5zk.pages.dev/posts/0371-sum-of-two-integers/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0371-sum-of-two-integers/Medium | Math, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/0389-find-the-difference/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0389-find-the-difference/Easy | Hash Table, String, Bit Manipulation, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/0393-utf-8-validation/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0393-utf-8-validation/Medium | Array, Bit Manipulationhttps://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/0405-convert-a-number-to-hexadecimal/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0405-convert-a-number-to-hexadecimal/Easy | Math, String, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/0421-maximum-xor-of-two-numbers-in-an-array/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0421-maximum-xor-of-two-numbers-in-an-array/Medium | Array, Hash Table, Bit Manipulation, Triehttps://leetcode-solutions-5zk.pages.dev/posts/0461-hamming-distance/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0461-hamming-distance/Easy | Bit Manipulationhttps://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, Bitmaskhttps://leetcode-solutions-5zk.pages.dev/posts/0476-number-complement/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0476-number-complement/Easy | Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/0477-total-hamming-distance/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0477-total-hamming-distance/Medium | Array, Math, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/0136-single-number/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0136-single-number/Easy | Array, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/0137-single-number-ii/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0137-single-number-ii/Medium | Array, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/0187-repeated-dna-sequences/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0187-repeated-dna-sequences/Medium | Hash Table, String, Bit Manipulation, Sliding Window, Rolling Hash, Hash Functionhttps://leetcode-solutions-5zk.pages.dev/posts/0190-reverse-bits/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0190-reverse-bits/Easy | Divide and Conquer, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/0191-number-of-1-bits/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0191-number-of-1-bits/Easy | Divide and Conquer, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/0201-bitwise-and-of-numbers-range/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0201-bitwise-and-of-numbers-range/Medium | Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/0222-count-complete-tree-nodes/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0222-count-complete-tree-nodes/Easy | Binary Search, Bit Manipulation, Tree, Binary Treehttps://leetcode-solutions-5zk.pages.dev/posts/0231-power-of-two/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0231-power-of-two/Easy | Math, Bit Manipulation, Recursionhttps://leetcode-solutions-5zk.pages.dev/posts/0260-single-number-iii/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0260-single-number-iii/Medium | Array, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/0268-missing-number/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0268-missing-number/Easy | Array, Hash Table, Math, Binary Search, Bit Manipulation, Sortinghttps://leetcode-solutions-5zk.pages.dev/posts/0287-find-the-duplicate-number/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0287-find-the-duplicate-number/Medium | Array, Two Pointers, Binary Search, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/0029-divide-two-integers/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0029-divide-two-integers/Medium | Math, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/0067-add-binary/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0067-add-binary/Easy | Math, String, Bit Manipulation, Simulationhttps://leetcode-solutions-5zk.pages.dev/posts/0078-subsets/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0078-subsets/Medium | Array, Backtracking, Bit Manipulationhttps://leetcode-solutions-5zk.pages.dev/posts/0089-gray-code/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0089-gray-code/Medium | Math, Backtracking, Bit Manipulation