One Two Three

CodeChefOpen on judge ↗

You are given a sequence made up of 1,2&3 , of length up to 1000. Find the minimum number of exchanges 'X' to put the sequence in sorted order. Input First line contains the number of test cases T. Following T lines has a number N, which denotes the size of the sequence S. Following N integers are the values of the sequence S. T N1 S0 S1... SN1 N2 S0 S1....SN2 Output For each test case,

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