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

Related Articles

  1. Daily Interview Problem: Word Ordering in a Different Alphabetical Order
  2. Windows Scripting
  3. Daily Interview Problem: Group Words that are Anagrams
  4. Binary Tree Level with Minimum Sum
  5. Find Missing Numbers in an Array
  6. How to Play WAV music under DOS?
  7. Daily Interview Question: Create a Simple Calculator
  8. Daily Interview Problem: Deepest Node in a Binary Tree
  9. Plus One
  10. Daily Interview Problem: 3 Sum

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