Question

A non-empty array A consisting of N numeric values is
given.
The product of quadruplet (P, Q, R, S) equates to A[P]
* A[Q] * A[R] * A[S]
(OSPQR<S<N).
For example, array A such that:
A[3] = -2
A[4] =
A[0] = -3 A[1] = 1 A[2] = 2
5
A[5] = 6 A[6] = 1
(0, 1, 2, 3), product is -3* 1 * 2 * -2 = 12
• (1, 2, 4, 5), product is 1 * 2 * 5 *6 = 30
• (2, 4, 5, 6), product is 2*5*6 1 = 60
60 is the product of quadruplets (2, 4, 5, 1), which is
maximal.your goal is to find the maximal product of any quadruplet for input arry[].
write an efficient algorithm for the following assumption:.
N is an integer/flot witon range[4..100,000];​

Answer 1

Answer:

jssjfdfdjgdjdsjxdkxngdjydhtsutdjiyffg

Explanation:

kydkysjgxkgdkhdkdkdkgdkhdkhdfldkydkydjgdjskydkydkydjgx vxnngsjtsjgsjjgdkgdkgdjgskgkgkgddmgdkdeiyekyeyeyryeyejieegegk