Timeline for Complex permutation
Current License: CC BY-SA 4.0
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 17, 2022 at 21:16 | comment | added | solid.py | Thank you all for your feedback! | |
| Mar 17, 2022 at 21:15 | history | edited | solid.py | CC BY-SA 4.0 |
Improved golfing
|
| Mar 17, 2022 at 20:44 | comment | added | pxeger |
88 bytes: lambda l:{p for p in permutations(l)if p[:len([*groupby(p)])]==p};from itertools import*
|
|
| Mar 16, 2022 at 7:18 | history | edited | solid.py | CC BY-SA 4.0 |
Improved golfing
|
| Mar 16, 2022 at 2:27 | comment | added | loopy walt |
89 bytes using groupby to check for repeats: ato.pxeger.com/…
|
|
| Mar 14, 2022 at 20:04 | history | edited | solid.py | CC BY-SA 4.0 |
edited body
|
| Mar 14, 2022 at 19:55 | history | edited | solid.py | CC BY-SA 4.0 |
Improved golfing
|
| Mar 14, 2022 at 19:50 | comment | added | LeopardShark |
pairwise(p) (where pairwise comes, conveniently, from itertools) does the same as zip(p,p[1:]). I don’t know where you could host it, though.
|
|
| Mar 14, 2022 at 17:55 | comment | added | LeopardShark |
In Python 3.10 you can save a byte with pairwise.
|
|
| Mar 13, 2022 at 20:30 | history | edited | solid.py | CC BY-SA 4.0 |
Improved wording
|
| Mar 13, 2022 at 20:23 | history | edited | solid.py | CC BY-SA 4.0 |
Improved golfing
|
| Mar 13, 2022 at 18:58 | history | edited | solid.py | CC BY-SA 4.0 |
added 101 characters in body
|
| Mar 13, 2022 at 18:53 | history | answered | solid.py | CC BY-SA 4.0 |