Views:6|Rating:0.00|View Time:19:6Minutes|Likes:0|Dislikes:0
/*
* Video About : Solution of Coding Challenge Named “Target Sum By 2”.
* Challenger : Hitesh Chaudhary via youtube challenge series.
* Name : Bhushan Gaykawad
* Link :
* Problem : In a given one-dimentional array which is having integers (positive, negative ie. not float or double) as elements,
* find the pair of elements whos sum will be another given integer.
* Ex. : We have an array having [ 4, 5, 12, -2, 8, 9 ] and the given sum is 10,
* then we have to find pair whos sum is 10. By observing these elements we can simply say [ 12, -2 ].
* Conditions : We want optimized code.
*/
get the code from github

Leave a Reply

Your email address will not be published. Required fields are marked *