find a pair with highest product from a given array of integers

LetsGrowMoreCommunity / DSA-Playyard

Explore the world of Data Structures and Algorithm

18 stars 51 forks source link

find a pair with highest product from a given array of integers #18

Closed sameeksharl closed 3 years ago

sameeksharl commented 3 years ago

Contribution Guidelines for this question

Languages available : C++, Java, Python (please do mention in which language you will be implementing)
Well Commented Code
In the starting, add a brief explanation of the algorithm and at the end, add testcases .
if possible, add time and space complexity
kindly upload your code in Arrays -> Language (C++, Java, Python) Folder
NO PLAGIARISM

sameeksharl commented 3 years ago

Sample Input/output

Original array: [-1, 2, 0, 4, 9, 0, 10, 4] Maximum product pair is: (9, 10) Original array: [0, 1, -2, -6, 5, 0, -6] Maximum product pair is: (-6, -6)