How should I practice Equal Character Frequencies After At Most One Removal?

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

Is Equal Character Frequencies After At Most One Removal associated with Bloomberg LP?

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

Equal Character Frequencies After At Most One Removal

Bloomberg LP● EasyNEW GRADPHONE SCREEN

Learn

Problem statement

Given a lowercase string word, return whether you can make the string perfect by removing at most one character occurrence.

A string is perfect when every distinct character remaining in it occurs the same positive number of times. Removing no character is allowed.

Function

canEqualizeFrequency(word: String) → boolean

Examples

Example 1

word = "abcc"return = true

Remove one c, leaving a, b, and c once each.

Example 2

word = "aazz"return = true

The two present characters already have equal frequency, so use zero removals.

Example 3

word = "abbccc"return = false

The frequencies 1, 2, and 3 cannot all become equal after only one decrement.

Constraints

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