Vowel Pairs
Lesson 21 of 25 in Coddy's Coding Problems: Volume 2 course.
Your task is to count the number of vowel pairs in a sequence of strings. You will continue inputting strings until a hash (#) is entered. For each string, count all pairs of consecutive vowels, considering both uppercase and lowercase letters. Print each pair on a new line, followed by the total number of pairs at the end.
Challenge
HardWrite a program that continuously inputs strings until a hash (#) sign is entered. Perform the required task by counting the vowel pairs in each string. Output each pair on a new line.
Input
Why so serious?
#
Output
io
ou
2
Try it yourself
#include <stdio.h>
int main() {
// Write code here
return 0;
}All lessons in Coding Problems: Volume 2
1Course Introduction
Introduction4Hard Difficulty
Digit SumReverse MatrixVowel PairsMagical SquareHappy SubsequenceTriple DivisionSorting