Count Triple

Problem Overview

  • Count how many words in a sentence contain any letter appearing at least three times, ignoring case.
  • Input: a sentence string; Output: the number of such triple-letter words.
  • Words are sequences of English letters delimited by whitespace; other constraints are unspecified.
  • Text processing domain; a Ziprecruiter interviews coding interview problem and common interview question.

Example

Unlock to view complete problem details

and practice with sample input/output

Was this article helpful?

View Test Cases & Run Code requires membership

Input Variables
Execution Result: