Longest Nice Subarray
Try to solve the Longest Nice Subarray problem.
We'll cover the following...
We'll cover the following...
Statement
Given an integer array nums, a subarray is called nice if for every pair of distinct indices i and j within that subarray, the bitwise AND of the two values is equal to