For example when one char takes 2 bytes or more.
For example, Russian letter "Ш" takes 2 bytes.

It same for chinese hieroglyphs

Hey I'm newer to Go and would like to learn more about this. When would the byte count vs char count be different using len()?

No reaction after 3 years: rejected.

I find this one easy to read, short, idiomatic and clever.
The base case of the recursion is at first to it also saves valuable computing time when you reach the top of the stack.

Hi @lobz1g,

Welcome to the club of Kata authors! :D While you may be inclined to author a Kata whenever an idea pops up in your mind and publish it for the rest of the community to enjoy, you should be aware that published Kata are expected to meet strict expectations in order to pass the testing stage and leave Beta.

Please do read through the article linked above before continuing on your journey of authoring Kata. We're looking forward to more Kata authored by you once you have read the article mentioned ;)

Cheers,
@donaldsebleung

Almost the same:
https://www.codewars.com/kata/print-a-rectangle-using-asterisks
https://www.codewars.com/kata/make-a-square-box

Super clever! I love recursion. Slower than imperative solution though :)

• the length of the strings should be random
  (on other versions, the length is a random number between 5 and 50, maybe use that)
• please use 100 random tests, not 1000
• only seed the RNG once

Golang translation