You are given an array of strings words (0-indexed).
In one operation, pick two distinct indices i and j, where words[i] is a non-empty string, and move any character from words[i] to any position in words[j].
Return true if you can make every string in words equal using any number of operations, and false otherwise.
Example 1:
Input: words = ["abc","aabc","bc"] Output: true Explanation: Move the first 'a' inwords[1] to the front of words[2],to makewords[1]= "abc" and words[2] = "abc".
All the strings are now equal to "abc", so returntrue.
Example 2:
Input: words = ["ab","a"] Output: false Explanation: It is impossible to make all the strings equal using the operation.
Constraints:
1 <= words.length <= 1001 <= words[i].length <= 100words[i] consists of lowercase English letters.
class Solution {
public boolean makeEqual(String[] words) {
int[] fre = new int[26];
for(int i=0;i<words.length;i++){
String w = words[i];
for(int j=0;j<w.length();j++){
char ch = w.charAt(j);
int idx = (int)(ch-'a');
fre[idx]=fre[idx]+1;
}
}
for(int i=0;i<26;i++){
if(fre[i] % words.length!=0){
return false;
}
}
return true ;
}
}
© 2021 edSlash. All Rights Reserved.