Coding (Algo)

Count Mirrored Text Ranges

Algorithm: Palindromes Difficulty: Medium Time: 40 minutes

Goal

Count all non-empty palindromic substrings by their start and end positions.

What this task practices

Count Mirrored Text Ranges is a coding (algo) interview exercise that trains prompt interpretation, explicit assumptions, a concrete response, and a clear explanation of tradeoffs. The catalog marks it as medium difficulty. It focuses on Technical Reasoning, Testing, Validation. The signed-in workspace provides the tools for the round and evaluates the attempt against task-specific criteria. Reference solutions, hidden checks, evaluator instructions, and candidate work remain private.