• Skip to primary navigation
  • Skip to content
  • Skip to primary sidebar
  • Skip to secondary sidebar

GoHired

Interview Questions asked in Google, Microsoft, Amazon

Join WeekEnd Online Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

  • Home
  • Best Java Books
  • Algorithm
  • Internship
  • Certificates
  • About Us
  • Contact Us
  • Privacy Policy
  • Array
  • Stack
  • Queue
  • LinkedList
  • DP
  • Strings
  • Tree
  • Mathametical
  • Puzzles
  • Graph

Find Pythagorean Triplets in an array in O(N)

March 27, 2014 by Dhaval Dave

Find Pythagorean Triplets in an array

We have an array in which random integers are there. we need to find Pythagorean triplets.
which solves equation a^2 + b^2 = c^2.
Method 1 : Brute Force Method
Loop the array for three times and find a, b, and c which are solving equation.
Time complexity : O(N^3)

Method 2 : Using Hash Map to search.

  1) Create two loops and find all pairs.
  2) Find +C, -C = SquareRoot ( A^2 + B^2)
  3) Using Hash find whether C is present in Array or not.
  4) If C is present print Triplet A, B, C 
  5) Else continue till both loop completes.

Method 3 : Using Maths 

We know that
a = m^2 – n^2, b = 2mn, c = m^2 + n^2
From here you can get clue..
If not .. read further.

1)Sort the array in O(N log N) time.
2)For each element B, find the prime factorization. such that  
b = 2mn , m > n. m and n are prime
3)Calculate C = m^2 + n^2 , A= m^2 - n^2
4)With Hashmap find If C and A are in Array. Then Print Triplet C,A,B
5)Else Continue.

Explanation :

Consider Array : {3,6,8,5,10,4,12,14}

Step 1) 
Finding prime factorization such that b=2mn.
3 - not possible.
6 - 2*1*3 so m=3, n=1
8 - 2*2*2 so m=2,n=2 (not allowed , as they need to be co-prime)
5 - not possible
10 - 2*1*5 so m=5, n=1
4 - 2*1*2 so m=2, n=1 ...

Step 2) 

6 - 2*1*3 so m=3, n=1 m^2 + n^2 = 10 , m^2 - n^2 = 8 , 
both numbers are present in array can be found in O(1) 
with Hash.
    C = 10, A =8 and B = 6

=> similarly for 3,4,5 we can find 
m=2,n=1, B=4, C=5, A=3.

You can write and code for this
Best luck

Similar Articles

Filed Under: Amazon Interview Question, Flipkart Interview Questions, Interview Questions, problem Tagged With: Mathematical

Reader Interactions

Primary Sidebar

Join WeekEnd Online/Offline Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

Join WeekEnd Online/Offline Batch from 4-April-2020

WhatsApp us

Secondary Sidebar

Custom Search

  • How I cracked AMAZON
  • LeetCode
  • Adobe
  • Amazon
  • Facebook
  • Microsoft
  • Hacker Earth
  • CSE Interview

Top Rated Questions

Python Array String

flattens 2 D linked list to a single sorted link list

How strtok() Works

Microsoft BING Interview Experience

Get Minimum element in O(1) from input numbers or Stack

Check if an array has duplicate numbers in O(n) time and O(1) space

Inorder and Preorder traversals of a Binary Tree given. Output the Postorder traversal of it.

C Program for TAIL command of UNIX

SAP Interview Questions

Mirror of Tree

Introduction To Number Theory ( Part 1 )

Hackerearth : Counting Subarrays

Urban Ladder Written Test.

Find Percentage of Words matching in Two Strings

Possible sizes of bus to carry n groups of friends

25 horses 5 tracks Find 3 fastest puzzle

Given a sorted array and a number x, find the pair in array whose sum is closest to x

Advanced SQL Injection

Leetcode: Merge Intervals

write a c program that given a set a of n numbers and another number x determines whether or not there exist two elements in s whose sum is exactly x

Given Set of words or A String find whether chain is possible from these words or not

Practo Hiring Experience

Find shortest distances between every pair of vertices ( Dynamic Programming Floyd Warshall Algorithm)

simple sql injection

Longest Increasing Subsequence

Difference between a LinkedList and a Binary Search Tree BST

Serialise Deserialise N-ary Tree

Amazon Interview On-Campus For Internship – 1

‘N’ Story Building, with 1,2,3 steps how many ways can a person reach top of building.

Given a string, find the first character which is non-repetitive

Copyright © 2025 · Genesis Framework · WordPress · Log in