Looks like you will need a loop from 0 to the count of the longest input word and append the char at index of each iteration from each input word until you reach the end of both words. So, on the index 3 you will have exhausted the input from "cat" and will be left with 'n' from "rain" to process.
i basically need help on the operator overloading syntax.. i know the logic i need to use.. i have used operator overloading before but this seems complicated. if u can just start the overload function for me tat will be great