Easy Solution || Beats 100 % || Best Approach
class Solution {\npublic:\n    int maxSubarrays(vector& nums) {\n        int count=0;\n        int curr=nums[0];\n        for(int i=1;i<nums.size();i++){\n     
class Solution {\npublic:\n    int maxSubarrays(vector<int>& nums) {\n        int count=0;\n        int curr=nums[0];\n        for(int i=1;i<nums.size();i++){\n            if(curr==0){count++; curr=nums[i]; continue;}\n            else{ curr= curr& nums[i];}\n        }\n        if(curr==0){count++;}\n        if(count==0){return 1;}\n        return count;\n    }\n};
[]