It was a fun kata to do but it says to not worry about validation and yet even tho I passed all the normal tests I fail the ones when it gives non valid ecuations such as "-", ((number), so on.
An esoteric language developed as an attempt to write the smallest possible compiler for a turing complete language http://en.wikipedia.org/wiki/Brainfuck
You need to return a dynamically allocated array with all the index positions of the capital letters and additionally write its length into the uppercase_count pointer.
At some point, the description must have been updated as it now specifies that the input consists solely of ASCII letters, which consists only of ['A'..'Z'] ++ ['a'..'z'].
Haskell fork which updates the tests to conform to this specification.
I can't believe i actually solved this, nice kata
I had fun resolving this kata. It took me several hours but I learned a lot, thank you :)
It was a fun kata to do but it says to not worry about validation and yet even tho I passed all the normal tests I fail the ones when it gives non valid ecuations such as "-", ((number), so on.
An esoteric language developed as an attempt to write the smallest possible compiler for a turing complete language http://en.wikipedia.org/wiki/Brainfuck
This comment is hidden because it contains spoiler information about the solution
Java translation
Hi, check the kata.
Translate Dart
Prompted me to learn about all the static methods char and string has. Good one.
2nd Time I Got Top answer, lets go
Fixed for both langauges.
Approved the fork.
Fixed.
You need to return a dynamically allocated array with all the index positions of the capital letters and additionally write its length into the
uppercase_countpointer.Currently you are just returning a null-pointer.
At some point, the description must have been updated as it now specifies that the input consists solely of ASCII letters, which consists only of
['A'..'Z'] ++ ['a'..'z'].Haskell fork which updates the tests to conform to this specification.
Loading more items...