Java solution
```\nclass Solution {\n    public boolean findSubarrays(int[] n) {\n        int k=n.length;\n        int a[]=new int[k-1];\n        for(int i=1;i<k;i++)\n      
```\nclass Solution {\n    public boolean findSubarrays(int[] n) {\n        int k=n.length;\n        int a[]=new int[k-1];\n        for(int i=1;i<k;i++)\n        {\n            a[i-1]=n[i-1]+n[i];\n        }\n        Arrays.sort(a);\n        for(int i=0;i<k-2;i++)\n        {\n            if(a[i]==a[i+1])\n                return true;\n        }\n        return false;\n    }\n}
['Java']