https://leetcode.com/problems/maximum-xor-for-each-query/description/
Running
Running
xor
to make 2^k-1
#medium #bit_manipulation👍1
https://leetcode.com/problems/minimum-array-end/description/
`
`
n`th of increasing sequence with `AND[..]=x
` #medium #bit_manipulation👍2
https://leetcode.com/problems/shortest-subarray-with-or-at-least-k-ii/description/
Min subarray with
Min subarray with
OR[..] >= k
#medium #bit_manipulation #sliding_window👍3🤣1
Max window of all pairs AND zero #medium #two_pointers #bit_manipulation
https://leetcode.com/problems/longest-nice-subarray/description/
https://leetcode.com/problems/longest-nice-subarray/description/
👍1🔥1
Min AND of path weights #hard #bit_manipulation #union-find
https://leetcode.com/problems/minimum-cost-walk-in-weighted-graph/description
https://leetcode.com/problems/minimum-cost-walk-in-weighted-graph/description
👍2🔥1
# 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
[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
👍2