lookup table gang

• rand_ascii_remove_count's return type is accidentally set to bool rather than std::size_t
• Consider raising the upper bound for dist_ascii_remove_count from 25 to 26 (minor boost in coverage)
• Having alternating sets of 25 valid and invalid random tests is a bit of a predictable pattern. It could be exploited, although I doubt someone is willing to go through all that trouble. It's up to you whether you think this a valid concern; if so, consider shuffling to intersperse valid and invalid tests.

Approved, but I don't have the privileges to close this.

Approved

Check this: https://www.codewars.com/kata/52b757663a95b11b3d00062d/discuss#67542f9cd8369da1c011f1e7

Can you explain throw line ? I could not understand it!

Can you explain throw line ? I could not understand it!

This Kata is specifically designed to be solved in the C language, where the use of null-terminated strings (C-strings) is fundamental to the challenge. While I understand the suggestion to make the title more explicit by referencing C-strings, I believe the current title is sufficient. Since this Kata is limited to C, and strings in C inherently follow the null-terminated convention, the title should not cause confusion within its intended context.

I still recommend adding something about null-terminated strings (or C-strings) to the title to avoid confusion. This kata isn't really about the general concept of strings in informatics; it's focused on a specific type of it.

I prefer to maintain const-clarity: everything intended to be constant, I explicitly declare as constant. It's a habit, much like fastening a seatbelt, 99.9% of the time, it may seem unnecessary, but that one time it matters, it can save your life. Besides, it costs nothing to just type one extra symbol.

well dang pretty cool

cute

Forked and approved to resolve MC, thanks!