No. 280 · October 2, 2026 · Brutal
All combinations
Implement AllCombinations<U> for a union of string literals. Produce every non-repeating ordering of every subset, plus the empty string.
01
Puzzle
Par 5Puzzle
all-combinations.tsStroke 1 of 5Not run yet
Replace ??? — your solution is checked against the cases below. Tab indents; press Escape then Tab to move focus out.
Checks
3AllCombinations<'A' | 'B'>—→ '' | 'A' | 'B' | 'AB' | 'BA'AllCombinations<'X'>—→ '' | 'X'AllCombinations<never>—→ ''
How a check is judged Exact type equality, not assignability — an intersection is not the same as the flattened object.
How everyone did
Fewer than 5 people have solved this one so far. The distribution appears once there is enough of a sample to mean anything.
Short game
Fewest charactersNo public scores yet.
02
Annotated solution
This write-up publishes 24 hours after the puzzle closes.