Leaderboard
Showing:
Jumping Geek
Basic Accuracy: 30.0% Submissions: 40 Points: 1

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 = 0
Output: yes
Explanation:
Geek is already at Position 0.

Example 2:

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

Example 3:

Input: N = 8
Output: no
Explanation:
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 <= 108

to report an issue on this page.

Editorial

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

Yes

All Submissions

My Submissions:

Login to access your submissions.

Jumping Geek

Output Window