Ad
  • Custom User Avatar

    Very nice. I was on my way down this path but got a bit lost in the math so I abandoned it. Should have stuck with it, very satisfying solution.

  • Custom User Avatar

    Fun kata. I went down the path of replicating the encoder first, then trying to build the inverse function. Suffice it to say the math got hairier than I'd expected and I abandoned that path and brute-forced it 'the other way'.

    I was a little disappointed to see that a lot of the accepted solutions have hard limits on the length of strings they can decode, or they did not get the underlying alphabet exactly right (the '=' sign at the end isn't obvious, but it's there).

  • Custom User Avatar

    Dude. That's a damn cool solution. I mean, if you did that in production on my team I'd take your bloody head off, but.... Holy hell that's cool.

  • Custom User Avatar

    If you are getting almost every test case correct, but somehow there are around 11 left with the error:

    After applying rank of -1 the progress was expected to be 21, but was actually 20

    It seems like those are broken test cases, but they're not. No spoiler, but maybe re-check your diff calculation.