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 | 497 Views, 20771 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 | 497 Views, 20771 Search Bots | 95 Words Subscribe to Feed Burner

Related Articles

  1. Non-decreasing Array with Single Modification
  2. Number of Ways to Climb Stairs
  3. Daily Interview Problem: Largest BST in a Binary Tree
  4. Multitasking
  5. Algorithm Interview Question: H-Index
  6. ImageMagick Vulnerabilities -  CVE-2016–3714
  7. Algorithm Interview: Lowest Common Ancestor of 2 Nodes in Binary Tree
  8. Daily Interview Problem: Tree Serialization
  9. Daily Interview Problem: Distribute Bonuses
  10. New Vulnerabilities (CVE-2016-4581) have been detected in CentOS/RHEL/CloudLinux 7

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="index, follow">