How should I practice Count Equal-Distinct Character Partitions?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Infosys online assessment problems in FastPrep.

Is Count Equal-Distinct Character Partitions associated with Infosys?

FastPrep tags this as a Infosys online assessment coding practice problem when the problem catalog has that company and stage context.

Count Equal-Distinct Character Partitions

Infosys● HardNEW GRADOA

Learn

Problem statement

Partition a non-empty lowercase string into one or more non-empty contiguous parts. A partition is valid when every part contains the same number of distinct characters.

Return the number of valid partitions modulo 1,000,000,007.

Function

countEqualDistinctPartitions(value: String) → int

Examples

Example 1

value = "aaa"return = 4

Every cut pattern is valid because every non-empty part has one distinct character.

Example 2

value = "abca"return = 3

The valid partitions are the whole string, four single characters, and ab | ca.

Constraints

1 <= value.length <= 100000
value contains only lowercase English letters.

Source note: Interview prompt excerpt preserved as source evidence.