110 % understandable || beginner friendly
\n# Code\n\nclass Solution {\npublic:\n    \n     \n    vector<vector<int>> findPrimePairs(int n) {\n     \n        vector<vector<int>> ans;\n        if(n<=2) r
\n# Code\n```\nclass Solution {\npublic:\n    \n     \n    vector<vector<int>> findPrimePairs(int n) {\n     \n        vector<vector<int>> ans;\n        if(n<=2) return ans;\n        int x=2;\n        while(x<=(n/2))\n        {\n            if(isPrime(x))\n            {\n                if(isPrime(n-x))\n                ans.push_back({x,n-x});\n            }\n            x++;\n        }\n        return ans;\n        \n    }\n     bool isPrime(int val)\n      {\n          \n          int x=2;\n          int y=sqrt(val);\n          while(x<=y)\n          {\n              if(val%x==0) return false;\n              x++;\n          }\n          return true;\n      }\n};\n```
['Array', 'Math']