I also have 1 test case failing "Passwords lengths are not different enough! (6-20 chars)". I'm not sure what's wrong. Please let me know...
Test Results:
Generating 10000 passwords ...
Testing validity ...
✔ Test Passed
Testing for password lengths ...
✘ Passwords lengths are not different enough! (6-20 chars)
Testing for inequality ...
✔ Test Passed
Testing for character count ...
✔ Test Passed
You should output the input string.
I bet there was only one letter and you double it with your algorithm! :-)
"The inner content is the content of a word without first and the last char."
Is there an issue with one of the tests?:
'jzxwnjgao jtsrrky sxrjs uxvrqokdy qwgb zxwsoim ww xfo' should equal 'jzxwnjgao jtsrrky sxrjs uxvrqokdy qwgb zxwsoim w xfo'
Why the sort would tranform 'ww' into 'w'?
My solution passes all the tests with exception of this edge case where the requirements don't seem to be 100% clear.
I found this kata more difficult in javascript as compire to Python !!! Great kata
thanks
Oh, ok, sweet. Cheers
I just looked at it afresh and see that there is an edge case for 1 character words that need to be handled. That's where the problem was in my code.
Python. But I got it solved, my upper limit for the lengh was 1 too low.
Which language?
I also have 1 test case failing "Passwords lengths are not different enough! (6-20 chars)". I'm not sure what's wrong. Please let me know...
Test Results:
Generating 10000 passwords ...
Testing validity ...
✔ Test Passed
Testing for password lengths ...
✘ Passwords lengths are not different enough! (6-20 chars)
Testing for inequality ...
✔ Test Passed
Testing for character count ...
✔ Test Passed
You should output the input string.
I bet there was only one letter and you double it with your algorithm! :-)
"The inner content is the content of a word without first and the last char."
Is there an issue with one of the tests?:
'jzxwnjgao jtsrrky sxrjs uxvrqokdy qwgb zxwsoim ww xfo' should equal 'jzxwnjgao jtsrrky sxrjs uxvrqokdy qwgb zxwsoim w xfo'
Why the sort would tranform 'ww' into 'w'?
My solution passes all the tests with exception of this edge case where the requirements don't seem to be 100% clear.