Timeline for Remove all adjacent duplicates
Current License: CC BY-SA 3.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 20, 2018 at 19:45 | answer | added | Soudipta Dutta | timeline score: 0 | |
| Mar 9, 2014 at 0:47 | history | edited | Anuj Kulkarni | CC BY-SA 3.0 |
edited title
|
| Mar 6, 2014 at 20:14 | vote | accept | Anuj Kulkarni | ||
| Mar 6, 2014 at 5:58 | comment | added | 200_success |
@rolfl The examples added in Rev 2 clarify both issues. "messy" → "mey". "Recursively remove" refers to the problem statement, not the implementation.
|
|
| Mar 6, 2014 at 5:55 | answer | added | 200_success | timeline score: 4 | |
| Mar 6, 2014 at 1:51 | history | edited | Jamal | CC BY-SA 3.0 |
added 36 characters in body; edited title
|
| Mar 6, 2014 at 1:14 | history | edited | Anuj Kulkarni | CC BY-SA 3.0 |
added 163 characters in body
|
| Mar 6, 2014 at 1:00 | answer | added | rolfl | timeline score: 5 | |
| Mar 6, 2014 at 0:48 | review | First posts | |||
| Mar 6, 2014 at 1:57 | |||||
| Mar 6, 2014 at 0:34 | comment | added | rolfl |
Additionally, what does it mean to remove duplicates? If I give your code the word messy it returns mey... I was expecting mesy... which one is right? Why?
|
|
| Mar 6, 2014 at 0:31 | comment | added | rolfl | Why does it have to be recursive? ... and if it has to be recursive, why is your code not recursive? | |
| Mar 6, 2014 at 0:28 | history | asked | Anuj Kulkarni | CC BY-SA 3.0 |