To the Top
File:  root - text - article - 2019 - 10 - find-pythagorean-triplets.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | English | Home Page | Category: Computing | 295 Views, 16731 Search Bots | 57 Words

Subscribe to Feed Burner | Browse | Archive
Hi, here's your problem today. This problem was recently asked by Uber:

Given a list of numbers, find if there exists a pythagorean triplet in that list. A pythagorean triplet is 3 variables a, b, c where a^2 + b^2 = c^2

Example:
Input: [3, 5, 12, 5, 13]
Output: True
Here, 5^2 + 12^2 = 13^2.


def findPythagoreanTriplets(nums):
# Fill this in.

print findPythagoreanTriplets([3, 12, 5, 13])
# True
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | English | Home Page | Cateogry: Computing | 295 Views, 16731 Search Bots | 57 Words Subscribe to Feed Burner

Related Articles

  1. Daily Interview Problem: Jump to the End
  2. Algorithm Interview: Lowest Common Ancestor of 2 Nodes in Binary Tree
  3. Windows Scripting
  4. Algorithm Interview: Convert Roman Numerals to Decimal
  5. Daily Interview Puzzle: Falling Dominoes
  6. Skip the readings, focus on problems. And use all the hints!
  7. Daily Interview Problem: Given two arrays, write a function to compute their intersection.
  8. Algorithm Interview Question: Find the Single Element in an Array of Duplicates
  9. Daily Interview Problem: Largest Product of 3 Elements I
  10. [Daily Problem] Longest Increasing Subsequence

Comments (0)

    Be the first one to comment this page !


Page Edited: May 11 2024 14:36:49 | RSS Subscription
How to Cook a Perfect Steak? | <meta name="robots" content="noindex, follow" />