Easy js solution
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```\n/**\n * @param {number} n\n * @return {number[][]}\n */\nvar findPrimePairs = function(n) {\n  let res=[];\n  for(let i=1; i<=n/2; i++){\n      if(isPrime(i) && isPrime(n-i)){\n          res.push([i, n-i]);\n      }\n  }  \n  return res;\n};\nfunction isPrime(number) {\n  if (number <= 1) {\n    return false;\n  }\n  if (number <= 3) {\n    return true;\n  }\n\n  if (number % 2 === 0 || number % 3 === 0) {\n    return false;\n  }\n\n  let i = 5;\n  while (i * i <= number) {\n    if (number % i === 0 || number % (i + 2) === 0) {\n      return false;\n    }\n    i += 6;\n  }\n\n  return true;\n}\n```
['JavaScript']