Shortest, Easiest, Clean & Clear | To the Point & Beginners Friendly Approach (❤️ ω ❤️)
Code\n\nclass Solution {\npublic:\n    int maxSubarrays(vector<int>& nums) {\n        int a=nums.front(),x=0;\n        for(int i=0;i<nums.size();i++){\n        
# Code\n```\nclass Solution {\npublic:\n    int maxSubarrays(vector<int>& nums) {\n        int a=nums.front(),x=0;\n        for(int i=0;i<nums.size();i++){\n            a&=nums[i];\n            if(i==nums.size()-1)break;\n            else if(a==0){x++;a=nums[i+1];}\n        }\n        return a==0||x==0?x+1:x;\n\n//  if you like my approach then please UpVOTE o((>\u03C9< ))o\n    }\n};\n```\n\n![f5f.gif](https://assets.leetcode.com/users/images/0baec9b8-8c77-4920-96c5-aa051ddea6e4_1702180058.2605765.gif)\n![IUeYEqv.gif](https://assets.leetcode.com/users/images/9ce0a777-25fd-4677-8ccc-a885eb2b08f0_1702180061.2367256.gif)
['C++']