Leetcode 2917. Find the K-or of an Array

Compute the integer whose bit j is 1 iff at least k elements of nums have bit j set — equivalently, count ones per bit position and set bits with count >= k. Constraints: n ≤ 50 and nums are 31-bit nonnegative integers.