C++ Hash Set
\nclass Solution {\npublic:\n    bool findSubarrays(vector<int>& nums) {\n        unordered_set<int> st;\n        for (int i = 1; i < size(nums); i++) {\n      
```\nclass Solution {\npublic:\n    bool findSubarrays(vector<int>& nums) {\n        unordered_set<int> st;\n        for (int i = 1; i < size(nums); i++) {\n            int tmp = nums[i] + nums[i-1];\n            if (st.count(tmp)) return true;\n            st.insert(tmp);\n        }\n        return false;\n    }\n};\n```
[]