Geeksforgeeks

Error

×

Leaderboard

Showing:

Handle | Score |
---|---|

@Ibrahim Nash | 6420 |

@blackshadows | 6376 |

@mb1973 | 5578 |

@Quandray | 5231 |

@akhayrutdinov | 5111 |

@saiujwal13083 | 4510 |

@sanjay05 | 3762 |

@kirtidee18 | 3673 |

@marius_valentin_dragoi | 3522 |

@sushant_a | 3459 |

@verma_ji | 3412 |

Complete Leaderboard | |

Handle | Score |

@codersgroup18 | 714 |

@Manikanta punnam | 587 |

@sriramgoparaju99 | 532 |

@praveenbgp6 | 525 |

@yashkaril4 | 517 |

@prankursharma31 | 489 |

@rdakka | 467 |

@sonamnigam1999 | 441 |

@sonamkumari63928 | 427 |

@purohitmn02 | 427 |

@shubhamstudent5 | 419 |

Complete Leaderboard |

Given a number N. Find if it can be expressed as sum of two prime numbers.

**Example 1:**

**Input**: N = 34
**Output:** "Yes"
**Explanation**: 34 can be expressed as
sum of two prime numbers.

**Example 2:**

**Input: **N = 23
**Output: **"No"
**Explanation**: 23 cannnot be expressed as
sum of two prime numbers.

**Your Task: **

You dont need to read input or print anything. Complete the function **isSumOfTwo() **which takes N as input parameter and returns "Yes" if can be expressed as sum of two prime numbers. else return "No".

**Expected Time Complexity:** O(n*sqrt(n))

**Expected Auxiliary Space:** O(1)

**Constraints:**

1<= N <=10^{4}

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Yes
Primes sum

...