Solve Anagram String Problem on Hacker Rank Using C# in Hindi
#Anagram #algorithm #Hackerrank #CodesEvidence #Problem #Hindi
Two words are anagrams of one another if their letters can be rearranged to form the other word.
Given a string, split it into two contiguous substrings of equal length. Determine the minimum number of characters to change to make the two substrings into anagrams of one another.
Example
S="abccse"
Break S into two parts: 'abc' and 'cde'. Note that all letters have been used, the substrings are contiguous and their lengths are equal. Now you can change 'a' and 'b' in the first substring to 'd' and 'e' to have 'dec' and 'cde' which are anagrams. Two changes were necessary.
If you want to solve this type of problem next time own their own then please watch this video till the end, you may solve this problem just copying the code but copying code is not perfect solution.
After watching this video if you still facing any challenges or issue please feel free to write to us on [email protected] or in comment section
We love to hear your query and we will back to you as soon as possible.
Happy Learning
Codes Evidence