Cryptos

CodeChefOpen on judge ↗

Problem Description Jeorge loves strings especially manipulating them. His friend Pranav, decides to test Jeorge's knowledge and gives him a question to solve. Pranav gives Jeorge 2 strings,W and S. Jeorge is allowed to manipulate the string S anyway he wants such that after his manipulation the string S must contain W maximum number of times. For example if W is 'noon' and S is 'axsxsdsxnsxsonsd

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