Timeline for Subarrays With At Least N Distinct Integers
Current License: CC BY-SA 4.0
14 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 20, 2021 at 10:03 | answer | added | l4m2 | timeline score: 0 | |
| Mar 10, 2021 at 0:42 | answer | added | kops | timeline score: 3 | |
| Mar 9, 2021 at 13:48 | comment | added | Kaddath | Is there an objective reason for limiting most of your challenges to a given time complexity? IMO it restricts a lot the golfing creativity, and I fail to see what good it brings in these cases | |
| Mar 9, 2021 at 12:44 | answer | added | Noodle9 | timeline score: 2 | |
| Mar 9, 2021 at 12:00 | history | tweeted | twitter.com/StackCodeGolf/status/1369256684078661637 | ||
| Mar 9, 2021 at 6:28 | history | became hot network question | |||
| Mar 9, 2021 at 1:29 | answer | added | dingledooper | timeline score: 4 | |
| Mar 9, 2021 at 1:24 | comment | added | user101295 | @tsh Good question, I've changed the wording. | |
| Mar 9, 2021 at 1:23 | history | edited | user101295 | CC BY-SA 4.0 | deleted 8 characters in body |
| Mar 9, 2021 at 1:18 | comment | added | tsh | As the question says "be at most O(S*logS) in the worst case", to my understanding: For example, an implementation loops O(S) times, each time it access some value in a Hash Set with size O(S). And the HashSet's implementation has O(S) time complexity in worst case. The implementation is invalid to this question. Is this correct? | |
| Mar 9, 2021 at 0:53 | answer | added | Arnauld | timeline score: 5 | |
| Mar 9, 2021 at 0:41 | history | edited | user101295 | CC BY-SA 4.0 | edited body |
| Mar 8, 2021 at 22:25 | history | edited | caird coinheringaahing♦ | edited tags | |
| Mar 8, 2021 at 22:23 | history | asked | user101295 | CC BY-SA 4.0 |