New Year 2021

CodeChefOpen on judge ↗

You are given with a string $S$. The string contains $N$ number of valid fragments. The fragment is a [substring](https://en.wikipedia.org/wiki/Substring) of a string. The fragment is called valid, if the string starts with the word **"newyear"**, then goes on with 0 or more characters in-between, and eventually ends with the string **"2021"**. Find such $N$ valid fragments. The two fragments a

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