Easy Solution Beats 97.3% in T.C.
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```java []\nclass Solution {\n    public List<List<Integer>> findPrimePairs(int n) {\n     boolean prime[] = new boolean[n + 1];\n      Arrays.fill(prime,true);\n  \n        for (int p = 2; p * p <= n; p++) {\n            if (prime[p] == true) {\n                for (int i = p * p; i <= n; i += p)\n                    prime[i] = false;\n            }\n        }\n        List<List<Integer>> ans = new ArrayList();\n        for(int i = 2; i <= n/2 ; i++){\n            if(prime[i] && prime[n-i]) ans.add(List.of(i, n-i));\n        }\n        return ans;\n    }\n}\n\n```
['Java']