Using recursion count how many times each of the letter a


Please write a c++ program that does the following :

1) Read a string from the user.

2) Print out the length of input string.

3) Using recursion, determine if the string is a palindrome.

4) using recursion, count how many times each of the letter "a" and "k" are repeated (There may be 0 a and 0 k in the string).

Example inputs : noon, agfhrttrhfga, riverside.

Request for Solution File

Ask an Expert for Answer!!
C/C++ Programming: Using recursion count how many times each of the letter a
Reference No:- TGS02894639

Expected delivery within 24 Hours