To the Top
File:  root - text - article - 2019 - 11 - largest-product-of-3-elements.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 222 Views, 16085 Search Bots | 95 Words

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

By the way, check out our NEW project AlgoPro (http://algopro.com) for over 60+ video coding sessions with ex-Google/ex-Facebook engineers.

You are given an array of integers. Return the largest product that can be made by multiplying any 3 integers in the array.

Example:

[-4, -4, 2, 8] should return 128 as the largest product can be made by multiplying -4 * -4 * 8 = 128.

Here's a starting point:


def maximum_product_of_three(lst):
# Fill this in.

print maximum_product_of_three([-4, -4, 2, 8])
# 128
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 222 Views, 16085 Search Bots | 95 Words Subscribe to Feed Burner

Related Articles

  1. Daily Interview Problem: Group Words that are Anagrams
  2. Daily Interview Problem: Running Median
  3. Reverse a Linked List
  4. Algorithm Interview Question: Max and Min with Limited Comparisons
  5. [Daily Problem] Witness of The Tall People
  6. Daily Interview Problem: Tree Serialization
  7. Daily Interview Problem:Create a balanced binary search tree
  8. Find Pythagorean Triplets
  9. Daily Interview Problem: Room scheduling
  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" />