Timeline for The shortest way to find one unique value when all other values are the same
Current License: CC BY-SA 4.0
8 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Jul 30, 2020 at 2:14 | comment | added | Bubbler |
Tacit form: ⊢⊃⍨∘⊃∘⍋1⊥∘.=⍨ (TIO) Not so pretty, but saves a byte.
|
|
Jul 29, 2020 at 17:47 | history | edited | Ada | CC BY-SA 4.0 |
deleted 36 characters in body
|
Jul 29, 2020 at 8:13 | comment | added | mkst |
Can you use 'grade up' to get something like this K solution? {x@*<+/x=\:x} - rather than checking for equality with 1, get indices to sort ascending and take the first?
|
|
Jul 28, 2020 at 20:56 | history | edited | Ada | CC BY-SA 4.0 |
added 259 characters in body
|
Jul 28, 2020 at 20:49 | comment | added | Ada | I don't think there's any part of the K solution that will help, but I will surely add an explanation! | |
Jul 28, 2020 at 20:16 | comment | added | mkst | Can you add an explanation to the solution? Is there any part of my k solution that can help to golf this? | |
Jul 28, 2020 at 19:52 | history | edited | Ada | CC BY-SA 4.0 |
added 36 characters in body
|
Jul 28, 2020 at 17:44 | history | answered | Ada | CC BY-SA 4.0 |