Closed nik132-eng closed 3 years ago
please this issue assign to me
@nik132-eng, Kindly note - Not more than 2 questions can be assigned to a contributor at a time.
ok sir
can you assign me now?
@nik132-eng, Kindly add your solution to "leetcode" folder Deadline - 09/10/2021
Enter your question -
Given an integer array nums, return an array answer such that answer[i] is equal to the product of all the elements of nums except nums[i].
The product of any prefix or suffix of nums is guaranteed to fit in a 32-bit integer.
You must write an algorithm that runs in O(n) time and without using the division operation.
Enter link to the question(if question belongs to any online platform) -
https://leetcode.com/problems/product-of-array-except-self/
Tags for the question(eg - Array, Basic, Stack, etc.) -
Array