100% beats || Easy Approch
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```cpp []\nclass Solution {\npublic:\n    void sieve(vector<int>&isPrime,int n){\n        isPrime[0]=isPrime[1]=false;\n        for(int i=2;i<n;i++){\n            if(isPrime[i]){\n                for(int j=2*i;j<n;j+=i){\n                    isPrime[j]=false;\n                }\n            }\n        }\n    }\n    vector<vector<int>> findPrimePairs(int n) {\n        // time Complexity --> n*loglogn\n        if(n==1)return {};\n        vector<int>isPrime(n,true);\n        sieve(isPrime,n);\n        vector<vector<int>>ans;\n        for(int i=2;i<=n/2;i++){\n          if(isPrime[i] && isPrime[n-i])ans.push_back({i,n-i});\n        }\n        return ans;\n    }\n};\n```
['C++']