Leetcode 3209. Number of Subarrays With AND Value of K

Count the contiguous subarrays whose bitwise AND equals k; the key observation is that AND values are non‑increasing as you extend a subarray, so there are only O(bitwidth) distinct AND results ending at each index, enabling an O(n * bitwidth) solution for n up to 1e5.