Problemcore
Permutations of a multiset
Also called distinct permutations, permutations with repetition of items.
Generate each distinct arrangement of a list that may contain repeated items exactly once.
Generate each distinct arrangement of a list that may contain repeated items exactly once.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag W6SKA5 Edit this page History Report an error