"The restriction is that the characters in part1 and part2 should be in the same order as in s."
It should return False. The tests must not be very thorough!
How Haskell solutions pass the tests in time if virtually all of them are just plain bruteforce?
Is it correct that this solution isMerge "abc" "ca" "b" returns True?
isMerge "abc" "ca" "b"
Loading collection data...
"The restriction is that the characters in part1 and part2 should be in the same order as in s."
It should return False. The tests must not be very thorough!
How Haskell solutions pass the tests in time if virtually all of them are just plain bruteforce?
Is it correct that this solution
isMerge "abc" "ca" "b"
returns True?