Timeline for Find all unique quintuplets in an array that sum to a given target
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 11, 2024 at 8:01 | comment | added | Arnauld | My bad. I was reading the 1st condition as 0 <= a<b<c<d<e < n from the beginning. | |
| Dec 10, 2024 at 23:48 | comment | added | lyxal♦ | @Arnauld "You may return the answer in any order. For example, given the array [-5,-2,-2,1,3,4,6] and target 0, you could return any permutation of [[-5,-2,-2,3,6]]." | |
| Dec 10, 2024 at 23:40 | comment | added | lyxal♦ | @Arnauld I don't see why it wouldn't, regardless of 0 or 1 indexing. | |
| Dec 10, 2024 at 22:56 | comment | added | CrSb0001 | @Arnauld I allow it to be 0-indexed or 1-indexed. | |
| Dec 10, 2024 at 22:43 | history | edited | lyxal♦ | CC BY-SA 4.0 | added 584 characters in body |
| Dec 10, 2024 at 22:29 | history | answered | lyxal♦ | CC BY-SA 4.0 |