Day 2 - Problem Solving

const numbers = [1, 2, 3, 4, 3];
const text = "ABC";

// 1. Sum of array
let totalSum = 0;
for (let i = 0; i < numbers.length; i++) {
  totalSum += numbers[i];
}

// 2. Count even numbers
let evenCount = 0;
for (let i = 0; i < numbers.length; i++) {
  if (numbers[i] % 2 === 0) {
    evenCount++;
  }
}

// 3. Reverse string
const reversed = text.split("").reverse().join("");

// 4. Find largest number
let largest = numbers[0];
for (let i = 1; i < numbers.length; i++) {
  if (numbers[i] > largest) {
    largest = numbers[i];
  }
}

// 5. Remove duplicates
const unique = [...new Set(numbers)];

console.log(totalSum, evenCount, reversed, largest, unique);