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 | 230 Views, 19624 Search Bots | 79 Words
| Browse | Archive
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 230 Views, 19624 Search Bots | 79 Words
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
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:
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 230 Views, 19624 Search Bots | 79 Words 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]
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
Related Articles
- A trick for getting good at coding interviews FASTER
- Most Frequent Subtree Sum
- Daily Interview Problem: 3 Sum
- [Daily Problem] Longest Palindromic Substring
- Daily Interview Problem: Deepest Node in a Binary Tree
- Daily Interview Problem: Largest BST in a Binary Tree
- Non-decreasing Array with Single Modification
- Daily Interview Problem: Group Words that are Anagrams
- Maximum In A Stack
- First and Last Indices of an Element in a Sorted Array
©2006~2024 SteakOverCooked - 0.01107 Seconds(s) - 1616.315 KB/s - 24 Online
Memory: 494.13 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
How to Cook a Perfect Steak? | <meta name="robots" content="noindex, follow" />
![](/images/top.jpg)
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
Read & Write - Normal - Mini - Post - All Comments - Statistics
Be the first one to comment this page !