https://leetcode.com/problems/minimum-number-of-operations-to-make-array-xor-equal-to-k/description/

Bit diff between k and nums xor #medium #bit_manipulation

https://leetcode.com/problems/number-of-wonderful-substrings/description/

Count substrings with at most one odd frequency #medium #bit_manipulation

https://leetcode.com/problems/count-triplets-that-can-form-two-arrays-of-equal-xor/description/

Number (i,j,k) where xor arr[i..j] = xor arr[j..k] #medium #bit_manipulation

https://leetcode.com/problems/single-number-iii/description/

Two not duplicated numbers from array #medium #bit_manipulation

https://leetcode.com/problems/number-complement/description/

Invert bits: 101 becomes 010 #easy #bit_manipulation

https://leetcode.com/problems/minimum-bit-flips-to-convert-number/description/

Bit diff between two numbers #easy #bit_manipulation

https://leetcode.com/problems/xor-queries-of-a-subarray/description/

Run queries[[from, to]] of xor(arr[from..to]) #medium #bit_manipulation

https://leetcode.com/problems/longest-subarray-with-maximum-bitwise-and/description/

Max bitwise AND subarray #medium #bit_manipulation #two_pointers

https://leetcode.com/problems/find-the-longest-substring-containing-vowels-in-even-counts/description/

Longest substring with even number of "aeiou" #medium #bit_manipulation #two_pointers

https://leetcode.com/problems/find-kth-bit-in-nth-binary-string/description/


k`th bit of sequence `bs[i] = bs[i-1] + '1' + rev(inv(bs[i-1])) #medium #bit_manipulation

https://leetcode.com/problems/largest-combination-with-bitwise-and-greater-than-zero/description/


Max positive AND-subset #medium #bit_manipulation

https://leetcode.com/problems/maximum-xor-for-each-query/description/


Running xor to make 2^k-1 #medium #bit_manipulation

https://leetcode.com/problems/minimum-array-end/description/


`n`th of increasing sequence with `AND[..]=x` #medium #bit_manipulation

https://leetcode.com/problems/shortest-subarray-with-or-at-least-k-ii/description/


Min subarray with OR[..] >= k #medium #bit_manipulation #sliding_window

Max window of all pairs AND zero #medium #two_pointers #bit_manipulation


https://leetcode.com/problems/longest-nice-subarray/description/

3-bits flips to make all 1 #medium #bit_manipulation


https://leetcode.com/problems/minimum-operations-to-make-binary-array-elements-equal-to-one-i/description/

Min AND of path weights #hard #bit_manipulation #union-find


https://leetcode.com/problems/minimum-cost-walk-in-weighted-graph/description

Sum of all subsets xors #easy #bit #math


https://leetcode.com/problems/sum-of-all-subset-xor-totals/description

https://leetcode.com/problems/count-good-triplets-in-an-array/description/


Triplets in same order in both (0..n)-arrays #hard #bit

# 4.07.2025
[3307. Find the K-th Character in String Game II](https://leetcode.com/problems/find-the-k-th-character-in-string-game-ii/description) hard


kth char in double+shift by ops[i] string #hard #bit_manipulation