Timeline for Find duplicate in linear time and space
Current License: CC BY-SA 4.0
14 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 25, 2020 at 15:00 | history | tweeted | twitter.com/StackCodeReview/status/1264934311989559298 | ||
| Apr 10, 2019 at 12:12 | vote | accept | thadeuszlay | ||
| Apr 10, 2019 at 12:04 | comment | added | thadeuszlay | @morbusg ok, what’s your point ? | |
| Apr 10, 2019 at 10:47 | comment | added | morbusg | sorry for nitpicking, but a set – by definition – is a collection of distinct objects. | |
| Apr 10, 2019 at 8:57 | vote | accept | thadeuszlay | ||
| Apr 10, 2019 at 9:12 | |||||
| Apr 10, 2019 at 8:55 | answer | added | Blindman67 | timeline score: 3 | |
| Apr 10, 2019 at 8:54 | history | edited | thadeuszlay | CC BY-SA 4.0 |
added 1 character in body
|
| Apr 10, 2019 at 8:50 | comment | added | thadeuszlay | @greybeard but I don't know whether it's good practice to mutate the input value. | |
| Apr 10, 2019 at 8:49 | comment | added | greybeard |
Announced as imperative solution, I didn't expect nor notice more than one - even eye-balling it has to wait till after "day-time chores".
|
|
| Apr 10, 2019 at 8:22 | comment | added | thadeuszlay |
@greybeard isn't findDuplicate3 O(1) space? I don't use an additional variable - only the running variable i.
|
|
| Apr 10, 2019 at 8:16 | comment | added | greybeard | (How about sketching an O(1) space solution?) | |
| Apr 10, 2019 at 8:06 | answer | added | RoToRa | timeline score: 3 | |
| Apr 10, 2019 at 2:27 | history | edited | thadeuszlay | CC BY-SA 4.0 |
added 314 characters in body
|
| Apr 10, 2019 at 2:02 | history | asked | thadeuszlay | CC BY-SA 4.0 |