C++ || Easy Without Map/Set || SC: O(1) , TC: O(nlogn)
\nbool findSubarrays(vector<int>& nums) {\n        int n = nums.size();\n        \n        if (nums.size() <= 2)\n            return false;\n        \n        f
```\nbool findSubarrays(vector<int>& nums) {\n        int n = nums.size();\n        \n        if (nums.size() <= 2)\n            return false;\n        \n        for (int i = 1; i < n; i++)\n        {\n            int sum = nums[i-1] + nums[i];\n            nums[i-1] = sum;\n        }\n        nums.pop_back();\n        sort (nums.begin(), nums.end());\n        \n        for (int i = 1; i < nums.size(); i++)\n        {\n            if (nums[i-1] == nums[i])\n                return true;\n        }\n        return false;\n    }\n```
['C', 'Sorting', 'C++']