Ruffle The Shuffle 2

CodeChefOpen on judge ↗

$Author$ $:$ $Tanishq$ $Gupta$ $($$Btech$$-$$II$$)$ ### Problem Statement : You are given $T$ testcases for each testcase: You are given two integers $N$ and $K$ and a string of length $N$ consisting of lowercase Latin letters. You have to $shuffle$ the given string in a way such that if you divide the shuffled string into $K$ substrings then maximum of all the $K$ substrings should be $min

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