. Day 8 - Challenge 3 - Unique Email Addresses Skip to main content

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 unique address: "testemail@gmail.com".

Approach and Solution: 

To solve this problem, we need to apply the following steps using JavaScript:

  1. Iterate through each email address in the list.
  2. For each email address, split it into the local name and domain name using the '@' symbol.
  3. Process the local name:
    • Remove all '.' characters from the local name.
    • Ignore all characters after the '+' character.
  4. Concatenate the modified local name with the domain name to form the unique email address.
  5. Use a Set data structure to keep track of unique email addresses.
  6. Count the number of elements in the Set, which will give us the final count of unique email addresses.

JavaScript Code Implementation:

function countUniqueEmails(emails) {
    const uniqueEmails = new Set();
    for (const email of emails) {
        const [local, domain] = email.split('@');
        const modifiedLocal = local.replace(/\./g, '').split('+')[0];
        const uniqueEmail = `${modifiedLocal}@${domain}`;
        uniqueEmails.add(uniqueEmail);
    }
    return uniqueEmails.size;
}
// Example usage
const emailList = [
    "test.email+abc@gmail.com",
    "test.e.mail@gmail.com",
    "testemail@gmail.com"
];
const uniqueCount = countUniqueEmails(emailList);
console.log("Number of unique email addresses:", uniqueCount); // Output: 1

Conclusion: 

In this blog post, we addressed the challenge of counting unique email addresses that arise from variations in the local name due to periods and the '+' character. By following a step-by-step approach and implementing the solution using JavaScript, we were able to accurately determine the number of unique email addresses in a given list. This solution showcases the power of JavaScript in solving real-world problems efficiently.

Now write the same program in your favorite language in comment section. 

Other Challenges:

  1. Day 6 Challenges 
  2. Day 7 Challenges
  3. Day 8 Challenges
Labels:

Comments

Post a Comment

Popular posts from this blog

Day 9 - Challenge 1 - Product of Array Except Self

Solving the "Product of Array Except Self" Problem in JavaScript Are you ready to dive into a common coding challenge that not only tests your programming skills but also sharpens your problem-solving mindset? If you're up for the challenge, let's tackle the "Product of Array Except Self" problem together using JavaScript. This problem requires us to return an array where each element at index i is the product of all the elements in the original array except the one at index i . Understanding the Problem:   Imagine you're given an array of integers, let's call it nums . Your task is to create a new array where the value at index i in this new array is the product of all the elements in nums , except the one at index i . In other words, you're calculating the product of all the elements to the left of nums[i] and the product of all the elements to the right of nums[i] , and then multiplying these two products to get the final value at index i ...
Post a Comment
Read more

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...
Post a Comment
Read more

Day 8 - Challenge 2 - Move Zeroes to the End

Moving Zeroes to the End: A JavaScript Solution Introduction:   When working with arrays, there are often times when we need to manipulate their elements to achieve a specific goal. One common problem is moving all zeroes to the end of an array while keeping the order of non-zero elements unchanged. In this blog post, we will explore an elegant solution to this problem using JavaScript. We'll discuss the problem statement, the approach we'll take, and provide a step-by-step guide to implementing the solution. The Problem:   Given an array of integers, the task is to move all zeroes to the end of the array while maintaining the relative order of the non-zero elements. This means that after rearranging the array, all the zeroes should be at the end, and the order of the non-zero elements should remain the same. The Approach:   To solve this problem, we can utilize a two-pointer approach. We'll maintain two pointers, one for iterating through the array and another for keepin...
Post a Comment
Read more