Timeline for Sandbox for Proposed Challenges
Current License: CC BY-SA 4.0
19 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 6, 2019 at 0:48 | comment | added | Flog Edoc | @EmbodimentofIgnorance Whether you'd be doing that is up to your solution eventually, maybe that isn't the optimal golf. | |
| Apr 6, 2019 at 0:44 | comment | added | Gymhgy | So the amount of repeated letters is just original letters divided by two floored? | |
| Apr 6, 2019 at 0:39 | history | edited | Flog Edoc | CC BY-SA 4.0 |
fixed mising example
|
| Apr 6, 2019 at 0:37 | comment | added | Flog Edoc | @EmbodimentofIgnorance Fixed now. Hope it's clearer. | |
| Apr 6, 2019 at 0:32 | history | edited | Flog Edoc | CC BY-SA 4.0 |
added 248 characters in body
|
| Apr 6, 2019 at 0:29 | comment | added | Gymhgy | But it says they become a single letter | |
| Apr 6, 2019 at 0:28 | comment | added | Flog Edoc |
dog+cat+tttiger+tuna would originally have been dogcattttigertuna, the repetitions are tttt, but only one is removed, leaving the other tt intact.
|
|
| Apr 6, 2019 at 0:27 | comment | added | Gymhgy |
This is performed only on the first such instance detected. But on your example dog+cat+tttiger+tuna = dogcattigertuna, there was more than one reduction. Am I missing something?
|
|
| Apr 6, 2019 at 0:24 | comment | added | Flog Edoc | @EmbodimentofIgnorance Let me know if it's clearer now. | |
| Apr 6, 2019 at 0:24 | history | edited | Flog Edoc | CC BY-SA 4.0 |
removed negative example
|
| Apr 6, 2019 at 0:18 | comment | added | Flog Edoc | @JoKing Fixed. I hope I've included enough examples to clarify what the intention is. I've attempted to cover some stranger cases too to ensure that it's clearer and that there is less ambiguity surrounding what to do when. I generally don't expect negative or otherwise weird values to be handled, and I've added that. | |
| Apr 6, 2019 at 0:17 | history | edited | Flog Edoc | CC BY-SA 4.0 |
fixed
|
| Apr 6, 2019 at 0:15 | comment | added | Jo King Mod | So non-positive results are literally "0", not the empty string or something? What happens if you try and add to that? (p.s you don't have to define every behaviour. you can just say "you won't get an input that causes this") | |
| Apr 6, 2019 at 0:12 | history | edited | Flog Edoc | CC BY-SA 4.0 |
deleted 165 characters in body
|
| Apr 6, 2019 at 0:07 | history | edited | Flog Edoc | CC BY-SA 4.0 |
deleted 165 characters in body
|
| Apr 5, 2019 at 17:55 | history | edited | Flog Edoc | CC BY-SA 4.0 |
minor formatting issues
|
| Apr 1, 2019 at 9:50 | comment | added | Peter Taylor | I can't make any sense of "Subtraction removes as many characters as the last string, to all strings combined except it, in the same order they were inputted." Reverse engineering from the examples, I think the definition is that subtraction removes a number of characters equal to the length of the subtrahend from the end of the minuend. An example showing the reduction of even repeats after subtraction would be nice: the current example actually shows reduction after addition before the subtraction is performed. The letter e might work for examples: bee ends in a double letter. | |
| Apr 1, 2019 at 1:55 | comment | added | Gymhgy | Does the reduction of even letters happen when the operation that caused the repeating letters finishes or at the end of the expression? Otherwise, seems like a pretty interesting challenge | |
| Mar 31, 2019 at 8:15 | history | answered | Flog Edoc | CC BY-SA 4.0 |