to be precise, fibonacci sequence is starting from zero, not one
забавно)
Nice) У меня по такой же логике
сортировка на регексах дороже, чем личный суперджет)
:D
Test case with 13 dots between C and m:
Testing for "........DC.............m" and 13: expected 'Caught!' to equal 'Escaped!'
From your description:
if j = 5: ..C.....m. returns 'Caught!' <-- not more than j characters between
Why?
When a rabbit jumps for 6 cells he has no idea where the wall is, it is NOT MATTER, the matter is he jumps 6 cells. If there wasn't a wall he should land on 6th cell, but in your example he would land on 5th.
Nice one, a little bit harder than it seems at first sight!
This comment is hidden because it contains spoiler information about the solution
Nice one, thanks
Nice kata, took a while with different approaches, when finally could establish some pattern
в наборе из 6 чисел может получиться 0, а числа 49 наоборот никогда не будет
О, тоже использовал 61, 60, 51 и т.д. систему только по другому посчитанную)
💪
⛓
Loading collection data...
to be precise, fibonacci sequence is starting from zero, not one
забавно)
Nice) У меня по такой же логике
сортировка на регексах дороже, чем личный суперджет)
:D
Test case with 13 dots between C and m:
From your description:
Why?
When a rabbit jumps for 6 cells he has no idea where the wall is, it is NOT MATTER, the matter is he jumps 6 cells. If there wasn't a wall he should land on 6th cell, but in your example he would land on 5th.
Nice one, a little bit harder than it seems at first sight!
This comment is hidden because it contains spoiler information about the solution
Nice one, thanks
Nice kata, took a while with different approaches, when finally could establish some pattern
в наборе из 6 чисел может получиться 0, а числа 49 наоборот никогда не будет
О, тоже использовал 61, 60, 51 и т.д. систему только по другому посчитанную)
💪
⛓
Loading more items...