LeetCode 238 Product of Array Except Self
00:15 : Detailed Problem Explanation with Scenario
03:11 Problem Approach
04:35 Code It Up
Given an integer array nums, return an array answer such that the 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.
Example 1:
Input: nums = [1,2,3,4]
Output: [24,12,8,6]
Example 2:
Input: nums = [-1,1,0,-3,3]
Output: [0,0,9,0,0]
Link : https://leetcode.com/problems/product...
#competitiveprogramming #interview #interviewquestion
#coding #leetcode #programmer #tech #software #leetcode #programmingisfun