Simplest Sieve solution Python
\n\n# Code\n\nclass Solution:\n    def findPrimePairs(self, n: int) -> List[List[int]]:\n        def SOE(num):\n            isPrime = [True] * (num+1)\n        
\n\n# Code\n```\nclass Solution:\n    def findPrimePairs(self, n: int) -> List[List[int]]:\n        def SOE(num):\n            isPrime = [True] * (num+1)\n            isPrime[0] = isPrime[1] = False\n            for p in range(isqrt(num)+1):\n                if isPrime[p]:\n                    for j in range(p*p, num+1, p):\n                        isPrime[j] = False\n            return isPrime\n\n        isPrime = SOE(n)\n\n        a = []\n        for i in range(2,n//2+1):\n            if isPrime[i] and isPrime[n-i]:\n                a.append([i, n-i])\n        return a\n```
['Python3']