Not again T-Ray

CodeChefOpen on judge ↗

Deadpool’s arch enemy T-Ray would leave the New York city if Deadpool defeats him in a game, despite of it being a rather unconventional way for a superhero to beat his enemy. Deadpool would win the game if he could accurately predict the maximum number of times a move is made. The game consists of two random arrays namely A and B each having the same number of elements. A move in a game is descr

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