I think this solution it's better and elegant!

Inspired by Haskell solution. :)

We cannot assume limit number of cubic number in input.

so we have create a test case, which have many cubic number, such as

"153153153...153" (repeat 153 thousand or more times).

It's easy to construct this test case. We could add it.

Where to find more details about test case help function in <criterion/criterion.h>?

I will add more test cases.

Right!

This puzzle is smart!

OK, understand it.

Could you help declare this information "forbidden of typedef" in details of this kuta?
It's explicit.

considertypedef is cheat code?

typedef is feature for complex type cases. It suit for this question.

I don't understand why forbid to use it.

I don't understand

(...) = fmap fmap fmap

Could you help explain this code?

Thanks!

could help indicate these function come from which package?

• parseDec
• isWord
• bracket

I guess it should come from Parsec package, but my ghc cannot find them.

Thanks!

simply avoid to generate void string like "". Actually, I handle this case, but internal reference solution give wrong answer. :(

expected: "7b"
but got: "1+7b"
[("",3),("",-2),("b",3),("b",4)]

I remember this problem support haskell. Why cannot find it now?

system give 6 seconds to run this test. maybe you can try again.

Yes, anybody could help fix this?

I implement one foldr on List, and pass basic test. Cannot pass submit test.

I know foldr should use foldable argument but not List. But no idea how to extract first or last elements of foldable arg?

and search a lot by Google, know mappend and mempty, but don't know how to use it.

Anyone could give me a hint? Thanks!

Thanks. I see.

But I don't know javascript.
Just wait other guys translate it, or maybe I will study on javsacript someday.