Hash Set
C++\ncpp\nbool findSubarrays(vector<int>& nums) {\n    unordered_set<int> s;\n    for (int i = 1; i < nums.size(); ++i)\n        if(!s.insert(nums[i - 1] + nums
**C++**\n```cpp\nbool findSubarrays(vector<int>& nums) {\n    unordered_set<int> s;\n    for (int i = 1; i < nums.size(); ++i)\n        if(!s.insert(nums[i - 1] + nums[i]).second)\n            return true;\n    return false;\n}\n```
[]