Timeline for Maximum number of distinct substrings
Current License: CC BY-SA 3.0
18 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 5, 2021 at 13:43 | vote | accept | user1502040 | ||
| Jan 5, 2021 at 9:37 | vote | accept | user1502040 | ||
| Jan 5, 2021 at 13:43 | |||||
| Jun 17, 2020 at 9:04 | history | edited | CommunityBot |
Commonmark migration
|
|
| Jul 9, 2017 at 21:19 | vote | accept | user1502040 | ||
| Jan 5, 2021 at 9:37 | |||||
| Jul 9, 2017 at 19:58 | history | tweeted | twitter.com/StackCodeGolf/status/884139760247160832 | ||
| Jul 9, 2017 at 19:43 | comment | added | user1502040 | @veganaiZe The double digits have a repeated substring. | |
| Jul 9, 2017 at 9:53 | comment | added | veganaiZe |
So wouldn't n=2, k=3 output 9: 11,12,21,22,31,32,33,13,23?
|
|
| Jul 8, 2017 at 16:50 | answer | added | nimi | timeline score: 2 | |
| Jul 8, 2017 at 16:36 | answer | added | PurkkaKoodari | timeline score: 3 | |
| Jul 8, 2017 at 16:30 | history | edited | user1502040 | CC BY-SA 3.0 |
deleted 1 character in body
|
| Jul 8, 2017 at 16:29 | answer | added | ZaMoC | timeline score: 2 | |
| Jul 8, 2017 at 16:13 | history | reopened |
Jonathan Allan Peter Taylor Zgarb Steadybox totallyhuman |
||
| Jul 8, 2017 at 16:05 | review | Reopen votes | |||
| Jul 8, 2017 at 16:15 | |||||
| Jul 8, 2017 at 15:45 | history | edited | user1502040 | CC BY-SA 3.0 |
added 458 characters in body
|
| Jul 8, 2017 at 15:15 | history | closed |
Okx ZaMoC Erik the Outgolfer totallyhuman user41805 |
Needs details or clarity | |
| Jul 8, 2017 at 15:09 | comment | added | ETHproductions | Could you please give some examples? It's kind of hard to follow the challenge from that very short description. | |
| Jul 8, 2017 at 14:55 | answer | added | Leaky Nun | timeline score: 2 | |
| Jul 8, 2017 at 14:47 | history | asked | user1502040 | CC BY-SA 3.0 |