Simple & easy implementation | Beats-100% | using Set
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```cpp []
class Solution {
public:
    bool findSubarrays(vector<int>& nums) {
        unordered_set<int> st;
        for(int i = 1; i < nums.size(); i++) {
            int sum = nums[i] + nums[i - 1]; 
            auto it = st.find(sum);
            if (it != st.end()) return true; 
            st.insert(sum);
        }
        return false; 
    }
};
```
['Array', 'Hash Table', 'C++']