This comment is hidden because it contains spoiler information about the solution
I agree that something is off. If I understood correctly, a feature of BTreeMap is that the keys are always ordered.
The rust version has no random tests.
From the description :
The Rust implementation should return an ordered BTreeMap. Letters with the same frequency are ordered alphabetically. For example:
The Rust implementation expects letters in alphabetic order, regardless of frequency.
From the test suite :
let answer: BTreeMap<char, i32> =
The order, according to my interpretation of the description, should be a, x, f, s, d.
aha....messed up with the regex pattern;)
i printed the input text in the final test.. it's not empty! how is it giving me an error expecting len to be 0?
too difficult, created a nested list
Just click attempt because there are no sample tests.
as per my understanding there wasn't any return statement or any work was defined inside the function so overall the function was undefined.
'join' is a method on an array object. You are not returning an array, so no .join method exists.
Typescript and Julia translations.