You are given a $0$ indexed integer array nums and an integer k.

The K or of the array is computed such that the bit at position $i$ is set to $1$ if and only if at least k elements in nums have the bit at position $i$ set to $1$.

Return the integer representing the K or of nums.

Constraints:

• $1 \leq$ nums.length $\leq 50$

• $0 \leq$ nums[i] $< 2^{31}$

• $1 \leq$ k $\leq$ nums.length

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.