Chef and Prime Domination

CodeChefOpen on judge ↗

Chef likes prime numbers as well as arrays. So, he combined both and cooked up a problem for you. Given an array of size $N$, find the length of the longest contiguous subarray with the number of primes strictly greater than the number of composites. ###Input: - First line will contain $T$, number of testcases. Then the testcases follow. - The first line of each testcase contains $N$, denoting

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