![]() |
VOOZH | about |
Given an array of integers, update every element with the multiplication of previous and next elements with the following exceptions.
a) The First element is replaced by the multiplication of the first and second.
b) The last element is replaced by multiplication of the last and second last.
Example:
Input : arr[] = {2, 3, 4, 5, 6}
Output : arr[] = {6, 8, 15, 24, 30}// We get the above output using following
// arr[] = {2*3, 2*4, 3*5, 4*6, 5*6} Source: Top 25 Interview Questions
Simple Solution is to create an auxiliary array ay, copy the contents of the given array to the auxiliary array. Finally, traverse the auxiliary array and update the given array using copied value. The Time complexity of this solution is O(n), but it requires O(n) extra space.
An efficient solution can solve the problem in O(n) time and O(1) space. The idea is to keep track of previous elements in the loop.
Flowchart:
Algorithm:
Below is the implementation of this idea.
6 8 15 24 30
Time complexity: O(n) where n is size of given array
Auxiliary Space: O(1) because it is using constant space for variables