Video Explanation Solution easy to understand | Programming with Pirai | Half Moon Coder.
Video : Code
# Video : https://youtu.be/vBHSNJZVGn0

# Code
```python3 []
class Solution:
    def findPrimePairs(self, n: int) -> List[List[int]]:
        prime=[1]*(n+1)
        prime[0]=prime[1]=0
        for i in range(2,n+1):
            if prime[i]:
                for j in range(i*i,n+1,i):
                    prime[j]=0
        
        l,r=2,n
        res=[]
        while l<=r:
            if prime[l]==0:
                l+=1
            elif prime[r]==0:
                r-=1
            else:
                if l+r==n:
                    res.append([l,r])
                    l+=1
                    r-=1
                elif l+r<n:
                    l+=1
                else:
                    r-=1
        return res
```
['Array', 'Math', 'Enumeration', 'Number Theory', 'Python3']