Today I have done leetcode's July LeetCoding Challenge with cpp.

July LeetCoding Challenge 30

Description

Longest Subarray With Maximum Bitwise AND

You are given an integer array nums of size n.

Consider a non-empty subarray from nums that has the maximum possible bitwise AND.

• In other words, let k be the maximum value of the bitwise AND of any subarray of nums. Then, only subarrays with a bitwise AND equal to k should be considered.

Return the length of the longest such subarray.

The bitwise AND of an array is the bitwise AND of all the numbers in it.

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

Example 1:

Input: nums = [1,2,3,3,2,2]
Output: 2
Explanation:
The maximum possible bitwise AND of a subarray is 3.
The longest subarray with that value is [3,3], so we return 2.

Example 2:

Input: nums = [1,2,3,4]
Output: 1
Explanation:
The maximum possible bitwise AND of a subarray is 4.
The longest subarray with that value is [4], so we return 1.

Constraints:

• 1 <= nums.length <= 105
• 1 <= nums[i] <= 106

Solution

class Solution {
public:
  int longestSubarray(vector<int>& nums) {
    int mmax = *max_element(nums.begin(), nums.end());

    int count = 0;
    int answer = 0;
    for(auto n : nums) {
      if(n == mmax) {
        count += 1;
      } else {
        count = 0;
      }
      answer = max(count, answer);
    }
    return answer;
  }
};

// Accepted
// 52/52 cases passed (4 ms)
// Your runtime beats 27.88 % of cpp submissions
// Your memory usage beats 38.1 % of cpp submissions (86.2 MB)