Timeline for Integer Keys and Duplicates
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 8, 2020 at 21:50 | comment | added | Sumner18 | I contemplated doing just that with the inputs, but I wanted to diversify the inputs a little bit. I can't make the challenge too easy. | |
| Jan 8, 2020 at 21:19 | history | edited | Giuseppe | CC BY-SA 4.0 |
added 7 characters in body
|
| Jan 8, 2020 at 21:13 | comment | added | Giuseppe | @Sumner18 something like this would be possible if the keys were guaranteed to be strictly less than the length of the list. | |
| Jan 8, 2020 at 20:27 | history | edited | Giuseppe | CC BY-SA 4.0 |
added 100 characters in body
|
| Jan 8, 2020 at 20:26 | comment | added | Giuseppe | @Sumner18 why yes I can. Thanks! | |
| Jan 8, 2020 at 19:50 | comment | added | Sumner18 | Couldn't you shave a byte by not aliasing x=l[1] and just using head(l,l[1]+1),l[1])? | |
| Jan 8, 2020 at 17:00 | history | answered | Giuseppe | CC BY-SA 4.0 |