Straight Approach In Golang
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```golang []\nfunc findSubarrays(nums []int) bool {\n\tsumMap := make(map[int]int)\n\tfor i := 1; i < len(nums); i++ {\n\t\tsum := nums[i] + nums[i-1]\n\t\tsumMap[sum]++\n\n\t\tif sumMap[sum] == 2 {\n\t\t\treturn true\n\t\t}\n\t}\n\treturn false\n}\n```
['Go']