Streak-Based Subarray Counting

Consecutive Characters

Find the power of a string—the length of the longest substring with a single repeated character. Efficient O(n) solutions use either single traversal counting or a two-pointer approach.

Number of Zero-Filled Subarrays

Maximum Consecutive Ones

Find the maximum consecutive 1s in a binary array efficiently using O(N) time. Count consecutive 1s, reset on 0, and track the maximum for optimal performance.