To the Top
File:  root - text - article - 2019 - 12 - product-of-array-except-self.txt.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 367 Views, 20338 Search Bots | 79 Words

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

You are given an array of integers. Return an array of the same size where the element at each index is the product of all the elements in the original array except for the element at that index.

For example, an input of [1, 2, 3, 4, 5] should return [120, 60, 40, 30, 24].

You cannot use division in this problem.

Here's a start:


def products(nums):
# Fill this in.

print products([1, 2, 3, 4, 5])
# [120, 60, 40, 30, 24]
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 367 Views, 20338 Search Bots | 79 Words Subscribe to Feed Burner

Related Articles

  1. Patterns for breaking down questions you haven
  2. Algorithm Interview Question: Symmetric k-ary Tree
  3. Daily Interview Problem: Largest BST in a Binary Tree
  4. Skip the readings, focus on problems. And use all the hints!
  5. Daily Interview Question: Longest Sequence with Two Unique Numbers
  6. Daily Interview Problem: Minimum Removals for Valid Parenthesis
  7. Consecutive Ones
  8. Staying on a Chess Board
  9. Daily Interview Problem: Decode String
  10. Daily Interview Problem: Jump to the End

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