Problem-1

CodeChefOpen on judge ↗

Sort the given list in ascending order by shifting an element to the end of the list. Print the minimum number of moves required to sort the given list. Input: The first and the only line of the input contains N distinct integers of list A separated by a space. Output: Print the minimum number of moves required to sort the elements. Sample Input: 1 4 2 5 6 Sample Output: 3 EXPLANATI

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