. Day 3 - Challenge 1 - Array Sum and Average Skip to main content

Day 3 - Challenge 1 - Array Sum and Average

Solving the Array Sum and Average Problem using JavaScript

Introduction

In the world of programming, problem-solving is an essential skill. It's like solving puzzles, but with lines of code instead of pieces. Today, we're going to dive into a classic programming problem - finding the sum and average of elements in an array. This problem might seem simple at first glance, but it's a great way to understand array manipulation and basic arithmetic operations in programming. So, let's roll up our sleeves and get coding!

Understanding the Problem

Imagine you have an array of numbers, for example: [5, 10, 15, 20, 25]. The problem is to calculate the sum of all these numbers and then find the average of those numbers. Sounds easy, right? Well, it certainly is, but breaking it down into steps and writing code to solve it is where the fun begins.

Step-by-Step Solution

Step 1: Initialize the Array

First, let's start by initializing our array of numbers. We'll use JavaScript for this example: 

const numbers = [5, 10, 15, 20, 25];

Step 2: Calculate the Sum

To calculate the sum of all the numbers in the array, we'll iterate through the array and add each number to a running total.

let sum = 0;
for (let i = 0; i < numbers.length; i++) {
  sum += numbers[i];
}

Step 3: Calculate the Average

Once we have the sum, calculating the average is straightforward. The average is the sum divided by the number of elements in the array.

const average = sum / numbers.length;

Putting it All Together

Here's the complete JavaScript code that solves the problem:

const numbers = [5, 10, 15, 20, 25];

let sum = 0;
for (let i = 0; i < numbers.length; i++) {
  sum += numbers[i];
}
const average = sum / numbers.length;

console.log("Sum:", sum);
console.log("Average:", average);

Demo

Array Sum and Average

Enter numbers (comma separated):
Numbers:
Sum:
Average:

Conclusion

In this blog post, we tackled a classic programming problem - finding the sum and average of elements in an array. Through this exercise, we learned how to iterate through arrays, perform arithmetic operations, and organize our code to solve a specific problem. This might seem like a simple task, but the concepts we've covered here are fundamental building blocks in the world of programming. As you continue your programming journey, remember that even the most complex problems are ultimately made up of smaller, solvable steps. Happy coding!

Now write the solution in your favorite language in comments.

Complete the old Challenges - 

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