nice
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 static List<List<Integer>> findPrimePairs(int n) {\n        List<List<Integer>> list = new ArrayList<>();\n        boolean[] isPrime = new boolean[n];\n        for (int i = 2; i < n; i++){\n            isPrime[i] = true;\n        }\n        for(int i =2; i * i < n; i++){\n            if (isPrime[i]){\n                for (int j = i * i; j < n; j+=i){\n                    isPrime[j] = false;\n                }\n            }\n        }\n        for (int i = 2; i <= n / 2; i++){\n            int index = n - i;\n            if (isPrime[i] &&isPrime[index]){\n                list.add(Arrays.asList(i, index));\n            }\n        }\n        return list;\n    }\n}\n```
['Java']