C++, set
Code\n\nclass Solution {\npublic:\n    bool findSubarrays(vector<int>& nums) {\n        unordered_set<int> S;\n\n        for (int i = 0; i < nums.size()-1; i++)
# Code\n```\nclass Solution {\npublic:\n    bool findSubarrays(vector<int>& nums) {\n        unordered_set<int> S;\n\n        for (int i = 0; i < nums.size()-1; i++) {\n            int sum = nums[i] + nums[i+1];\n            if (S.find(sum) != S.end()) return true;\n            S.insert(sum);\n        }\n\n        return false;\n    }\n};\n```
['Array', 'Hash Table', 'C++']