You are given an array nums of nonnegative integers.

The score of a subarray is defined as the bitwise AND of all its elements. The total score of a split of nums into one or more contiguous subarrays is the sum of the scores of all the subarrays.

Determine the maximum number of contiguous subarrays that nums can be split into such that the total score is minimized.

Note: A subarray is a contiguous sequence of elements within an array.

Constraints:

• $1 \leq$ nums.length $\leq 10^5$

• $0 \leq$ nums[i] $\leq 10^6$

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.