Problemintro
Shuffling a linked list
Problem of rearranging the nodes of a linked list into a uniformly random order in linearithmic time.
Problem of rearranging the nodes of a linked list into a uniformly random order in linearithmic time.
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 DWJN7Q Edit this page History Report an error