1897. Redistribute Characters to Make All Strings Equal

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' in ```words[1] to the front of words[2],
to make ````words[1]` = "abc" and words[2] = "abc".
All the strings are now equal to "abc", so return `true`.
```

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 <= 100`
• `1 <= words[i].length <= 100`
• `words[i]` consists of lowercase English letters.

1897. Redistribute Characters to Make All Strings Equal
``````struct Solution;

use std::collections::HashMap;

impl Solution {
fn make_equal(words: Vec<String>) -> bool {
let n = words.len();
let mut hm: HashMap<char, usize> = HashMap::new();
for word in words {
for c in word.chars() {
*hm.entry(c).or_default() += 1;
}
}
for v in hm.values() {
if v % n != 0 {
return false;
}
}
true
}
}

#[test]
fn test() {
let words = vec_string!["abc", "aabc", "bc"];
let res = true;
assert_eq!(Solution::make_equal(words), res);
let words = vec_string!["ab", "a"];
let res = false;
assert_eq!(Solution::make_equal(words), res);
}
``````