Timeline for Find two integers from an unordered list to sum to the input
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 17, 2020 at 9:04 | history | edited | CommunityBot | Commonmark migration | |
| Mar 24, 2017 at 22:38 | history | edited | steenbergh | CC BY-SA 3.0 | added 8 characters in body |
| Mar 23, 2017 at 13:07 | history | edited | steenbergh | CC BY-SA 3.0 | added 47 characters in body |
| Mar 23, 2017 at 12:39 | comment | added | ETHproductions | You can save another three bytes with for(y=x;++y<b.length;){. Also, you can remove all sets of braces except the outermost one, and you can remove the space after return | |
| Mar 20, 2017 at 19:31 | history | edited | steenbergh | CC BY-SA 3.0 | added 34 characters in body |
| Mar 20, 2017 at 19:18 | comment | added | Cyoce | You can use a=>b=>... to save a byte | |
| Mar 20, 2017 at 15:38 | history | edited | steenbergh | CC BY-SA 3.0 | added 161 characters in body |
| Mar 20, 2017 at 15:29 | comment | added | steenbergh | @Matt Yes, that rule is observed: y=x+1 takes care of that. | |
| Mar 20, 2017 at 14:26 | comment | added | Riker | Doesn't exit code 1, as the challenge specifically requests for invalid input. It's an invalid answer for now, but I've asked OP about this requirement for languages that can't do that easily. | |
| Mar 20, 2017 at 11:55 | history | answered | steenbergh | CC BY-SA 3.0 |