Number of Subarrays with Or less than K

Sliding Window / 2 Pointer Contest Hard

Given an integer array nums and an integer k, return the number of subarrays whose bitwise OR of elements is less than or equal to k.

Constraints

[ ]

✅ Testcase

Input: {'k': '4', 'nums': '[2, 3, 3, 2, 9, 2, 5]'}

Expected:
11

Actual: -

Time: - sec

Status: Waiting