NOBITA SUBSTRING

CodeChefOpen on judge ↗

Nobita has taken the challenge from Dekesugi to impress Shizuka. As Doraemon is on vacation, Nobita is asking you to help him. Dekesugi has given Nobita string S of lower letters of size n and an integer m. Now Dekesugi wants Nobita to form a string S' of some length such that it is minimum and the number of substrings S from S' will be equal to m. Help Nobita in finding the string S’. Constr

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