• Sign Up
  • Kata
  • Kumite
  • Blog
  • Forum
  • Wiki
  • Leaders
  • Log In
  • Sign Up
Name:R
Clan:i-sveikata
Skills:java, c, c++, c#, scala, js
Member Since:Feb 2014
Last Seen:Feb 2021
Profiles:
    Following:16
    Followers:55
    Allies:15
    View Profile Badges
    • Stats
    • Kata
    • Collections
    • Kumite
    • Social
    • Discourse
    • Conversations (641)
    • Replies
    • Authored
    • Needs Resolution
      • Mignon Gakuba
      • commented on "Fun with trees: lists edition" kata

      I am stuck at the random test,

      • JChampt
      • commented on "Odd Ones Out!" javascript solution

      Be careful with solutions like this because you are iterating through nums for each element of nums making it O(n^2) time complexity. This gets very slow as the size of nums grows. You can accomplish the same result by iterating through nums only once or twice. Obviously for these test cases nums isn't long enough to matter though.

      Cheers!

      • Slyvochka
      • commented on "Return 17" kata

      just didn't get it, besides there was condition "add one character and remove one character" !?

      • Chrono79
      • commented on "Find the stray number" kata

      No problem.

      • jbadr07/24
      • commented on "Find the stray number" kata

      thanks dude !!
      Passed: 65 Failed: 2
      Exit Code: 1
      Expected: -486 Submitted: 481
      i thought that the input would be a positif integer

      • Chrono79
      • commented on "Find the stray number" kata

      Read this: https://github.com/codewars/codewars.com/wiki/Troubleshooting-your-solution
      Have you seen which input makes your code fail?

      • jbadr07/24
      • commented on "Find the stray number" kata

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

      • taylortyger
      • commented on "Sorted? yes? no? how?" kata

      No, even merge sort is O(n * logn). Since we don't know if the array is sorted, we need to look at each element at least once. Otherwise, we wouldn't be able to tell if the array is sorted. I believe the best that can be done is O(n).

      • alex0x616
      • commented on "CamelCase Method" python solution

      What the hell... I never knew there was a title() method and I used capitalize() and map()

      • username0
      • resolved an issue on "Mean vs. Median" kata

      Random tests generate random cases now.

      Resolved.

      • XRFXLP
      • commented on "Mean vs. Median" kata

      I can't verify this, can you verify that whether it is fixed now?

      • XRFXLP
      • resolved an issue on "Mean vs. Median" kata
      • username0
      • created an issue for "Mean vs. Median" kata

      for C

      It seems to me, (a novice in C) that the random tests were not random.

      When hitting attempt, random tests are done. I print the inputs and output of my function. When repeatedly hitting attempt, I get exactly the same inputs and outputs again and again.

      • username0
      • created an issue for "Mean vs. Median" kata

      for C

      a very small issue where tests generate a warning of [-Wincompatible-pointer-types]

      • clcraig
      • created a suggestion for "Fun with lists: length" kata

      C and C++ translations. Please review.

    • Loading more items...
    • © 2021 Codewars
    • About
    • API
    • Blog
    • Privacy
    • Terms
    • Contact
    • powered by

    Confirm

    • Cancel
    • Confirm