Given an integer array arr, consider every non empty contiguous subarray of arr. For each such subarray, compute the bitwise OR of all its elements. Return the number of distinct values that can appear among these bitwise OR results.

Constraints:

• $1 \leq$ arr.length $\leq 5 \cdot 10^4$

• $0 \leq$ arr[i] $\leq 10^9$

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.