. Day 5 - Challenge 1 - Two Sum Skip to main content

Day 5 - Challenge 1 - Two Sum

Solving the Two Sum Problem in JavaScript

The Two Sum problem is a classic coding challenge that involves finding two numbers in an array that add up to a given target sum. In this blog post, we'll walk through the problem-solving process step by step and implement a solution in JavaScript.

Problem Statement

Given an array of integers and a target sum, our task is to find two distinct numbers from the array that add up to the target sum. We need to return the indices of these two numbers in the array.

For example, if the input array is [2, 7, 11, 15] and the target sum is 9, the output should be [0, 1] because 2 + 7 = 9.

Approach

To solve this problem efficiently, we can use a hash map to store the numbers we have encountered so far along with their indices. As we iterate through the array, we can check if the difference between the current number and the target sum exists in the hash map. If it does, then we've found our solution.

Here's the step-by-step approach:

  1. Create an empty hash map to store numbers and their indices.
  2. Iterate through the array.
  3. For each number num at index i, calculate the complement as target - num.
  4. Check if the complement exists in the hash map.
    • If it does, return the indices [hashMap[complement], i].
    • If not, add the current number and its index to the hash map.

Implementation

Let's implement the solution in JavaScript:


function twoSum(nums, target) {
    const hashMap = {};

    for (let i = 0; i < nums.length; i++) {
        const num = nums[i];
        const complement = target - num;

        if (hashMap.hasOwnProperty(complement)) {
            return [hashMap[complement], i];
        }

        hashMap[num] = i;
    }

    return null; // If no solution is found
}

// Example usage
const nums = [2, 7, 11, 15];
const target = 9;
const result = twoSum(nums, target);
console.log(result); // Output: [0, 1]

Demo

Two Sum Problem Solver


Conclusion

The Two Sum problem is a common coding challenge that tests your problem-solving skills and knowledge of hash maps. By using a hash map to keep track of encountered numbers and their indices, we can efficiently solve this problem in linear time complexity.

Remember to analyze the time and space complexity of your solution. In this case, the time complexity is O(n), where n is the number of elements in the array, and the space complexity is O(n) as well due to the hash map.

I hope this blog post helps you understand how to approach and solve the Two Sum problem using JavaScript. Happy coding!

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

Other Challenges:

  1. Day 2 Challenges
  2. Day 3 Challenges
  3. Day 4 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