Just Brute Force || C++
\'\'\'\n\nINTUTUION:-\nIt is optimal to put all the elements in a single subarray until we didn\'t find any subarray having \'AND\' is \'ZERO\' , by doing this 
\'\'\'\n\nINTUTUION:-\nIt is optimal to put all the elements in a single subarray until we didn\'t find any subarray having \'AND\' is \'ZERO\' , by doing this it minimizes the total score.\n\n\n    class Solution {\n    public:\n \n     int maxSubarrays(vector<int>& nums) {\n        int n=nums.size();\n        int cnt=0, andd=nums[0];  \n\t\t\n        for(int i=0; i<n; i++){ \n            andd&=nums[i];\n            if(i==n-1)  break;\n             \n            if(andd==0){         // IF WE FOUND A SUBARRAY HAVING \'AND\' ZERO\n                cnt++;\n                andd=nums[i+1];\n            }\n        }\n       \n        if(andd==0 || cnt==0) cnt++;\n        return cnt;  \n      }\n    };\n\n\'\'\'
[]