Prime List till N
\nclass Solution:\n    def findPrimePairs(self, n: int) -> List[List[int]]:\n        N = 1 + n\n        sp = [1] * N\n        v = [False] * N\n        for i in 
```\nclass Solution:\n    def findPrimePairs(self, n: int) -> List[List[int]]:\n        N = 1 + n\n        sp = [1] * N\n        v = [False] * N\n        for i in range(2, N, 2):\n            sp[i] = 2\n        for i in range(3, N, 2):\n            if not v[i]:\n                sp[i] = i\n                j = i\n                while j * i < N:\n                    v[j * i] = True\n                    sp[j * i] = i\n                    j += 2\n        plist = [i for i in range(2, n + 1) if sp[i] == i]\n        res = []\n        seen = set()\n        for p in plist:\n            seen.add(p)\n            if n - p in seen:\n                res.append((n - p, p))\n        res.sort()\n        return res\n```
['Python']