human
Count of adjacent Vowel Consonant Pairs | Function to count the adjacent pairs of consonant and vowels in the string.
Using a set to store the vowels so that checking each character becomes easier.
Variable to store number of consonant - vowel pairs.
If the ith character is not found in the set , means it is a consonant And if the ( i + 1 ) th character is found in the set , means it is a vowel We increment the count of such pairs.
Driver Code"
How can the above be solved in Python?

=====
Can you provide a code to count of adjacent Vowel Consonant Pairs and the other steps required?
assistant
#Here is code to count of adjacent Vowel Consonant Pairs and the other steps required.
 def countPairs ( s ) :
	st = set ( ) ;
	st . add ( ' a ' ) ;
	st . add ( ' e ' ) ;
	st . add ( ' i ' ) ;
	st . add ( ' o ' ) ;
	st . add ( ' u ' ) ;
	count = 0 ;
	n = len ( s ) ;
	for i in range ( n - 1 ) :
		if ( s [ i ] not in st and s [ i + 1 ] in st ) :
			count += 1 ;
	return count ;
if __name__ == " _ _ main _ _ " :
	s = " geeksforgeeks " ;
	print ( countPairs ( s ) ) ;