That may be the gist of the problem, but the problem states 'The string has a length greater or equal to one and contains only letters from a to z.' Adding extra error handling for other symbols and capital letters is not optimal as it's assumed this is already handled before the string is passed in.
Space Complexity O(N) not bad
Your solution is correct, but fails on a minor part.
Read this for more info
This comment is hidden because it contains spoiler information about the solution
This comment is hidden because it contains spoiler information about the solution
This comment is hidden because it contains spoiler information about the solution
this solution doesnt work
crazy, I cant even understand the code
This comment is hidden because it contains spoiler information about the solution
That may be the gist of the problem, but the problem states 'The string has a length greater or equal to one and contains only letters from a to z.' Adding extra error handling for other symbols and capital letters is not optimal as it's assumed this is already handled before the string is passed in.
Providing invalid characters to the input string is what the problem is all about
This comment is hidden because it contains spoiler information about the solution
Nicely done
Reraised above with more detail
Linke a Ninja
Could someone explain to me how did his code passed the "WiresOnlyMappedOnce" test?
Loading more items...