• 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
Glinator Avatar
Name:Unknown
Clan:ENSI
Member Since:Dec 2020
Last Seen:Apr 2025
Profiles:
Following:40
Followers:32
Allies:26
View Profile Badges
  • Stats
  • Kata
  • Collections
  • Kumite
  • Social
  • Discourse
  • Conversations (420)
  • Replies
  • Authored
  • Needs Resolution
  • Custom User Avatar
    • Glinator
    • commented on ""Pascal's Triangle" OCaml Translation"
    • 3 months ago

    Reading back this fork, I realise that the pretty-printing leaks the expected number of elements. I don't know whether that's a good idea.

  • Custom User Avatar
    • Glinator
    • commented on ""Pascal's Triangle" OCaml Translation"
    • 3 months ago

    Yeah I'll have some trouble remembering what I was thinking three years ago, so I don't remember why I did it that way.

    There are indeed two possibilities:

    • Use a fixed length integer type and limit the input values
    • Use a bignum type

    I went with the first one for some reason; someone could change the translation to the second if it seems like a good idea.

  • Custom User Avatar
    • hobovsky
    • commented on ""Pascal's Triangle" OCaml Translation"
    • 4 months ago

    Most probably no one thought of using Z for big numbers at the time (I definitely did not, because I did not even knew that Z exists), and this challenge already uses finite integers in many languages. Besides, maybe solving it for n up to 66 might be good eneough and would not differ much form solving it for arbitrary n? Or maybe you think it would be a good exercise to get familiar with Z?

  • Custom User Avatar
    • KayleighWasTaken
    • commented on ""Pascal's Triangle" OCaml Translation"
    • 4 months ago

    Why not just Z?

    (Yes I know this is ancient)

  • Custom User Avatar
    • Glinator
    • commented on "Simple multiplication" cpp solution
    • 9 months ago

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

  • Custom User Avatar
    • Glinator
    • commented on "Compare within margin" rust solution
    • 10 months ago

    Woops the formatting is botched, my bad

  • Custom User Avatar
    • Glinator
    • commented on "Efficient Cooking" kata
    • 10 months ago

    I only saw your reply when I posted mine and the page refreshed. At least you got a second confirmation.

  • Custom User Avatar
    • Glinator
    • commented on "Efficient Cooking" kata
    • 10 months ago

    Is 44 your answer or the expected answer ? Because 39 seems correct to me.

    • First do step 1, 2 and 4 (takes 13 minutes)
    • Then do step 6 in the background (will last for 21 more minutes)
    • Do steps 3 and 5 while the carrots boil (doesn't take time as step 6 is longer)
    • Finish with steps 7 and 8 (takes 5 minutes)

    13 + 21 + 5 = 39

  • Custom User Avatar
    • Glinator
    • commented on "Schrödinger's Boolean" rust solution
    • 10 months ago

    In assert_eq!(...), when the two values compare unequal, the macro needs to print them and does so with the Debug trait.

    You can take a look at the signature of assert_failed in core::panicking.

  • Custom User Avatar
    • ejini战神
    • resolved a suggestion on "Consecutive strings" kata
    • 2 years ago

    Approved some time ago

  • Custom User Avatar
    • monadius
    • resolved a suggestion on "99 Problems, #8: Eliminate consecutive duplicates in a list" kata
    • 2 years ago

    Approved

  • Custom User Avatar
    • monadius
    • resolved a suggestion on "99 Problems, #3: k-th element in a list" kata
    • 2 years ago

    Approved

  • Custom User Avatar
    • Glinator
    • commented on "Regular expression for binary numbers divisible by 5" kata
    • 2 years ago

    The point of this kata is not to write a function boolean isDiv5(String s), but to create a regular expression that will match all strings that represent in binary a number divisible by five and only these strings.

    For example, this regular expression should match "101", "0" and "1111" because they represent 5, 0 and 15.
    But it should not match "111", "10000" nor "1" as they represent 7, 16 and 1.

  • Custom User Avatar
    • Glinator
    • commented on "Regular expression for binary numbers divisible by 5" python solution
    • 2 years ago

    You mad genius

  • Custom User Avatar
    • Kali_Linux
    • commented on "Bubblesort Once" python solution
    • 2 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...