Simple solution to Bekar Question
Java []\nclass Solution {\n    public int maxSubarrays(int[] nums) {\n        int all1=(1<<29)-1, minScore=all1, v=all1, cnt=0;\n        for(int num: nums) minS
```Java []\nclass Solution {\n    public int maxSubarrays(int[] nums) {\n        int all1=(1<<29)-1, minScore=all1, v=all1, cnt=0;\n        for(int num: nums) minScore&=num;\n        if(minScore!=0) return 1;\n        for(int num: nums) {\n            v&=num;\n            if(v==0) {\n                cnt++;\n                v=all1;\n            }\n        }\n        return cnt;\n    }\n}\n```
['Java']