Timeline for Shortest Pangrammatic Window
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 18, 2016 at 19:27 | comment | added | Neil | Sadly I didn't think to save it and my PC crashed so now I don't know what I had; the best I can do now is 138 bytes. | |
| May 17, 2016 at 22:43 | comment | added | edc65 | My best is 142 so far | |
| May 17, 2016 at 16:35 | comment | added | Neil | I think @edc65 can beat this though, I merged the code for his exploded substrings with that for his pangram tester and ended up with a 134 byte function. | |
| May 17, 2016 at 8:03 | comment | added | user81655 |
@Neil Thanks, I always forget about the third parameter in the map function.
|
|
| May 17, 2016 at 8:02 | history | edited | user81655 | CC BY-SA 3.0 |
Improved
|
| May 17, 2016 at 7:48 | comment | added | Neil |
Can you not use [r=l="",...s].map((_,b,a)=>?
|
|
| May 17, 2016 at 3:44 | history | edited | user81655 | CC BY-SA 3.0 |
Improved
|
| May 17, 2016 at 3:25 | history | edited | user81655 | CC BY-SA 3.0 |
added 6 characters in body
|
| May 17, 2016 at 3:20 | history | answered | user81655 | CC BY-SA 3.0 |