GIVE ME THE CODE

Longest OR

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.