Write code that finds all Pythagorean triplets (a, b, c) of natural numbers with a < b < c, all at most 100, satisfying a^2 + b^2 = c^2. Then state the time complexity and mention how to do better.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.