String Matching

CSESString AlgorithmsOpen on judge ↗

Given a string and a pattern, your task is to count the number of positions where the pattern occurs in the string. Input The first input line has a string of length n, and the second input line has a pattern of length m. Both of them consist of characters a–z. Output Print one integer: the number of occurrences. Constraints - 1 \le n,m \le 10^6 Example Input: saippuakauppias pp Output:

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