Find Subarrays with Equal sum
Just Go to description and read the question . It states that it shoud be in contiguous. \n \nExample =[2 ,1,3,5,0,6]\nit is  also giving the two array with equ
Just Go to description and read the question . It states that it shoud be in contiguous. \n ```\nExample =[2 ,1,3,5,0,6]\nit is  also giving the two array with equal sum but [3,0] is not contiguous.\nso it gives false;\n```\n\n Just simple solution we add current element and previous element and search in set if found return true else insert in set and if not found in set means not found so return false;\n \n```\nclass Solution {\npublic:\n    bool findSubarrays(vector<int>& nums) {\n    unordered_set<int>s;\n        for(int i=1;i<nums.size();i++){\n            if(s.find(nums[i]+nums[i-1])!=s.end()){\n                return true;\n            }\n            s.insert(nums[i]+nums[i-1]);\n        }\n        return false;\n    }\n};\n```
['Ordered Set', 'C++']