Sorting Problem

CodeChefOpen on judge ↗

Abhishek just finished explaining various sorting algorithms to his friend Shreyash. To see how well he understood the concept, Abhishek decided to test Shreyash. He gave him an unsorted array of size N (1-based indexing) and asked him to remember the integer present at the Kth index. Then he asked him to find the index where that integer would be if the array were sorted in increasing order. As S

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