. Day 2 - Challenge 3 - Counting Vowels in string Skip to main content

Day 2 - Challenge 3 - Counting Vowels in string

Counting Vowels in JavaScript: A Simple Problem

Are you ready to dive into a classic programming challenge? In this blog post, we'll explore a simple yet fundamental problem: counting the number of vowels in a given string using JavaScript. Whether you're new to programming or looking to refresh your skills, this problem is a great exercise to enhance your understanding of string manipulation, loops, and arrays. So, let's get started!

The Problem

Our task is to write a JavaScript program that takes a string as input and returns the count of vowels present in that string. Vowels are the letters 'a', 'e', 'i', 'o', and 'u', regardless of their case. This means that both uppercase and lowercase vowels should be considered when counting.

The Approach

To solve this problem, we can break it down into a few simple steps:

  1. Convert to Lowercase: To ensure that we count both uppercase and lowercase vowels, we should first convert the entire input string to lowercase. This way, we can work with a standardized format.

  2. Define the Vowels: Create an array that contains the vowel characters ('a', 'e', 'i', 'o', 'u'). This array will help us check whether a given character is a vowel or not.

  3. Loop Through the String: Use a loop to iterate through each character of the lowercase string.

  4. Count Vowels: Inside the loop, check if the current character exists in the vowel array. If it does, increment a counter variable to keep track of the number of vowels encountered.

  5. Return the Count: After looping through the entire string, return the final count of vowels.

The JavaScript Code

Let's take a look at the JavaScript code that implements the solution:


function countVowels(str) {
  const lowerStr = str.toLowerCase();
  const vowels = ['a', 'e', 'i', 'o', 'u'];
  let vowelCount = 0;
  
  for (let char of lowerStr) {
    if (vowels.includes(char)) {
      vowelCount++;
    }
  }
  
  return vowelCount;
}

// Example usage
const inputString = "Hello, how are you?";
const numVowels = countVowels(inputString);
console.log(`Number of vowels: ${numVowels}`);


This program defines a function called countVowels that takes a string as input and returns the count of vowels in the string. It converts the input string to lowercase to handle both uppercase and lowercase vowels. Then, it loops through each character in the string and checks if the character is a vowel using the includes method on the vowels array. If the character is a vowel, the vowelCount is incremented. Finally, the function returns the total count of vowels.

Demo

Vowel Counter

Number of vowels: 0


Testing the Solution

You can test the program with various input strings, both simple and complex. Try inputting sentences, phrases, or even paragraphs to see how the program accurately counts the vowels each time.

Conclusion

Congratulations! You've successfully tackled the "Vowel Counter" problem using JavaScript. This exercise not only helped you practice string manipulation and array usage but also encouraged you to think logically and break down a problem into manageable steps. As you continue your programming journey, remember that even seemingly simple challenges like this one play a vital role in strengthening your coding skills.

Now write the program to count vowel in your language in comments.

Complete Other Challenges: 

  1. Day 1 Challenges
  2. Day 2 Challenge 1
  3. Day 2 Challenge 2
     

Comments

Popular posts from this blog

Day 7 - Challenge 2 - Valid Parentheses: A Guide to Checking Bracket Validity in JavaScript

Valid Parentheses: A Guide to Checking Bracket Validity in JavaScript Brackets are a fundamental part of programming languages and are used to group and structure code. In this blog post, we will explore the problem of determining whether a given string of brackets is valid or not using JavaScript. This problem is commonly referred to as the "Valid Parentheses" problem. Understanding the Problem: The problem statement provides a string that consists of three types of brackets: ( , ) , { , } , [ , and ] . The task is to determine whether the brackets in the string are arranged in a valid manner. For a string to be valid, each opening bracket must have a corresponding closing bracket of the same type, and they must be arranged in the correct order. For example, the strings "(){}[]" and "{[()]}" are valid, while "([)]" and "{{]}" are not. Approach: To solve this problem, we can use a stack data structure. The stack will help us keep tr...

Day 9 - Challenge 2 - Reverse Linked List

Reversing a Singly Linked List in JavaScript: An In-Place Approach Introduction:   Singly linked lists are fundamental data structures in computer science that consist of a sequence of nodes, each containing data and a reference to the next node in the list. Reversing a singly linked list is a classic problem that challenges programmers to manipulate pointers effectively to achieve the desired outcome. In this blog post, we'll explore the problem of reversing a singly linked list using an in-place approach and provide a step-by-step solution in JavaScript. Problem Statement:   Given the head of a singly linked list, our task is to reverse the list in-place and return its new head. In other words, we need to modify the pointers of the nodes in such a way that the direction of the linked list is reversed. Solution Approach:   To solve this problem, we will iterate through the linked list while maintaining three pointers: previous , current , and next . The previous pointer...

Day 8 - Challenge 3 - Unique Email Addresses

Solving the Problem of Counting Unique Email Addresses in JavaScript Introduction:  In today's digital age, email communication is an integral part of our lives. However, dealing with unique email addresses can sometimes be challenging due to variations that arise from period usage and the '+' character. In this blog post, we will explore how to tackle the problem of counting unique email addresses using JavaScript. Problem Statement: We are given a list of email addresses, and our task is to determine the number of unique email addresses. A unique email address consists of a local name and a domain name. The local name may contain periods ('.') and the character '+' which is ignored. Example:  Let's consider the following list of email addresses: "test.email+abc@gmail.com" "test.e.mail@gmail.com" "testemail@gmail.com" In this case, the number of unique email addresses is 1, as all three email addresses map to the same uniqu...