Timer is Running

Find pairs with given relation
Submissions: 17   Accuracy:


  Difficulty: Easy   Marks: 2

Given an array of distinct integers, write a program to find if there exist two pairs (a, b) and (c, d) such that ab = cd, where a, b, c and d are distinct elements. If such pairs exists then print 1 else -1.


Example 1:

arr[] = {3, 4, 7, 1, 2, 9, 8} 
Output: 1
Product of 4 and 2 is 8 and also,
the product of 1 and 8 is 8.  


Example 2:

arr[] = {1, 6, 3, 9, 2, 10} 
Output: 1

Your Task:
Since, this is a function problem. You don't need to take any input, as it is already accomplished by the driver code. You just need to complete the function findPairs() that takes array arr and n  as parameters and return 1 if any such pair is found otherwise return -1. 


Expected Time Complexity: O(N2).
Expected Auxiliary Space: O(N2).


1 ≤ N ≤ 103


** For More Input/Output Examples Use 'Expected Output' option **

Contributor: Harsh Agarwal
Author: harsh.agarwal0

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.

Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.

to report an issue on this page.