How should I practice Shortest Deletion for a Distinct Remainder?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Google phone screen problems in FastPrep.

Is Shortest Deletion for a Distinct Remainder associated with Google?

FastPrep tags this as a Google phone screen coding practice problem when the problem catalog has that company and stage context.

Google● MediumNEW GRADPHONE SCREEN

Given a case-sensitive printable-ASCII string, delete one contiguous substring so that every remaining character is distinct.

Return the minimum number of deleted characters. Deleting zero characters is allowed, and deleting the entire string is also a valid fallback.

minDeletionForDistinct(text: String) → int

text = "abca"return = 1

Deleting either occurrence of a leaves three distinct characters.

text = "abc"return = 0

The original string already contains no repeated character.