Ad
  • Custom User Avatar

    Each strand has a unique capital letter. Note how in the tests, the strands will always be connected but may traverse different inner-arrays.
    All Cs will be part of the same strand even if it twists and turns.

  • Custom User Avatar

    Poetic description is nice, but too vague. Got it working according to description, but all tests here failed. I thought you want to find the longest string by letter from array, not the letters that appear the most in ALL strings. To me that is not spaghetti, but macaroni...

  • Custom User Avatar

    You can guarantee that input is non-negative.

    Handling negative inputs isn't part of the spec.

  • Custom User Avatar

    What happens if input is -1. Or did I understood this kata wrong...