brother of https://leetcode.com/problems/first-letter-to-appear-twice/ apply same concepts :D
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```cpp []\nclass Solution {\npublic:\n    bool findSubarrays(vector<int>& nums) {\n\n        set<int>s;\n\n      //  sort(sorted.begin(),sorted.end());\n\n        for(int i=0;i<nums.size()-1;i++)\n        {\n            if(i!=0&&find(s.begin(),s.end(),nums[i]+nums[i+1])!=s.end())\n               return true;\n             s.insert(nums[i]+nums[i+1]);\n\n        }\n\n\n        return false;\n    }\n};\n```
['C++']