Easy C++ Solution || Beats 100%
Approach\n Describe your approach to solving the problem. \n- Mark those numbers who are prime using boolean ifPrime array.\n- Now check for pair { i, n-i } if 
# Approach\n<!-- Describe your approach to solving the problem. -->\n- Mark those numbers who are prime using boolean ```ifPrime``` array.\n- Now check for pair ```{ i, n-i }``` if they both are prime then took that pair into your answer vector.\n\n![Screenshot 2023-07-02 161008.png](https://assets.leetcode.com/users/images/be94939d-d0d7-47ca-8ea4-621cd2bb9afd_1688294439.3024561.png)\n\nPlease Upvote if you like the solution\n# Code\n```\nclass Solution {\npublic:\n    vector<vector<int>> findPrimePairs(int n) {\n\t\tvector<bool> ifPrime(n, true);\n        vector<vector<int>> v;\n\t\tifPrime[0] = ifPrime[1] = false;\n\t\tfor(int i = 0; i < sqrt(n); i++) {\n\t\t\tif(ifPrime[i]) {\n\t\t\t\tfor(int j = 2; i*j < n; j++) {\n                    ifPrime[i*j] = false;\n                }\n\t\t\t}\n\t\t}\n        for(int i = 0; i <= n/2; i++) {\n            if(ifPrime[i] == true && ifPrime[n-i] == true) {\n                v.push_back({i, n-i});\n            }\n        }\n\t\treturn v;\n    }\n};\n```
['C++']