. Day 8 - Challenge 1 - Intersection of Two Arrays Skip to main content

Day 8 - Challenge 1 - Intersection of Two Arrays

Finding the Intersection of Two Arrays using JavaScript

Introduction 

Arrays are an essential data structure in programming, allowing us to store and manipulate collections of elements. In many scenarios, we need to find common elements between two arrays. This process is commonly referred to as finding the "intersection" of two arrays. In this blog post, we'll explore a simple and efficient JavaScript program to find the intersection of two arrays.

The Problem 

Given two arrays, our task is to find the distinct common elements between them. In other words, we want to identify the values that appear in both arrays without any duplicates.

Approach 

We'll use a hash set to keep track of elements from one array and then iterate through the second array to identify common elements.

Here's a step-by-step breakdown of our approach:

  1. Create an empty hash set.
  2. Iterate through the first array and add each element to the hash set.
  3. Create an empty result array to store the intersection.
  4. Iterate through the second array. If the element exists in the hash set, add it to the result array and remove it from the hash set to avoid duplicate intersections.
  5. Return the result array containing the distinct common elements.

JavaScript Program

function findIntersection(nums1, nums2) {
    const set = new Set();
    const intersection = [];
    // Add elements from the first array to the hash set
    for (const num of nums1) {
        set.add(num);
    }
    // Iterate through the second array
    for (const num of nums2) {
        if (set.has(num)) {
            intersection.push(num);
            set.delete(num); // Avoid duplicates
        }
    }
    return intersection;
}

// Example usage
const array1 = [1, 2, 2, 1];
const array2 = [2, 2];
const result = findIntersection(array1, array2);
console.log(result); // Output: [2]

Demo

Array Intersection Demo

Intersection Result:


Conclusion 

Finding the intersection of two arrays is a common task in programming, and a hash set provides an efficient way to achieve this. By using a hash set to store elements from one array and then checking for their presence in the second array, we can identify common elements while avoiding duplicates. The JavaScript program provided in this blog post demonstrates a straightforward solution to the problem.

This approach has a time complexity of O(n), where n is the total number of elements in both arrays, and a space complexity of O(min(m, n)), where m and n are the lengths of the two arrays, respectively. This efficient approach makes it suitable for handling arrays of varying sizes.

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

Other Challenges:

  1. Day 5 Challenges
  2. Day 6 Challenges 
  3. Day 7 Challenges

 

Labels:

Comments

Post a Comment

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