Question: C++ Two string st1 and st2 are Anagram if they are the same length and also contain the same letters at any order. For example,
C++ Two string st1 and st2 are Anagram if they are the same length and also contain the same letters at any order. For example, st1="silent, st2="listen are anagram. The function header to return true or false is as follows: bool is Anagram(string st1[], string st2[]) Write a complete program to read two strings and call a function to determine whether they are anagram or not. Sample run: Enter a string: A Gentleman Enter another string: Elegant man A Gentleman" and "Elegant man" are anagram CONTINUE(y/n)? y Enter a string: Funeral Enter another string: Real Fun "Funeral" and "Real Fun" are anagram CONTINUE(y/n)?
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
