100%fast
\t\tclass Solution {\n\tpublic:\n    bool findSubarrays(vector& nums) {\n    \n        unordered_setset;\n        int n =nums.size(); \n        \n        for(in
\t\tclass Solution {\n\tpublic:\n    bool findSubarrays(vector<int>& nums) {\n    \n        unordered_set<int>set;\n        int n =nums.size(); \n        \n        for(int i=0;i<n-1;i++){\n            if(set.find(nums[i]+nums[i+1])!=set.end())\n                return true;\n            else \n                set.insert(nums[i]+nums[i+1]);\n        }\n    return false;\n    \n    }\n};
['C']