Geeksforgeeks

Error

×

Leaderboard

Showing:

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

@Ibrahim Nash | 5761 |

@blackshadows | 5701 |

@akhayrutdinov | 5111 |

@mb1973 | 4989 |

@Quandray | 4944 |

@saiujwal13083 | 4506 |

@sanjay05 | 3762 |

@marius_valentin_dragoi | 3516 |

@sushant_a | 3459 |

@verma_ji | 3341 |

@KshamaGupta | 3318 |

Complete Leaderboard | |

Handle | Score |

@aroranayan999 | 938 |

@bt8816103042 | 739 |

@SHOAIBVIJAPURE | 428 |

@codeantik | 412 |

@SherlockHolmes3 | 407 |

@neverevergiveup | 348 |

@mahlawatep | 347 |

@shalinibhataniya1097 | 343 |

@murarry3625 | 333 |

@saiujwal13083 | 326 |

@rohitanand | 314 |

Complete Leaderboard |

Once there was a Geek he was quite intelligent and was also fond of jumping. But he jumped in a pattern like 1 leap, 2 leap, 3 leap and again from the start after 3rd leap.

1 leap means if Geek is at point P then he will jump to P+1.

2 leap means if Geek is at point P then he will jump to P+2.

3 leap means if Geek is at point P then he will jump to P+3.

Find whether he could land up to a point **N** or not.

**Note-** He starts from point 0.

**Example 1:**

Input:N =0Output:yesExplanation:Geek is already at Position 0.

**Example 2:**

Input:N =1Output:yesExplanation:Geek will land at Position 1 after the 1st jump.

**Example 3:**

Input:N =8Output:noExplanation:Geek can't land at Position 8.

**Your Task:**

You don't need to read input or print anything. Your task is to complete the function **jumpingGeek()** which takes an Integer **N** as input and returns **"yes"** if geek can reach **N**, otherwise return **"no"**.

**Expected Time Complexity:** O(1)

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

**Constraints:**

0 <= N <= 10^{8}

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
Jumping Geek

...