Mysterious String

CodeChefOpen on judge ↗

You are given a string and your task is to distribute the string to form k non – empty strings (order does not matter ) such that their lexicographically maximum string should be lexicographically minimum possible. Suppose the string is abcd and k=2, then examples of valid distributions are : • a - bcd • ab - cd • abc - d • ad - bc • acd - b • bcd

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