Simple and Fast Solution | C++
\n# Complexity\n- Time complexity: O(n)\n\n- Space complexity: O(n)\n\n# Code\ncpp []\nclass Solution {\npublic:\n    bool findSubarrays(vector<int>& nums) {\n 
\n# Complexity\n- Time complexity: $$O(n)$$\n\n- Space complexity: $$O(n)$$\n\n# Code\n```cpp []\nclass Solution {\npublic:\n    bool findSubarrays(vector<int>& nums) {\n        \n        unordered_set<int>s;\n        int sum = 0;\n        for(int i = 1; i < nums.size(); i++){\n            sum = nums[i-1] + nums[i];\n            if(s.find(sum) != s.end()){\n                return true;\n            }\n            s.insert(sum);\n        }\n        return false;\n    }\n};\n```
['Array', 'Hash Table', 'C++']