Largest Subarray

CodeChefOpen on judge ↗

Pratkik found a new problem for you to solve , he has an array$A$ of $N$ numbers in which maximum prime factor of any number is ***<=$250$*** .He want to find in this array the maximum size subarray the product of whose elements is a perfect square, He is weak at maths , So he want you to just tell him the length of the maximum subarray the product of whose elements is a perfect square. ###

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