@VcC what do you propose?
https://code.sololearn.com/wlfpFe6hKJqO/?ref=app added some comments for better understanding
Ace, what's supposed to happen when the current permutation is the largest one? What do you want people to do?
My second try https://code.sololearn.com/cj84rxxW8PxC/?ref=app
Seems not difficult. https://code.sololearn.com/cyDF0QkjCi8e/#cpp
Thanks for the challenge. Here's my try... https://code.sololearn.com/czVeev3s3N0I/?ref=app
have to make
for performance one could try - perm last 2 digits - perm last 3 digits .... and find here a good solution it will be a good solution in general
@VcC Excuse me. Your code is pretty nice, But I think the ability of comparing between integer and character is only a language matter. So I think we need not be proud it so much. I think my code will work "ze..90a" if all to_i methods are removed.
all these solution have very bad execution times. If you google this you will see these are N time solutions with N = number of digits
@sayan exactly what i was mentionning. Prefer the longer one easier to read. And i want to keep my king of python oneliners title.
why it can't be 531 for 153 ???
#john did you change sth?
are repeated digits allowed? if that's the case, you have to specify a max.