loading...

re: Daily Coding Problem #1 VIEW POST

FULL DISCUSSION
 

Best way for 1 pass would be to as you iterate through the array, store the number pair that would make that index total k into an array. And then on each subsequent number check it it exists in the check array before storing its pair

Code of Conduct Report abuse