YOUR FRIENDLY NEIGHBORHOOD

CodeChefOpen on judge ↗

The notorious *Taskmaster* has set traps in whole of *New York* to take revenge from *SpiderMan*. Our friendly neighborhood has to take out all traps in time to prevent a mishap. On the trap, two strings **A** and **B** are displayed. To nullify the trap, Spidey has to enter the minimum number of times String **A** has to be repeated so that **B** is a sub-string of it. *For Example*, if **

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