c++ | easy to undersatand | step by step
```\nbool findSubarrays(vector& nums) {\n        int sum = nums[0], counter = 0;\n        unordered_mapm;\n        for(int i = 1; i<nums.size(); i++)\n        {
```\nbool findSubarrays(vector<int>& nums) {\n        int sum = nums[0], counter = 0;\n        unordered_map<int, int>m;\n        for(int i = 1; i<nums.size(); i++)\n        {\n            sum +=nums[i];\n            counter ++;\n            if(counter == 1)\n            {\n                if(m.find(sum) != m.end())\n                  return true;\n                 m[sum]=nums[i];\n                sum=nums[i];\n                counter = 0;\n            }\n        }\n        return false;\n    }
[]