Someone asked me a question(asked to him in an interview) that how to find triplets in an integer array A[] which satisfy following condition:
a[i]^2 + a[j]^2 = a[k]^2
i have done it in o(n^2 logn) can it be optimized.
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Someone asked me a question(asked to him in an interview) that how to find triplets in an integer array A[] which satisfy following condition:
a[i]^2 + a[j]^2 = a[k]^2
i have done it in o(n^2 logn) can it be optimized.
At least you can use hash table to store squares. So search of (i^2+j^2) for each pair will be in O(1) and in overall algorithm will take O(n^2)