primeSum.js

@@ -1,12 +1,483 @@
-primeSum.js
+// Prime Sum%0A%0A// Given an even number ( greater than 2 ), return two prime numbers whose sum will be equal to given number.%0A%0A// NOTE A solution will always exist. read Goldbach%E2%80%99s conjecture%0A%0A// Example:%0A%0A%0A// Input : 4%0A// Output: 2 + 2 = 4%0A%0A// If there are more than one solutions possible, return the lexicographically smaller solution.%0A%0A// If %5Ba, b%5D is one solution with a %3C= b,%0A// and %5Bc,d%5D is another solution with c %3C= d, then%0A%0A// %5Ba, b%5D %3C %5Bc, d%5D%0A%0A// If a %3C c OR a==c AND b %3C d.
 %0A

add desc