Ad
  • Custom User Avatar

    I updated the description, and I gave up on managing other people's translations a long time ago.

  • Custom User Avatar

    Also, clarified utf-8 in the kata description.

  • Custom User Avatar

    Unicode I/O is a fundamental, and this kata is intended to be a step up from fundamentals. A bigger problem is that the Vigenere Autokey Cipher Kata is assigned a lower rank than this one.

    Also, could get into a separate argument that ciphers are encodings. That's not really the true heart of your complaint, which would be that Unicode is hard in C++. The original Python version of this kata was very hard because Python wasn't always so intuitive with Unicode, and then Codewars wouldn't let you edit the solution after it was approved.

  • Custom User Avatar

    It's only the most commonly deployed electronic data format in the world.

  • Custom User Avatar

    Yea, there was some sort of mixup with the relative ranking of this kata when they went and revised a lot of historical rankings way back, as evidenced by the direct sequel having a lower kyu rating: https://www.codewars.com/kata/52d2e2be94d26fc622000735

  • Custom User Avatar

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

  • Custom User Avatar

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

  • Custom User Avatar

    So the intended problem and solution definition of this kata is unacceptable to you, because some valid solutions are considered lesser by you. That's all I can really take away from this.

  • Custom User Avatar

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

  • Custom User Avatar

    Me from ten years ago (because Codewars doesn't appear to allow you to link to comments from more than three years ago for some reason):

    It's really only convert the strings provided as test cases to how Jaden Smith originally typed them, so I wouldn't consider anything else a requirement. Of course the Java and Haskell translations included other requirements (Java has some weird null cases, and Haskell implemented what appears to be random lower-case strings). I should have looked into how translations worked earlier so that I could have requested more homogeneity there before the test cases were locked.

    The ignored sequel still in beta I decided to make earlier this year: https://www.codewars.com/kata/6752602505407ee57996cf85/solutions/javascript

  • Custom User Avatar

    @massey-n, the tests were intended to be exclusively Jaden tweets. I didn't author or approve the translations that have random tests, I originally stopped using Codewars because I was quite frustrated with the translations functionality as it was 10+ years ago. That said, the kata definition is Jaden tweets with capitalization as originally typed based on the provided test cases, which, at least for the Javascript implementation, was very intentional in allowing the solution of ignoring everything past the first character of a word or word contraction.

  • Custom User Avatar

    Your task is to convert strings to how they would be written by Jaden Smith. The strings are actual quotes from Jaden Smith, but they are not capitalized in the same way he originally typed them.

  • Custom User Avatar

    I like the encapsulation of the normalization function in your solution.

  • Custom User Avatar

    I invalidated this one, but not some other solutions that I could easily invalidate (this is because I like seeing creative solutions).

  • Custom User Avatar

    You inspired me to create a new spin-off.

  • Loading more items...