The Coding Streak

CodeChefRating 633Open on judge ↗

TanMinati loves solving problems. You are given an array $A$ of size $N$, where $A_i$ represents the number of problems TanMinati solved on the $i$-th day. A "streak" is defined as a sequence of consecutive days where TanMinati solves **at least $1$ problem** every day. Find the length of the **longest streak** present among these $N$ days. ### Input - The first line of input will contain a s

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