Coding (Algo)

Count Distinct Text Fragments

Algorithm: Suffix automata Difficulty: Hard Time: 55 minutes

Goal

Return the number of distinct non-empty contiguous substrings without constructing or storing all of those substrings.

What this task practices

Count Distinct Text Fragments 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 hard 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.