Question: I am trying to write a C++ code to determine if any permutation of a phrase (ignoring whitespace and punctuation). I am required to use
I am trying to write a C++ code to determine if any permutation of a phrase (ignoring whitespace and punctuation). I am required to use std::unordered_set or std::unordered_map. The input contains separate phrases on each line. An example of a run of this program should look like
Given the following input:
civic ivicc civil livci
The program should output the following:
"civic" is a palindrome permutation "ivicc" is a palindrome permutation "civil" is not a palindrome permutation "livci" is not a palindrome permutation
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
