Timeline for Shortest Unique Substring
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 17, 2020 at 9:04 | history | edited | Community Bot |
Commonmark migration
|
|
| Nov 25, 2018 at 19:03 | comment | added | Maltysen | @mroman the .: with one arg is all substrs. So I map that over both strings, then fold setwise diff, so I have all substrs of first that arnt of the second, then I pick the first one, which is smallest cuz .: is sorted. | |
| Nov 25, 2018 at 14:02 | comment | added | mroman | I'd love to know how this works. | |
| Apr 30, 2016 at 15:33 | comment | added | cat | Crossed out 9 is still 9 | |
| Apr 29, 2016 at 19:20 | history | answered | Maltysen | CC BY-SA 3.0 |