https://github.com/emilwijayasekara/leetcode-1897-redistribute-characters-to-make-all-strings-equal

LeetCode Problem 1897. Redistribute Characters to Make All Strings Equal - This problem challenges to determine whether it is possible to make all strings in a given array equal through a series of operations that involve moving characters between strings. The goal is to return true if such equality can be achieved and false otherwise
https://github.com/emilwijayasekara/leetcode-1897-redistribute-characters-to-make-all-strings-equal

java leetcode leetcode-java leetcode-solutions

Last synced: about 2 months ago
JSON representation

LeetCode Problem 1897. Redistribute Characters to Make All Strings Equal - This problem challenges to determine whether it is possible to make all strings in a given array equal through a series of operations that involve moving characters between strings. The goal is to return true if such equality can be achieved and false otherwise

• Host: GitHub
• URL: https://github.com/emilwijayasekara/leetcode-1897-redistribute-characters-to-make-all-strings-equal
• Owner: EmilWijayasekara
• Created: 2023-12-30T17:55:53.000Z (about 1 year ago)
• Default Branch: main
• Last Pushed: 2023-12-31T14:56:11.000Z (about 1 year ago)
• Last Synced: 2023-12-31T15:30:54.714Z (about 1 year ago)
• Topics: java, leetcode, leetcode-java, leetcode-solutions
• Language: Java
• Homepage: https://leetcode.com/problems/redistribute-characters-to-make-all-strings-equal/description/
• Size: 0 Bytes
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# LeetCode Practice  (Day 13)

## About the problem

- *Problem Number* : 1897

- *Problem Name* : [Redistribute Characters to Make All Strings Equal](https://leetcode.com/problems/redistribute-characters-to-make-all-strings-equal/description/ "https://leetcode.com/problems/redistribute-characters-to-make-all-strings-equal/description/")

- *Problem difficulty* : Easy (59.04%%)🟢

- *Programming language used* - Java

## Problem

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.

### If you have suggestions for improvement or would like to contribute to this solution, feel free to create a pull request. 🙌😇