Python code for :

There is an array of n integers, arr, and two integers mn and mx$.$

For each of arr's subarrays, find the binary value of the bitwise OR of all elements. If the number of $1$ bits is between mn and mx$,$ inclusive, it is a good subarray.

Determine the length of the longest good subarray.

Note: A subarray is any segment of adjacent elements in an array. For example, if arr $=[1,2,3],[1,2]$ is a subarray but $[1,3]$ is not.

Example

mn$=1$

mx $=2$

n$=5$

arr $=[0,3,4,1,5]$

Consider the subarray $[3,4,1].$ It has an OR of $7(111)2$ which has three $1$ bits. Three one

bits exceeds mx $=2,$ so this is not a good subarray.

Function Description

Complete the function longestOR in the editor below.

longestOR has the following parameters:

int mn: the minimum number of bits

int mx: the maximum number of bits

int arr$[$n$]$: the array to analyze

Returns

int: the length of the longest good subarray

Constraints

$1<=$n$<=100000$

$0<=$ mn$<=$ rmx $<=30$

$0<=$ arr$[$i$]<2$ power $31$