The ye dilemma

CodeChefOpen on judge ↗

You are given a string of all lowercase characters. You have to find the minimum length sub-string such that S[i..j] where 1 <= i<= j <= |S| contains at-least K occurrences of the string "ye". ###Input: - First line will contain $T$, number of testcases. Then the testcases follow. - Each testcase contains of a single line of input, string $S$ and $K$. ###Output: For each testcase, outpu

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