Day 11: Coding Challenge

Problem - 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.

Solutions - In this problem, we will use the prefix and postfix multiplication. We will create one answer array for output.

Time Complexity - O(n)

Space Complexity - O(1)

#Codingchallenge #problemsolvingskills #problemsolving #codeforgood #60daysofchallenge #60dayscode #consistency #dsaforproblemsolving