← All problemsSign in

Print the Substring

Problem description. An Ordinary string s of length l is repeated n times. Now it has become a very large string S. Shyam is an engineering student. He is interested in a substring sub that contains the characters present at the prime index of the String S from it's start to it's end in the same order. Help Shyam to find the desired string sub (The indexing starts from 0). Input Input descripti

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

Sign in to chat with the tutor and save your progress.

Sign in to start