✅✅Faster || Easy To Understand || C++ Code
Using Hashset\n\n Time Complexity :- O(N)\n\n Space Complexity :- O(N)\n\n\nclass Solution {\npublic:\n    bool findSubarrays(vector<int>& nums) {\n        \n  
* ***Using Hashset***\n\n* ***Time Complexity :- O(N)***\n\n* ***Space Complexity :- O(N)***\n\n```\nclass Solution {\npublic:\n    bool findSubarrays(vector<int>& nums) {\n        \n        int n = nums.size();\n        \n        // declare a set\n        \n        unordered_set<long long> s;\n        \n        for(int i = 0; i < n - 1; i++)\n        {\n            long long sum = nums[i] + nums[i + 1];\n            \n            // if sum is already present in set then return true\n            \n            if(s.count(sum))\n                return true;\n            \n            s.insert(sum);\n        }\n        \n        return false;\n    }\n};\n```
['C', 'C++']