Pythagorean Triplets Detection

Determine if an array contains a Pythagorean triplet by checking whether there are three integers x, y, and z such that x² + y² = z² within the array.

Input:

The first line contains an integer 't', the number of test cases. Each test case has the following format: For each test case, the first line has an integer 'n', the number of elements in the array. The second line lists 'n' space-separated integers.

Output:

For each test case, output “yes” if a Pythagorean triplet is present, otherwise output “no”.

Example:

If the input is as follows:

t = 1, n = 5, array = [3, 1, 4, 6, 5]

The output would be:

yes

Constraints:

1

Question

Pythagorean Triplets Detection

Determine if an array contains a Pythagorean triplet by checking whether there are three integers x, y, and z such that x² + y² = z² within the array.

Input:

The first line contains an integer 't', the number of test cases. Each test case has the following format: For each test case, the first line has an integer 'n', the number of elements in the array. The second line lists 'n' space-separated integers.

Output:

For each test case, output “yes” if a Pythagorean triplet is present, otherwise output “no”.

Example:

If the input is as follows:

t = 1, n = 5, array = [3, 1, 4, 6, 5]

The output would be:

yes

Constraints:

1 <= T <= 10
3 <= N <= 10³
1 <= a[i] <= 10⁴
Time Limit: 1 second

Note:

The integers x, y, and z do not need to be distinct but must be from different indices.
The integers can appear in any order in the array.

Accepted Answer

Detect if an array contains a Pythagorean triplet by checking if there are three integers x, y, and z such that x^2 + y^2 = z^2.

Iterate through all possible combinations of three integers in the array and check if x^2 + y^2 = z^2.
Use a nested loop to generate all possible combinations efficiently.
Return 'yes' if a Pythagorean triplet is found, otherwise return 'no'.