• 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
nick.strohl Avatar
Name:Nick Strohl
Clan:Unknown
Member Since:Dec 2015
Last Seen:Nov 2023
Profiles:
    Following:1
    Followers:2
    Allies:0
    View Profile Badges
    • Stats
    • Kata
    • Collections
    • Kumite
    • Social
    • Discourse
    • Conversations (36)
    • Replies
    • Authored
    • Needs Resolution
    • Custom User Avatar
      • WilliamSmithE
      • commented on "Adding Big Numbers" csharp solution
      • 2 years ago

      Fix this!

    • Custom User Avatar
      • nik3930
      • commented on "Days in the year" ruby solution
      • 2 years ago

      Time.new does not use require. It is inbuit.

    • Custom User Avatar
      • blaizeRIFT
      • commented on "Adding Big Numbers" csharp solution
      • 2 years ago

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

    • Custom User Avatar
      • cj-traka
      • commented on "Adding Big Numbers" csharp solution
      • 2 years ago

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

    • Custom User Avatar
      • SauronFromPoland
      • commented on "Delete occurrences of an element if it occurs more than n times" python solution
      • 3 years ago

      Oh, ok.

      So that means I need to implement Checking if all elements in the list are INT and if not, to zip out to the main list.

      But seems odd that you got this list. Instructions says nothing about this type of list.

    • Custom User Avatar
      • SergeyNazh
      • commented on "Delete occurrences of an element if it occurs more than n times" python solution
      • 3 years ago

      I got this combination in one of my previous attemps. This is the problem, that some attemps with my solution are succeed and some are not.
      Example when it does not work is in my previous comment.

    • Custom User Avatar
      • SauronFromPoland
      • commented on "Delete occurrences of an element if it occurs more than n times" python solution
      • 3 years ago

      Because you are using set with list and I believe task required only one list.
      The loop will not work with List inside the set, I think this should look diffrent If we want to check if any element inside our list/set is INT.

      You should provide only list of Intigers

    • Custom User Avatar
      • SergeyNazh
      • commented on "Delete occurrences of an element if it occurs more than n times" python solution
      • 3 years ago

      Why this solution doesn't work with the following combination:
      ([15, 14, 3, 14, 14, 11, 11, 23, 14, 14, 3, 5, 5, 23, 14, 15, 14, 14, 14, 15, 5, 11, 14, 11, 15, 11, 23, 14, 3, 23, 5, 11, 14],1)

    • Custom User Avatar
      • St@m
      • commented on "Adding Big Numbers" csharp solution
      • 4 years ago

      Wait this is illegal! I didn't know you could do that!

      I think that due to the level of this Kata this should require you to write your own addition method.

    • Custom User Avatar
      • JohanWiltink
      • commented on "String Matcher" javascript solution
      • 5 years ago

      Not declaring you internal variables ( thus them being GLOBAL ) is not a Best Practice.

    • Custom User Avatar
      • BaptisteRomezin
      • commented on "Are the numbers in order?" python solution
      • 5 years ago

      It's short, but it's pretty slow. The ort fonction has a complexity of O(NlogN), where as you can resolve this is O(N) just by going through the list once and comparing elements two by two.

    • Custom User Avatar
      • ForceQWE
      • commented on "Adding Big Numbers" csharp solution
      • 5 years ago

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

    • Custom User Avatar
      • SmorcIRL
      • commented on "Adding Big Numbers" csharp solution
      • 5 years ago

      The only limit is your PC memory

    • Custom User Avatar
      • lithion
      • commented on "Adding Big Numbers" csharp solution
      • 6 years ago

      My solution is the same, however I expected it to fail some tests. What if we need for a number to be floating? Working with doubles should be the way here, and i think it was author intention to use them. The level of kata is to high otherwise.

    • Custom User Avatar
      • kodenik
      • commented on "Adding Big Numbers" csharp solution
      • 6 years ago

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

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

    Confirm

    • Cancel
    • Confirm

    Collect: undefined

    Loading collection data...