Simple bits manipulation solution || c++ || beats 100%
IntuitionApproachComplexity
Time complexity:O(n)

Space complexity:O(1)
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:O(n)
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:O(1)
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```cpp []
class Solution {
public:
    int maxSubarrays(vector<int>& nums) {
        int minVal = INT_MAX;
        int n = nums.size();
        if(n == 1){
            return 1;
        }
        for(int i = 0;i<n;i++){
            minVal = minVal & nums[i];
        }
        if(minVal != 0){
            return 1;
        }
        int checkVal = INT_MAX;
        int cnt = 0;
        for(int i = 0;i<n;i++){
            checkVal &= nums[i];
            if(checkVal == 0){
                cnt++;
                checkVal = INT_MAX;
            }           
        }
        return cnt;
    }
};
```
['Array', 'Greedy', 'Bit Manipulation', 'C++']