count-good-subarrays

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

You are given an integer array <code>nums</code>.

A subarray is called good if the bitwise OR of all its elements is equal to at least one element present in that subarray.

Return the number of good subarrays in <code>nums</code>.

Here, the bitwise OR of two integers <code>a</code> and <code>b</code> is denoted by <code>a | b</code>.

&nbsp;
Example 1:

<div class="example-block">
Input: nums = [4,2,3]

Output: 4

Explanation:

The subarrays of <code>nums</code> are:

<table style="border: 1px solid black;">
	<tbody>
		<tr>
			<th style="border: 1px solid black;">Subarray</th>
			<th style="border: 1px solid black;">Bitwise OR</th>
			<th style="border: 1px solid black;">Present in Subarray</th>
		</tr>
		<tr>
			<td style="border: 1px solid black;"><code>[4]</code></td>
			<td style="border: 1px solid black;"><code>4 = 4</code></td>
			<td style="border: 1px solid black;">Yes</td>
		</tr>
		<tr>
			<td style="border: 1px solid black;"><code>[2]</code></td>
			<td style="border: 1px solid black;"><code>2 = 2</code></td>
			<td style="border: 1px solid black;">Yes</td>
		</tr>
		<tr>
			<td style="border: 1px solid black;"><code>[3]</code></td>
			<td style="border: 1px solid black;"><code>3 = 3</code></td>
			<td style="border: 1px solid black;">Yes</td>
		</tr>
		<tr>
			<td style="border: 1px solid black;"><code>[4, 2]</code></td>
			<td style="border: 1px solid black;"><code>4 | 2 = 6</code></td>
			<td style="border: 1px solid black;">No</td>
		</tr>
		<tr>
			<td style="border: 1px solid black;"><code>[2, 3]</code></td>
			<td style="border: 1px solid black;"><code>2 | 3 = 3</code></td>
			<td style="border: 1px solid black;">Yes</td>
		</tr>
		<tr>
			<td style="border: 1px solid black;"><code>[4, 2, 3]</code></td>
			<td style="border: 1px solid black;"><code>4 | 2 | 3 = 7</code></td>
			<td style="border: 1px solid black;">No</td>
		</tr>
	</tbody>
</table>

Thus, the good subarrays of <code>nums</code> are <code>[4]</code>, <code>[2]</code>, <code>[3]</code> and <code>[2, 3]</code>. Thus, the answer is 4.
</div>

Example 2:

<div class="example-block">
Input: nums = [1,3,1]

Output: 6

Explanation:

Any subarray of <code>nums</code> containing 3 has bitwise OR equal to 3, and subarrays containing only 1 have bitwise OR equal to 1.

In both cases, the result is present in the subarray, so all subarrays are good, and the answer is 6.
</div>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums.length &lt;= 105</code></li>
	<li><code>0 &lt;= nums[i] &lt;= 109</code></li>
</ul>

Subarray	Bitwise OR	Present in Subarray
`[4]`	`4 = 4`	Yes
`[2]`	`2 = 2`	Yes
`[3]`	`3 = 3`	Yes
`[4, 2]`	`4 \| 2 = 6`	No
`[2, 3]`	`2 \| 3 = 3`	Yes
`[4, 2, 3]`	`4 \| 2 \| 3 = 7`	No