Program to count the number of vowels in a word Last Updated : 18 Jan, 2024 Summarize Comments Improve Suggest changes Share Like Article Like Report Write a program to count the number of vowels in a given word. Vowels include 'a', 'e', 'i', 'o', and 'u' (both uppercase and lowercase). The program should output the count of vowels in the word. Examples: Input: "programming"Output: 3Explanation: The word "programming" has three vowels ('o', 'a', 'i'). Input: "HELLO"Output: 2Explanation: The word "HELLO" has two vowels ('E', 'O'). Approach: To solve the problem, follow the below idea: Iterate through each character in the given word and check if it is a vowel. If it is, increment the count. Step-by-step algorithm: Initialize a variable vowelCount to 0 to keep track of the number of vowels.Iterate through each character in the word.Check if the character is a vowel (either uppercase or lowercase).If it is a vowel, increment vowelCount.After iterating through all characters, vowelCount will contain the total count of vowels.Below is the implementation of the algorithm: C++ #include <iostream> using namespace std; int main() { char word[] = "programming"; int vowelCount = 0; for (int i = 0; word[i] != '\0'; ++i) { if (word[i] == 'a' || word[i] == 'e' || word[i] == 'i' || word[i] == 'o' || word[i] == 'u' || word[i] == 'A' || word[i] == 'E' || word[i] == 'I' || word[i] == 'O' || word[i] == 'U') { ++vowelCount; } } cout << "Number of vowels: " << vowelCount << endl; return 0; } C #include <stdio.h> int main() { char word[] = "programming"; int vowelCount = 0; for (int i = 0; word[i] != '\0'; ++i) { if (word[i] == 'a' || word[i] == 'e' || word[i] == 'i' || word[i] == 'o' || word[i] == 'u' || word[i] == 'A' || word[i] == 'E' || word[i] == 'I' || word[i] == 'O' || word[i] == 'U') { ++vowelCount; } } printf("Number of vowels: %d\n", vowelCount); return 0; } Java public class VowelCount { public static void main(String[] args) { String word = "programming"; int vowelCount = 0; for (int i = 0; i < word.length(); i++) { char currentChar = word.charAt(i); if (currentChar == 'a' || currentChar == 'e' || currentChar == 'i' || currentChar == 'o' || currentChar == 'u' || currentChar == 'A' || currentChar == 'E' || currentChar == 'I' || currentChar == 'O' || currentChar == 'U') { vowelCount++; } } System.out.println("Number of vowels: " + vowelCount); } } Python3 word = "programming" vowel_count = 0 for char in word: if char.lower() in ['a', 'e', 'i', 'o', 'u']: vowel_count += 1 print("Number of vowels:", vowel_count) C# using System; class Program { static void Main() { string word = "programming"; int vowelCount = 0; foreach(char c in word) { if ("aeiouAEIOU".Contains(c)) { vowelCount++; } } Console.WriteLine("Number of vowels: " + vowelCount); } } JavaScript let word = "programming"; let vowelCount = 0; for (let i = 0; i < word.length; i++) { let currentChar = word[i]; if ('aeiouAEIOU'.includes(currentChar)) { vowelCount++; } } console.log("Number of vowels:", vowelCount); OutputNumber of vowels: 3 Time Complexity: O(N), where N is the length of the input word.Auxiliary Space: O(1) Comment More infoAdvertise with us Next Article Program to count the number of vowels in a word S srinam Follow Improve Article Tags : DSA Similar Reads DSA Tutorial - Learn Data Structures and Algorithms DSA (Data Structures and Algorithms) is the study of organizing data efficiently using data structures like arrays, stacks, and trees, paired with step-by-step procedures (or algorithms) to solve problems effectively. Data structures manage how data is stored and accessed, while algorithms focus on 7 min read Non-linear Components In electrical circuits, Non-linear Components are electronic devices that need an external power source to operate actively. Non-Linear Components are those that are changed with respect to the voltage and current. Elements that do not follow ohm's law are called Non-linear Components. Non-linear Co 11 min read Quick Sort QuickSort is a sorting algorithm based on the Divide and Conquer that picks an element as a pivot and partitions the given array around the picked pivot by placing the pivot in its correct position in the sorted array. It works on the principle of divide and conquer, breaking down the problem into s 12 min read Merge Sort - Data Structure and Algorithms Tutorials Merge sort is a popular sorting algorithm known for its efficiency and stability. It follows the divide-and-conquer approach. It works by recursively dividing the input array into two halves, recursively sorting the two halves and finally merging them back together to obtain the sorted array. Merge 14 min read Data Structures Tutorial Data structures are the fundamental building blocks of computer programming. They define how data is organized, stored, and manipulated within a program. Understanding data structures is very important for developing efficient and effective algorithms. What is Data Structure?A data structure is a st 2 min read Bubble Sort Algorithm Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order. This algorithm is not suitable for large data sets as its average and worst-case time complexity are quite high.We sort the array using multiple passes. After the fir 8 min read Breadth First Search or BFS for a Graph Given a undirected graph represented by an adjacency list adj, where each adj[i] represents the list of vertices connected to vertex i. Perform a Breadth First Search (BFS) traversal starting from vertex 0, visiting vertices from left to right according to the adjacency list, and return a list conta 15+ min read Binary Search Algorithm - Iterative and Recursive Implementation Binary Search Algorithm is a searching algorithm used in a sorted array by repeatedly dividing the search interval in half. The idea of binary search is to use the information that the array is sorted and reduce the time complexity to O(log N). Binary Search AlgorithmConditions to apply Binary Searc 15 min read Insertion Sort Algorithm Insertion sort is a simple sorting algorithm that works by iteratively inserting each element of an unsorted list into its correct position in a sorted portion of the list. It is like sorting playing cards in your hands. You split the cards into two groups: the sorted cards and the unsorted cards. T 9 min read Array Data Structure Guide In this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous 4 min read Like