Mittal and Strings

CodeChefOpen on judge ↗

Mittal and his friend are playing a game. They are given two strings S and T of lowercase English alphabets. They have to find how many times string T occurs in string S as a substring. Help Mittal win the game. ###Input First line contains string S Second line contains string T ###Output Output your answer in a single line ###Constraints $1 \leq |S| \leq 10^4$ $1 \leq |T| \leq 1

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