Timeline for Find all unique quintuplets in an array that sum to a given target
Current License: CC BY-SA 4.0
23 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
6 hours ago | answer | added | Kevin Cruijssen | timeline score: 1 | |
6 hours ago | answer | added | Arnauld | timeline score: 1 | |
8 hours ago | answer | added | tsh | timeline score: 4 | |
8 hours ago | history | became hot network question | |||
13 hours ago | history | edited | CrSb0001 | CC BY-SA 4.0 |
added 322 characters in body
|
13 hours ago | answer | added | Neil | timeline score: 2 | |
13 hours ago | answer | added | CrSb0001 | timeline score: 0 | |
13 hours ago | comment | added | Arnauld |
Suggested test case: [1,1,2,2,3,3,4,4], 11
|
|
13 hours ago | answer | added | l4m2 | timeline score: 2 | |
15 hours ago | history | edited | CrSb0001 | CC BY-SA 4.0 |
fixed test case
|
15 hours ago | comment | added | CrSb0001 | @nyxbird My bad, I'll fix that | |
15 hours ago | answer | added | nyxbird | timeline score: 2 | |
15 hours ago | comment | added | nyxbird | shouldn't the last test case be [[1,0,9,6,5],[1,0,9,4,7],[0,6,4,4,7],[1,5,4,4,7]]? all of the current answers (and mine) return that. | |
16 hours ago | answer | added | lyxal | timeline score: 2 | |
16 hours ago | history | edited | CrSb0001 | CC BY-SA 4.0 |
added 89 characters in body
|
16 hours ago | comment | added | CrSb0001 | @xnor Sorry, should've added that. My inspiration for this was from Leetcode's "3Sum" problem. | |
16 hours ago | comment | added | xnor | What's the source for this problem? | |
16 hours ago | comment | added | CrSb0001 | @Shaggy Added . | |
16 hours ago | answer | added | ATaco | timeline score: 2 | |
16 hours ago | history | edited | CrSb0001 | CC BY-SA 4.0 |
Added test case
|
16 hours ago | answer | added | Shaggy | timeline score: 2 | |
16 hours ago | comment | added | Shaggy |
Suggested test case: [1,0,9,6,5,4,4,7], 21 .
|
|
17 hours ago | history | asked | CrSb0001 | CC BY-SA 4.0 |