• 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
aael Avatar
Name:Unknown
Clan:Unknown
Member Since:May 2017
Last Seen:May 2025
Profiles:
    Following:0
    Followers:5
    Allies:0
    View Profile Badges
    • Stats
    • Kata
    • Collections
    • Kumite
    • Social
    • Discourse
    • Conversations (14)
    • Replies
    • Authored
    • Needs Resolution
    • Custom User Avatar
      • Bilal-MHMD-MHMD
      • commented on "Simple multiplication" cpp solution
      • 4 months ago

      You are genuis , keep going

    • Custom User Avatar
      • GreatGonzales92
      • commented on "Path Finder #1: can you reach the exit?" csharp solution
      • 8 months ago

      If you switched the order of checking if x and y are within range and switched the check on x to maze[y].Length, this code would also work for mazes with uneven shapes.

    • Custom User Avatar
      • Mohamamd Taha
      • commented on "Simple multiplication" cpp solution
      • 11 months ago

      I do not get this solution man, can you explain?

    • Custom User Avatar
      • Arkovski
      • commented on "Make a spiral" csharp solution
      • 12 months ago

      Who gives this piece of a bad code "best practices"? He could also name every variable a/b/c/d/e/f....

    • Custom User Avatar
      • ddaku
      • commented on "Path Finder #1: can you reach the exit?" csharp solution
      • 2 years ago

      The two-dimensional int array could be bools instead, making this slightly more readable and lessening the impact of converting from a string (a one-dimensional char array).

    • Custom User Avatar
      • m0__0n
      • commented on "Reversed Strings" csharp solution
      • 3 years ago

      This is clean and simple.

    • Custom User Avatar
      • sdr2002
      • commented on "Simple multiplication" cpp solution
      • 3 years ago

      & in this code is a bitwise operator that looks up the lowest bit of a and compare with 1?

    • Custom User Avatar
      • Random12b3
      • commented on "Traffic Lights - multiple cars" csharp solution
      • 3 years ago

      Great solution

    • Custom User Avatar
      • countnil
      • commented on "Range Extraction" csharp solution
      • 4 years ago

      Wow this is an elegant solution. Good work.

    • Custom User Avatar
      • AhmadKelany
      • commented on "Range Extraction" csharp solution
      • 4 years ago

      I think NextValue would be better named: "LastValue" to better convey its description as the last value in the range.

    • Custom User Avatar
      • b10624
      • commented on "A Rule of Divisibility by 7" kotlin solution
      • 4 years ago

      tailrec can be prepended to fun

    • Custom User Avatar
      • lispink
      • commented on "Range Extraction" csharp solution
      • 4 years ago

      I think using a seperate (nested) class for your list item would improve readability dramatically.

    • Custom User Avatar
      • halomademeapc
      • commented on "Get the Middle Character" fsharp solution
      • 6 years ago

      can i get bonus points for letting the integer division do all the work instead of bringing in if/else or a modulus

    • Custom User Avatar
      • cstrachan88
      • commented on "Molecule to atoms" csharp solution
      • 6 years ago

      I agree with @dlcoe, This is an excellent answer and beautifully simple! I went with a sans-regex approach for my solution. Wanted to try out a recursive method since I don't use recursion often.

    • © 2025 Codewars
    • About
    • API
    • Blog
    • Privacy
    • Terms
    • Code of Conduct
    • Contact

    Confirm

    • Cancel
    • Confirm

    Collect: undefined

    Loading collection data...