• Sign Up
    Time to claim your honor
  • Training
  • Practice
    Complete challenging Kata to earn honor and ranks. Re-train to hone technique
  • Freestyle Sparring
    Take turns remixing and refactoring others code through Kumite
  • Community
  • Leaderboards
    Achieve honor and move up the global leaderboards
  • Chat
    Join our Discord server and chat with your fellow code warriors
  • Discussions
    View our Github Discussions board to discuss general Codewars topics
  • About
  • Docs
    Learn about all of the different aspects of Codewars
  • Blog
    Read the latest news from Codewars and the community
  • Log In
  • Sign Up
GeorgCantor Avatar
Name:Unknown
Clan:Unknown
Member Since:Jun 2017
Last Seen:May 2025
Profiles:
Following:0
Followers:3
Allies:0
View Profile Badges
  • Stats
  • Kata
  • Collections
  • Kumite
  • Social
  • Discourse
  • Conversations
  • Replies (16)
  • Authored
  • Needs Resolution
  • Custom User Avatar
    • abdu20
    • commented on "Cartesian neighbors" kata
    • 2 years ago

    why is essay?

  • Custom User Avatar
    • user9526662
    • commented on "Strip Comments" kata
    • 4 years ago

    so?

  • Custom User Avatar
    • geodimitrov
    • commented on "Greed is Good" kata
    • 4 years ago

    No, you are not stupid. Just use the provided examples/tests and reread the rules & explanation. At first glance it does seem a bit unclear.

  • Custom User Avatar
    • dinglemouse
    • commented on "Sequence convergence" kata
    • 5 years ago

    Kata description says:

    We will call the series seeded by a value of 1 the "base series"

  • Custom User Avatar
    • SudoAjay
    • commented on "Stanton measure" kata
    • 5 years ago

    count the number of 1s in the array. Let this count be n. The Stanton measure is the number of times that n appears in the array.

    Just try to understand this :)

    in Simple english - whatever the occurnce of 1 come in array will be x and then find that occurnce of x in array

  • Custom User Avatar
    • Fortie40
    • commented on "Delete occurrences of an element if it occurs more than n times" kata
    • 5 years ago

    Me too. But the tests are passing

  • Custom User Avatar
    • turmalinow
    • commented on "Make the Deadfish swim" java solution
    • 5 years ago

    exactly 😉

  • Custom User Avatar
    • jmoody011235
    • commented on "Make the Deadfish swim" java solution
    • 5 years ago

    It looks to me like they were intentionally using this as an opportunity to work on design patterns

  • Custom User Avatar
    • B1ts
    • commented on "Strongest even number in an interval" kata
    • 5 years ago

    Your code is too slow.

  • Custom User Avatar
    • Blind4Basics
    • commented on "Make the Deadfish swim" java solution
    • 5 years ago

    he's actually talking about this: KISS... x)

  • Custom User Avatar
    • alex_duty
    • commented on "Make the Deadfish swim" java solution
    • 5 years ago

    don't speak like that with others. yours also can be even simpler.

  • Custom User Avatar
    • Chrono79
    • commented on "Delete occurrences of an element if it occurs more than n times" kata
    • 5 years ago

    Probably you have an infinite loop, this kata doesn't seem to have high performance requirements.

  • Custom User Avatar
    • Chrono79
    • commented on "Expressions Matter " kata
    • 5 years ago

    here are some ways of placing signs and brackets:

    It doesn't say all ways. And you have an example where the solution is a + b + c too.

  • Custom User Avatar
    • hobovsky
    • commented on "New Cashier Does Not Know About Space or Shift " kata
    • 5 years ago

    That's too bad!

  • Custom User Avatar
    • ivmoskalev
    • commented on "Find the nth occurrence of a word in a string!" kata
    • 5 years ago

    Hello russia

  • Loading more items...
  • © 2025 Codewars
  • About
  • API
  • Blog
  • Privacy
  • Terms
  • Code of Conduct
  • Contact

Confirm

  • Cancel
  • Confirm

Collect: undefined

Loading collection data...