Create 2419. Longest Subarray With Maximum Bitwise A1ND1

Author: Chayandas07

2419. Longest Subarray With Maximum Bitwise A1ND

@@ -0,0 +1,15 @@
+class Solution {
+public:
+    int longestSubarray(vector<int>& nums) {
+        int maxi = *max_element(nums.begin(), nums.end());
+        int ans = 0;
+        int size = 0;
+        for (auto it : nums) {
+            if (it == maxi)
+                ans = max(ans, ++size);
+            else
+                size = 0;
+        }
+        return ans;
+    }
+};