FPEvalRepoPublic/LeetCodeMetaData
0399
1{2 "id": 2503,3 "name": "longest-subarray-with-maximum-bitwise-and",4 "difficulty": "Medium",5 "link": "https://leetcode.com/problems/longest-subarray-with-maximum-bitwise-and/",6 "date": "2022-09-18",7 "task_description": "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`",8 "test_case": [9 {10 "label": "Example 1",11 "input": "nums = [1,2,3,3,2,2]",12 "output": "2 "13 },14 {15 "label": "Example 2",16 "input": "nums = [1,2,3,4]",17 "output": "1 "18 }19 ],20 "constraints": [21 "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.",22 "1 <= nums.length <= 105",23 "1 <= nums[i] <= 106"24 ],25 "python_template": "class Solution(object):\n def longestSubarray(self, nums):\n \"\"\"\n :type nums: List[int]\n :rtype: int\n \"\"\"\n ",26 "java_template": "class Solution {\n public int longestSubarray(int[] nums) {\n \n }\n}",27 "metadata": {28 "func_name": "longestSubarray"29 }30}