Suppose you are given an integer array. Design a linear time algorithm to create another integer array and populate it such that the second array's \( i^{th} \) position should be a product of all numbers from the first array excluding the number at the \( i^{th} \) position. Note : You can't use division operator.
The algorithm works as :
Example - Time complexity = \( O(n) \), space complexity = \( O(n) \). public void CreateArrayFromArray(int[] array){ |