> C is a Spartan language, and so should your naming be. Unlike Modula-2 and Pascal programmers, C programmers do not use cute names like ThisVariableIsATemporaryCounter. A C programmer would call that variable "tmp", which is much easier to write, and not the least more difficult to understand.
I recently stumbled upon this challenge where the OP gives a non-golfed reference implementation in C++. This makes it a no-brainer to solve the challenge with C++ by just golfing the reference.
Is it a good idea to ban C++ from that challenge, or the language X from a challenge Y where Y gives ...
Or maybe it's not really a labyrinth, but still.
Rules:
Input is a two-line string, consisting of asterisks, digits (0-9) and latin letters. That string is a labyrinth to walk through. The lines have the equal length.
Output is the number of steps you have to take to exit the string (last step...
> The goal is, having taken a string as input, remove the following duplicate of each letter with a following "triggered" case (i.e. uppercase becames lowercase and vice-versa).
> The goal of this challenge is: given a string as input, remove duplicate pairs of letters, if the latter item in pair is of opposite case. (i.e. uppercase becames lowercase and vice-versa).
@TimmyD better than Cheddar at impossibleATM bytes
@MartinEnder Yeah, but I wish there was a way to do a "replace" using overlapping matches, but either iterate over the matches or append instead of replacing.
I think someone should create a language called "Your Mom", just so that during an argument over which language is a better one, they can interject that "Your mom is a better language"
Or maybe it's not really a labyrinth, but still.
Rules:
Input is a two-line string, consisting of asterisks, digits (0-9) and latin letters. That string is a labyrinth to walk through. The lines have the equal length.
Output is the number of steps you have to take to exit the string (last step...
