Jul 30

Author: siddydutta

2025-07-July-LeetCoding-Challenge/Longest Subarray With Maximum Bitwise AND.py

@@ -0,0 +1,23 @@
+class Solution:
+    def longestSubarray(self, nums: list[int]) -> int:
+        max_num = max(nums)
+        curr_length, max_length = 0, 1
+        for num in nums:
+            if num == max_num:
+                curr_length += 1
+            else:
+                curr_length = 0
+            max_length = max(max_length, curr_length)
+        return max_length
+
+
+def main():
+    nums = [1, 2, 3, 3, 2, 2]
+    assert Solution().longestSubarray(nums) == 2
+
+    nums = [1, 2, 3, 4]
+    assert Solution().longestSubarray(nums) == 1
+
+
+if __name__ == '__main__':
+    main()

2025-07-July-LeetCoding-Challenge/README.md

@@ -32,14 +32,14 @@
 | July 26 | [3480. Maximize Subarrays After Removing One Conflicting Pair](https://leetcode.com/problems/maximize-subarrays-after-removing-one-conflicting-pair/) | Hard | Unsolved |
 | July 27 | [2210. Count Hills and Valleys in an Array](https://leetcode.com/problems/count-hills-and-valleys-in-an-array/) | Easy | Solved |
 | July 28 | [2044. Count Number of Maximum Bitwise-OR Subsets](https://leetcode.com/problems/count-number-of-maximum-bitwise-or-subsets/) | Medium | Solved |
-| July 29 | []() |  |  |
-| July 30 | []() |  |  |
+| July 29 | [2411. Smallest Subarrays With Maximum Bitwise OR](https://leetcode.com/problems/smallest-subarrays-with-maximum-bitwise-or/) | Medium | Unsolved |
+| July 30 | [2419. Longest Subarray With Maximum Bitwise AND](https://leetcode.com/problems/longest-subarray-with-maximum-bitwise-and/) | Medium | Solved |
 | July 31 | []() |  |  |
 
 
 ## Summary
 | Level  | Problems | Solved | Unsolved |
 | ---    | --- | --- | --- |
 | Easy   | 7 | 7 | 0 |
-| Medium | 11 | 10 | 1 |
+| Medium | 13 | 11 | 2 |
 | Hard   | 9 | 1 | 8 |