Jay206-Programmer/Technical_Interview_Practice_Problems

Find Pythagorean Triplets in the given array

Opened this issue · 0 comments

Jay206-Programmer commented

I have tried to solve this problem, but I was only able to solve it in O(n^3) time complexity.

Try solving it in O(n^2) time complexity.

Task:

  1. Make a new function which solves this problem in less then O(n^3) time complexity.
    NOTE: Add the improved function Under the already written function, DO NOT delete already written function.