Leetcode 2423 Remove Letter To Equalize Frequency Solution in Java | Hindi Coding Community

 

You are given a 0-indexed string word, consisting of lowercase English letters. You need to select one index and remove the letter at that index from word so that the frequency of every letter present in word is equal.

Return true if it is possible to remove one letter so that the frequency of all letters in word are equal, and false otherwise.

Note:

• The frequency of a letter x is the number of times it occurs in the string.
• You must remove exactly one letter and cannot chose to do nothing.

 

Example 1:

Input: word = "abcc"
Output: true
Explanation: Select index 3 and delete it: word becomes "abc" and each character has a frequency of 1.

Example 2:

Input: word = "aazz"
Output: false
Explanation: We must delete a character, so either the frequency of "a" is 1 and the frequency of "z" is 2, or vice versa. It is impossible to make all present letters have equal frequency.

 

Constraints:

• 2 <= word.length <= 100
• word consists of lowercase English letters only.

Java Code :

class Solution {

public boolean equalFrequency(String word) {

int len = word.length();

int[] count = new int[26];

for (int i = 0; i < len; ++ i) {

char c = word.charAt(i);

count[c - 'a'] ++;

}

for (int i = 0; i < len; ++ i) {

char c = word.charAt(i);

count[c - 'a'] --;

if (equalCount(count)) {

return true;

}

count[c - 'a'] ++;

}

return false;

}

public boolean equalCount(int[] count) {

int c = 0;

for (int i: count) {

if (i == 0) {

continue;

} else if (c == 0) {

c = i;

} else if (c == i) {

continue;

} else {

return false;

}

}

return true;

}

}