Easy Go Solution beats 64.5 run time and 59 memory
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 []\nimport "fmt"\nfunc findPrimePairs(n int) [][]int {\n  prime := isPrime(n)\n\tvar result [][]int\n\tfor i := 2; i <= n/2; i++ {\n\t\tsub := n - i\n\t\tif prime[i] && prime[sub] {\n\t\t\t\n\t\t\tresult = append(result, []int{i,sub})\n\t\t}\n\t}\n\n    return result\n}\n\nfunc isPrime(num int) []bool {\n\tisPrime := make([]bool, num+1)\n\tfor i := 1; i <= num; i++ {\n\t\tisPrime[i] = true\n\t}\n\tfor i := 2; i*i <= num; i++ {\n\t\tif isPrime[i] {\n\t\t\tfor j := i * i; j < num; j += i {\n\t\t\t\tisPrime[j] = false\n\t\t\t}\n\t\t}\n\t}\n\treturn isPrime\n}\n```
['Go']