304 North Cardinal St.
Dorchester Center, MA 02124

# Rearrange Characters to Make Target String LeetCode Solution

## Problem – Rearrange Characters to Make Target String LeetCode Solution

You are given two 0-indexed strings `s` and `target`. You can take some letters from `s` and rearrange them to form new strings.

Return the maximum number of copies of `target` that can be formed by taking letters from `s` and rearranging them.

Example 1:

``````Input: s = "ilovecodingonleetcode", target = "code"
Output: 2
Explanation:
For the first copy of "code", take the letters at indices 4, 5, 6, and 7.
For the second copy of "code", take the letters at indices 17, 18, 19, and 20.
The strings that are formed are "ecod" and "code" which can both be rearranged into "code".
We can make at most two copies of "code", so we return 2.``````

Example 2:

``````Input: s = "abcba", target = "abc"
Output: 1
Explanation:
We can make one copy of "abc" by taking the letters at indices 0, 1, and 2.
We can make at most one copy of "abc", so we return 1.
Note that while there is an extra 'a' and 'b' at indices 3 and 4, we cannot reuse the letter 'c' at index 2, so we cannot make a second copy of "abc".``````

Example 3:

``````Input: s = "abbaccaddaeea", target = "aaaaa"
Output: 1
Explanation:
We can make one copy of "aaaaa" by taking the letters at indices 0, 3, 6, 9, and 12.
We can make at most one copy of "aaaaa", so we return 1.``````

Constraints:

• `1 <= s.length <= 100`
• `1 <= target.length <= 10`
• `s` and `target` consist of lowercase English letters.

### Rearrange Characters to Make Target String LeetCode Solution in Java

``````class Solution
{
public int rearrangeCharacters(String s, String target)
{
int[] freq = new int, freq2 = new int;
for(char ch : s.toCharArray())
freq[ch-'a']++;
for(char ch : target.toCharArray())
freq2[ch-'a']++;

int min = Integer.MAX_VALUE;
for(char ch : target.toCharArray())
min = Math.min(min,freq[ch-'a']/freq2[ch-'a']);

return min;
}
}``````

### Rearrange Characters to Make Target String LeetCode Solution in C++

``````Approach :
=> Take two map,  one to store frequency of target, and another for sentence.
=> Traverse over the mp(frequency of target ) and calculate the minimum frequency ratio
mn =  min(mn ,   frequency of a char in sentance / frequency of same char in target) ;

Space : O(n)
Time : O(n)
class Solution {
public:
int rearrangeCharacters(string s, string target) {
unordered_map<char,int> targetFreq ;
for(auto a : target) {
targetFreq[a] ++;
}
unordered_map<char , int> sentFreq ;
for(auto a : s) {
sentFreq[a] ++ ;
}
int mn = INT_MAX  ;
for(auto a : targetFreq ) {
mn = min(mn , sentFreq[a.first]/a.second);
}
return mn ;
}
};``````

### Rearrange Characters to Make Target String LeetCode Solution in Python

`````` public int rearrangeCharacters(String s, String target) {
int[] cnt1 = new int, cnt2 = new int;
for (int i = 0; i < s.length(); ++i) {
++cnt1[s.charAt(i) - 'a'];
}
for (int i = 0; i < target.length(); ++i) {
++cnt2[target.charAt(i) - 'a'];
}
int mi = Integer.MAX_VALUE;
for (int i = 0; i < target.length(); ++i) {
int idx = target.charAt(i) - 'a';
mi = Math.min(mi, cnt1[idx] / cnt2[idx]);
}
return mi;
}``````
##### Rearrange Characters to Make Target String LeetCode Solution Review:

In our experience, we suggest you solve this Rearrange Characters to Make Target String LeetCode Solution and gain some new skills from Professionals completely free and we assure you will be worth it.

If you are stuck anywhere between any coding problem, just visit Queslers to get the Rearrange Characters to Make Target String LeetCode Solution

Find on LeetCode

##### Conclusion:

I hope this Rearrange Characters to Make Target String LeetCode Solution would be useful for you to learn something new from this problem. If it helped you then don’t forget to bookmark our site for more Coding Solutions.

This Problem is intended for audiences of all experiences who are interested in learning about Data Science in a business context; there are no prerequisites.

Keep Learning!

More Coding Solutions >>

LeetCode Solutions

Hacker Rank Solutions

CodeChef Solutions