Strong Language

CodeChefRating 1291Open on judge ↗

A string is said to be using *strong language* if it contains at least $K$ consecutive characters '*'. You are given a string $S$ with length $N$. Determine whether it uses strong language or not. ### Input - The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows. - The first line of each test case contains two

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