This repository was archived by the owner on Feb 19, 2026. It is now read-only.
Repository navigation
This repository was archived by the owner on Feb 19, 2026. It is now read-only.
New puzzle: next permutation in lexicographical order #7
Description
def sat(nx: List[int], x=[1, 2, 4, 3]):
"""Find the next permutation of a given list by lexicographical ordering."""
import itertools
assert len(x) == len(nx) and set(x) == set(nx)
return x < nx and all([list(perm) <= x or list(perm) >= nx for perm in list(itertools.permutations(x))])Reveal solution
def sol():
return [1, 3, 2, 4]Reveal solution
def sol():
import itertools
perms = sorted([list(p) for p in list(itertools.permutations(x))])
return perms[perms.index(x) + 1]Solvers, post your solutions in the comments using the following formatting:
<details><summary>Reveal solution</summary>
```python
def sol():
return "world" # replace with your solution
```
</details>
Activity
akalai commentedon Jun 18, 2021
Nice one!
Reveal solution