MAX PRODUCT

CodeChefOpen on judge ↗

Given an array $A[ \ ] = \{ A_1 , A_2 , A_3 , \dots ,A_N \} $ and a number $N$ (length of array). Find the minimum length of non-empty [sub-sequence](https://en.wikipedia.org/wiki/Subsequence) of the array such that the product of all numbers in the subsequence will be maximum. (Minimum sub-sequence size is 1) ### Input - First line will contain $T$, number of testcases. Then the testcases follo

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI