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 | 172 Views, 16322 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 | 172 Views, 16322 Search Bots | 79 Words Subscribe to Feed Burner

Related Articles

  1. Generate All IP Addresses
  2. Daily Interview Problem: Circle of Chained Words
  3. Algorithm Interview: Subarray With Target Sum
  4. Daily Interview Problem: Minimum Removals for Valid Parenthesis
  5. Daily Interview Problem: Queue Using Two Stacks
  6. Algorithm Interview: Lowest Common Ancestor of 2 Nodes in Binary Tree
  7. [Daily Problem] Remove Consecutive Nodes that Sum to 0
  8. Daily Interview Problem: Running Median
  9. Algorithm Interview Question: Find the Single Element in an Array of Duplicates
  10. Daily Interview Problem:Create a balanced binary search tree

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: October 30 2020 14:21:09 | RSS Subscription
How to Cook a Perfect Steak? | <meta name="robots" content="noindex, follow" />