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