Robots suck! 😏

Just solved in Go.

My solutions was assuming the array of indices was sorted based on the examples and it woked for all the solutions.
I was also asuming the array contains no negative indices.
But, reading the description, the assumptions were just not correct.

About the first assumption, I suggest to either ...

• include the assumption that the indices are sorted in the description
• or add test cases where there are indices greater than the input string lenght before some actually valid indices.

About the second assumption, I suggest to either ...

• include the assumption that the indices are always positive
• or add test cases where there are negative indices. And even better if they are placed before some actually valid indices.

Failed random tests in Haskell do not show actual input string:

Falsifiable (after 1 test):
  ""
expected: 2
 but got: 0

I've made a fork that fixes this.

Haskell fork

• adds tests for no/all vowel strings

Haskell fork that adds testing for strings with no vowels and strings entirely composed of vowels.

Fixed

Fixed

Fixed.

Fixed.

Merged, but I wonder if it would not be better to redo the interface of the solution function for C.

It seems to be. Thanks!

please be considerate and close your issue when you found the mistake in your code ;-)

Rust translation

should be fixed, can you check ?