Skip to content

Instantly share code, notes, and snippets.

@mudspringhiker

mudspringhiker/highest_pdt_of_3.txt

Created January 21, 2019 16:10
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save mudspringhiker/e66253e3284dfc48fa2b6a29e6baf6dc to your computer and use it in GitHub Desktop.
Save mudspringhiker/e66253e3284dfc48fa2b6a29e6baf6dc to your computer and use it in GitHub Desktop.
Download ZIP
Raw
highest_pdt_of_3.txt
Given a list of integers, find the highest product
you can get from three of the integers.
The input lists_of_ints will always have a least three
integers.
Examples:
highest_pdt_of_3([-3, -1, 0, 1, 1, 1]):
Answer is -3, -1, 1 ==> 3
highest_pdt_of_3([1,2,3,4])
Answer is [2,3,4]
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment