Sliding Window technique O(n)
\nclass Solution {\npublic:\n    int maxSubarrays(vector<int>& a) \n    {\n        int c = 0, f = a[0];\n        for (int i = 0; i < a.size(); i++)\n        {\n
```\nclass Solution {\npublic:\n    int maxSubarrays(vector<int>& a) \n    {\n        int c = 0, f = a[0];\n        for (int i = 0; i < a.size(); i++)\n        {\n            f = f&a[i];\n            if (f == 0) {\n                c++;\n                if (i+1 < a.size()) f = a[i+1];\n            }\n        }\n        return max(1,c);\n    }\n};\n```
['Two Pointers', 'Greedy', 'Bit Manipulation', 'Sliding Window', 'C++']