Count Dominant Substrings

Problem Overview

• Given a string s, count how many of its substrings are dominant.
• A substring is dominant if it has even length and some character appears exactly half its length.
• Input: string s; Output: integer count of dominant substrings; constraints not specified.
• Real-world context: Amazon data analysts analyzing patterns in strings.
• From Amazon interviews; a coding interview problem and interview question focused on string analysis.