Answer 1

heres mine...
short nd efficient..(version 1)
@ Ace ## nice challenge sir

(version 2)

## 2 line code

https://code.sololearn.com/cbHJwBPGfv82/?ref=app

## input a integer ##

https://code.sololearn.com/c6ODM0Tw0bCR/?ref=app

Answer 2

Solved it
https://code.sololearn.com/cBCCiT84S6Ll/?ref=app

Answer 3

My try:
https://code.sololearn.com/Wsvu75fEsima/?ref=app

Answer 4

bookmarking thread

Answer 5

@VcC what do you propose?

Answer 6

My try
https://code.sololearn.com/cQtSFAa16EtM/?ref=app

Answer 7

just did it with

python, itertools, set, index

https://code.sololearn.com/cOHP6DbYndUY

Answer 8

https://code.sololearn.com/wlfpFe6hKJqO/?ref=app added some comments for better understanding

Answer 9

Ace, what's supposed to happen when the current permutation is the largest one? What do you want people to do?

Answer 10

My second try
https://code.sololearn.com/cj84rxxW8PxC/?ref=app

Answer 11

Seems not difficult.
https://code.sololearn.com/cyDF0QkjCi8e/#cpp

Answer 12

Thanks for the challenge.
Here's my try...
https://code.sololearn.com/czVeev3s3N0I/?ref=app

Answer 13

have to make

Answer 14

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

Answer 15

@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.

Answer 16

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

Answer 17

@sayan exactly what i was mentionning. Prefer the longer one easier to read. And i want to keep my king of python oneliners title.

Answer 18

why it can't be 531 for 153 ???

Answer 19

#john did you change sth?

Answer 20

are repeated digits allowed? if that's the case, you have to specify a max.