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 | 313 Views, 17155 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 | 313 Views, 17155 Search Bots | 57 Words Subscribe to Feed Burner

Related Articles

  1. Daily Interview Puzzle: Falling Dominoes
  2. Most Frequent Subtree Sum
  3. Find the non-duplicate number
  4. Daily Interview Problem: Reconstrunct Binary Tree from Preorder and Inorder Traversals
  5. Daily Interview Problem: Merge Overlapping Intervals
  6. [Daily Problem] Longest Increasing Subsequence
  7. Algorithm Interview: Maximum Path Sum in Binary Tree
  8. Daily Interview Problem: Distribute Bonuses
  9. Daily Interview Problem: Reverse Integer
  10. Print a tree level-by-level, with line-breaks

Comments (0)

Your Email (Domain Part Not Exposed):

Your Comments:

Privately By Mail Colors More Smileys S x y @

Verification (Click Image 2 Refresh):

    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" />