6 kyu
Simple Fun #336: Lonely Frog
101 of 178myjinxin2015
Loading description...
Algorithms
This comment has been reported as {{ abuseKindText }}.
Show
This comment has been hidden. You can view it now .
This comment can not be viewed.
- |
- Reply
- Edit
- View Solution
- Expand 1 Reply Expand {{ comments?.length }} replies
- Collapse
- Spoiler
- Remove
- Remove comment & replies
- Report
{{ fetchSolutionsError }}
-
-
Your rendered github-flavored markdown will appear here.
-
Label this discussion...
-
No Label
Keep the comment unlabeled if none of the below applies.
-
Issue
Use the issue label when reporting problems with the kata.
Be sure to explain the problem clearly and include the steps to reproduce. -
Suggestion
Use the suggestion label if you have feedback on how this kata can be improved.
-
Question
Use the question label if you have questions and/or need help solving the kata.
Don't forget to mention the language you're using, and mark as having spoiler if you include your solution.
-
No Label
- Cancel
Commenting is not allowed on this discussion
You cannot view this solution
There is no solution to show
Please sign in or sign up to leave a comment.
COBOL translation.
Approved
JS test cases are a mess full of unused stuff, needs to be cleaned.
Here's a fork
Thanks :)
Python Translation
Comments directly on translation.
Approved
Can anyone explain me this task. I'm kinda lost in it!!
Basically, you are trying to find
nby adding your current 'step', whether positive or negative.starting at a total of
0,on step 1 you'll add
1or add-1on step 2 you'll add
2or add-2on step 3 you'll add
3or add-3What ever it takes to reach the value of
nOP solved it, closing
If i must get exactly n'th position, then how do i get 100 in 15 steps? It is impossible. because 91 + 14 == 105 and if you move -> or <- by 15 from 105, you can not reach exactly 100. Check Haskell tests please.
tests are fine, you actually can get there in 15 steps, just think about how you can do that
Can someone explain me how to get to 100 in 15 steps I'm also stuck here. 91-14 = 77, 77+15 = 102. How to reach 100 ? Please give a pattern.
You must find the solution by yourself, not by reading the discussion. Giving a pattern is giving the solution.
This comment has been hidden.
Haskell translation
Cheers ;-)
You're most welcome. :]
Would you approve these 1 2 as well? OPs are gone. ( You'll have to forfeit them, I guess. Or you might solve them, if you speak the language. )
Err.. page is locked. It's too hard to solve...when I using a cell phone O_o
kata 1 solved, and your translation has been approved. kata 2 is Java kata, so, you know.. :]
Maybe Voile can approve it, so you can still solve it then. Or Unnamed.
Thanks for #1!
Approved ;-)
Thanks! :]
Awaiting moderator approval
Cheers ;-)