. Day 1- Challenge 2 - Problem: Sum of Even Numbers Skip to main content

Day 1- Challenge 2 - Problem: Sum of Even Numbers

Write a program that calculates the sum of all even numbers between 1 and a given positive integer n.

In the world of programming, problem-solving is a crucial skill. It helps developers hone their logical thinking and coding abilities. One interesting problem that can be tackled using JavaScript is finding the sum of even numbers. In this blog post, we'll dive into the problem, discuss the approach to solving it, and provide a JavaScript program that calculates the sum of even numbers.

Problem Statement: Given a range of numbers, we want to find the sum of all even numbers within that range, inclusive.

Approach: To solve this problem, we need to follow a few steps:

  1. Define a function that takes the range of numbers as input.
  2. Initialize a variable to store the sum of even numbers.
  3. Loop through each number in the range.
  4. Check if the current number is even.
  5. If the number is even, add it to the sum.
  6. Continue the loop until all numbers in the range are processed.
  7. Return the final sum.

 


function sumOfEvenNumbers(start, end) {
  let sum = 0;

  for (let i = start; i <= end; i++) {
    if (i % 2 === 0) {
      sum += i;
    }
  }

  return sum;
}

// Example usage
const startRange = 1;
const endRange = 10;
const result = sumOfEvenNumbers(startRange, endRange);
console.log(`The sum of even numbers between ${startRange} and ${endRange} is: ${result}`);

Explanation:

  • The sumOfEvenNumbers function takes two arguments: start and end, which define the range of numbers to consider.
  • The for loop iterates through each number from start to end.
  • The conditional if (i % 2 === 0) checks if the current number is even.
  • If the number is even, it's added to the sum variable.
  • Finally, the function returns the accumulated sum of even numbers.

Conclusion: Solving the sum of even numbers problem is a great exercise to practice fundamental programming concepts. By writing a JavaScript program that calculates the sum of even numbers within a given range, we've explored a simple yet effective approach to tackle this problem. This example demonstrates the power of logical thinking and coding skills in solving real-world challenges.

Sum of Even Numbers Calculator



Now write the same program in your programming language in comments.

Comments

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 ...

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 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...