Ad
  • Default User Avatar

    Hello!

    The Fibonacci sequence begins with the following 14 integers: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233..

    When he first asks me about the "nth_fib(1)" he expects "0" as an answer

    which just makes no sense since "1" is the 2nd and the 3rd number

    same with "nth_fib(4)" he expects "2" as an answer but there is no "4" in the whole sequence

    so i just don't get what he is asking for, Thanks in advance.

  • Default User Avatar

    Thanks a lot for your fast reply

    and thanks for your work on answering questions and issues

    Have a good one

    warm regards too

  • Default User Avatar

    Hello!

    I am a little confused on the Kata Details.
    From what i understood, he'd give me 2 parameters: One for the sum of digits, and one for the amount of digits.

    My task is to return 3 numbers where the sum of digits is equal to "sum_dig", and the numbers must have a specified amount of digits in them.

    My question is:

    test.assert_equals(find_all(10, 3), [8, 118, 334])

    Here the answer should be [8, 118, 334]
    but why is there an "8" there?
    shouldn't there be another 3 digit number that the sum of its digits equals 10?

    Thanks for reading

  • Default User Avatar

    mhm agreed, goddamn beautiful

  • Default User Avatar

    you right bro

  • Default User Avatar

    DAMN SO COOL

  • Default User Avatar

    codewars can't be created from code and wasr
    codewars is not a merge of cwdr and oeas

    ah yes, codewars can't be created from code and wasr

    also, the kata never mentioned anything about merging, this is all so weird

  • Default User Avatar

    i'll try researching about it, thanks a lot!

  • Default User Avatar

    Also, beware of plateaus !!! [1, 2, 2, 2, 1] has a peak while [1, 2, 2, 2, 3] and [1, 2, 2, 2, 2] do not.

    incase of [1,2,2,2,3] isn't the 3 here a peak?

  • Default User Avatar

    This comment is hidden because it contains spoiler information about the solution

  • Default User Avatar

    This comment is hidden because it contains spoiler information about the solution

  • Default User Avatar

    This comment is hidden because it contains spoiler information about the solution

  • Default User Avatar

    hmm,okay! i hope i got the idea right, thanks alot

  • Default User Avatar

    Find the length of the longest substring in the given string s that is the same in reverse.

    As an example, if the input was “I like racecars that go fast”, the substring (racecar) length would be 7

    somebody please explain what he wants ME to do here?? like whats the goal what should i do am so confused

    every 6kyu question is like that,its just so hard to understand

  • Default User Avatar

    the problem with these questions is not that they're hard its that i legit spend decades trying to understand the questions...i dont get an answer at the end

  • Loading more items...