Coding Challenge · BEGINNER
Given a string consisting of lowercase English letters, write a function to count the number of 'compressed' sequences within the string. A 'compressed' sequence is defined as a consecutive sequence of the same character appearing three or more times. For example, in the string 'aaabbc', 'aaa' is a compressed sequence.