No. 254 · September 6, 2026 · Moderate
Without
Implement `Without<T, U>` so it removes every element of the tuple `T` whose type is assignable to `U`, keeping the order of what remains.
01
Puzzle
Par 3Puzzle
without-tuple.tsStroke 1 of 3Not run yet
Replace ??? — your solution is checked against the cases below. Tab indents; press Escape then Tab to move focus out.
Checks
3Without<[1, 2, 3, 2], 2>—→ [1, 3]Without<[1, 2, 3], 1 | 3>—→ [2]Without<[], 1>—→ []
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.