Question: need help with a pseudo code algorithm please and ty Write an algorithm that combines two given strings S and T such that each letter
need help with a pseudo code algorithm please and ty
Write an algorithm that combines two given strings S and T such that each letter located in position i of string T resides between two letters i and i +1 in string S. For example: Input: S = ABCD and T=WXYZ Output = AWBXCYDZ Note: You can assume strings S and T are in the same length
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
