Given two string s1 and s2, the task is to check if characters of the first string can be mapped with the character of the second string such that if a character ch1 is mapped with some character ch2 then all the occurrences of ch1 will only be mapped with ch2 for both the strings.
Input: s1 = “axx”, s2 = “cbc”
‘a’ in s1 can be mapped to ‘b’ in s2
and ‘x’ in s1 can be mapped to ‘c’ in s2.
Input: s1 = “a”, s2 = “df”
Approach: If the lengths of both the strings are unequal then the strings cannot be mapped else create two frequency arrays freq1 and freq2 which will store the frequencies of all the characters of the given strings s1 and s2 respectively. Now, for every non-zero value in freq1 find an equal value in freq2. If all the non-zero values from freq1 can be mapped to some value in freq2 then the answer is possible else not.
Below is the implementation of the above approach:
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- Find all strings formed from characters mapped to digits of a number
- Check if frequency of character in one string is a factor or multiple of frequency of same character in other string
- Replace all occurrences of character X with character Y in given string
- Minimize ASCII values sum after removing all occurrences of one character
- Count occurrences of a string that can be constructed from another given string
- Find a string such that every character is lexicographically greater than its immediate next character
- Modify the string such that every character gets replaced with the next character in the keyboard
- Sum of all distances between occurrences of same characters in a given string
- Minimum string such that every adjacent character of given string is still adjacent
- Remove all occurrences of a character in a string
- Number of permutations of a string in which all the occurrences of a given character occurs together
- Remove all occurrences of a character in a string | Recursive approach
- Rearrange the given string such that all prime multiple indexes have same character
- Longest subsequence with at least one character appearing in every string
- Lengths of maximized partitions of a string such that each character of the string appears in one substring
- Maximized partitions of a string such that each character of the string appears in one substring
- Check if max occurring character of one string appears same no. of times in other
- Find length of longest subsequence of one string which is substring of another string
- Replace every character of string by character whose ASCII value is K times more than it
- Replace every character of a string by a different character
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.