Forem: Chinwendu Agbaetuo

Find the Greatest Common Divisor

Chinwendu Agbaetuo — Mon, 21 Oct 2024 15:30:09 +0000

Write a function that takes two numbers and returns their greatest common divisor (GCD).

Solution

function findGCD(number1, number2) {
  if(number2 === 0) {
    return number1;
  }

  return findGCD(number2, number1 % number2);
}

console.log(findGCD(-1, -5));
console.log(findGCD(19, 5));
console.log(findGCD(72, 81));
console.log(findGCD(14, 0));

Result

> -1
> 1
> 9
> 14

Character overlap with strings in JavaScript

Chinwendu Agbaetuo — Mon, 21 Oct 2024 15:09:25 +0000

Write a function that takes two strings and displays, without doubles, the characters that appear in either one of the strings.

Solution

function characterOverlap(array1, array2) {
  let occurrence = {};

  let str = array1.concat(array2);

  // find the count of each character
  Array.from(str).forEach((char) => {
    let currentCount = occurrence[char] || 0;
    occurrence[char] = currentCount + 1;
  });

  // return the keys which is the individual character and join.
  const result = Object.keys(occurrence);

  return result.join("");
}

console.log(characterOverlap("computer", "circuitemtop"));
console.log(characterOverlap("frontend", "development"));
console.log(characterOverlap("mivrog", "gormiv"));
console.log(characterOverlap("praxet", "xetpar"));
console.log(characterOverlap("stone", "tones"));
console.log(characterOverlap("rescue", "secure"));

Result

> computer
> frontedvlpm
> mivrog
> praxet
> stone
> rescu

Repeat the Character in a string based on its Alphabetical index

Chinwendu Agbaetuo — Mon, 21 Oct 2024 14:50:35 +0000

Write a function repeatAlpha that takes a string and displays it
repeating each alphabetical character as many times as its alphabetical index.

Solution

const range = (start, stop, step) =>
  Array.from(
    { length: Math.ceil((stop - start) / step) },
    (_, i) => start + i * step
  );

const upperAlpha = range("A".charCodeAt(0), "Z".charCodeAt(0) + 1, 1).map((x) =>
  String.fromCharCode(x)
);

const lowerAlpha = range("a".charCodeAt(0), "z".charCodeAt(0) + 1, 1).map((x) =>
  String.fromCharCode(x)
);

function getAlphaIndex(char) {
  if (char === char.toUpperCase()) {
    return upperAlpha.indexOf(char) + 1;
  }

  if (char === char.toLowerCase()) {
    return lowerAlpha.indexOf(char) + 1;
  }
}

function repeatAlpha(text) {
  let occurrence = [];

  Array.from(text).forEach((char) => {
    let count = getAlphaIndex(char);
    let result = Array(count).fill(char).join("");
    occurrence.push(result);
  });

  return occurrence.join("");
}

console.log(repeatAlpha("Becky"));
console.log(repeatAlpha("neNgi"));
console.log(repeatAlpha("ChInwendu"));
console.log(repeatAlpha("dindustack"));

Result

BBeeeeeccckkkkkkkkkkkyyyyyyyyyyyyyyyyyyyyyyyyy
nnnnnnnnnnnnnneeeeeNNNNNNNNNNNNNNgggggggiiiiiiiii
CCChhhhhhhhIIIIIIIIInnnnnnnnnnnnnnwwwwwwwwwwwwwwwwwwwwwwweeeeennnnnnnnnnnnnndddduuuuuuuuuuuuuuuuuuuuu
ddddiiiiiiiiinnnnnnnnnnnnnndddduuuuuuuuuuuuuuuuuuuuusssssssssssssssssssttttttttttttttttttttaccckkkkkkkkkkk

Repeat the Character in a string based on its Alphabetical index

Chinwendu Agbaetuo — Fri, 18 Oct 2024 05:44:03 +0000

Write a function repeatAlpha that takes a string and displays it
repeating each alphabetical character as many times as its alphabetical index.

Solution

const range = (start, stop, step) =>
  Array.from(
    { length: Math.ceil((stop - start) / step) },
    (_, i) => start + i * step
  );

const upperAlpha = range("A".charCodeAt(0), "Z".charCodeAt(0) + 1, 1).map((x) =>
  String.fromCharCode(x)
);

const lowerAlpha = range("a".charCodeAt(0), "z".charCodeAt(0) + 1, 1).map((x) =>
  String.fromCharCode(x)
);

function getAlphaIndex(char) {
  if (char === char.toUpperCase()) {
    return upperAlpha.indexOf(char) + 1;
  }

  if (char === char.toLowerCase()) {
    return lowerAlpha.indexOf(char) + 1;
  }
}

function repeatAlpha(text) {
  let occurrence = [];

  Array.from(text).forEach((char) => {
    let count = getAlphaIndex(char);
    let result = Array(count).fill(char).join("");
    occurrence.push(result);
  });

  return occurrence.join("");
}

console.log(repeatAlpha("Becky"));
console.log(repeatAlpha("neNgi"));
console.log(repeatAlpha("ChInwendu"));
console.log(repeatAlpha("dindustack"));

Result

BBeeeeeccckkkkkkkkkkkyyyyyyyyyyyyyyyyyyyyyyyyy
nnnnnnnnnnnnnneeeeeNNNNNNNNNNNNNNgggggggiiiiiiiii
CCChhhhhhhhIIIIIIIIInnnnnnnnnnnnnnwwwwwwwwwwwwwwwwwwwwwwweeeeennnnnnnnnnnnnndddduuuuuuuuuuuuuuuuuuuuu
ddddiiiiiiiiinnnnnnnnnnnnnndddduuuuuuuuuuuuuuuuuuuuusssssssssssssssssssttttttttttttttttttttaccckkkkkkkkkkk

Generate Number Ranges in JavaScript

Chinwendu Agbaetuo — Fri, 11 Oct 2024 19:36:31 +0000

Generate an array of integers and fill it with consecutive values that begin with the start number and end with the end number inclusive.

Solution

function range(start, end) {
  const rangeArray = Array.from(
    {length: Math.ceil(end - start + 1)}, (_, i) => start + i);

  return rangeArray;
}

console.log(range(10, 23));
console.log(range(5, 12));
console.log(range(89, 93));
console.log(range(42, 51));
console.log(range(73, 80));

> [10, 11, 12, 13, 14, 15,16, 17, 18, 19, 20, 21,22, 23]
> [5,  6,  7,  8, 9, 10, 11, 12]
> [89, 90, 91, 92, 93]
> [42, 43, 44, 45, 46, 47, 48, 49, 50, 51]
> [73, 74, 75, 76, 77, 78, 79, 80]

Add the sum of prime numbers for a given integer using JavaScript

Chinwendu Agbaetuo — Thu, 10 Oct 2024 15:38:49 +0000

Write a function that takes a positive integer as a parameter and displays the sum of all prime numbers less or equal to it.

Solution

// Define a function named addPrimeSum that takes a single parameter 'number'
function addPrimeSum(number) {
  // Initialize a variable 'result' to store the sum of prime numbers, starting from 0
  let result = 0;

  // Define an inner function named isPrime that takes a single parameter 'num'
  function isPrime(num) {
    // If 'num' is less than 2, it is not prime, so return nothing (undefined)
    if (num < 2) return;

    // Loop from 2 to half of 'num' to check for factors
    for (let i = 2; i <= num / 2; i++) {
      // If 'num' is divisible by 'i', it's not prime, so return nothing (undefined)
      if (num % i === 0) return;
    }
    // If no factors are found, return 'num' indicating it is a prime number
    return num;
  }

  // Loop while 'number' is greater than 1
  while (number > 1) {
    // Check if 'number' is prime using the isPrime function
    if (isPrime(number)) {
      // If it is prime, add it to 'result'
      result += number;
    }
    // Decrement 'number' by 1 to check the next lower number
    number--;
  }

  // Return the total sum of all prime numbers found
  return result;
}

console.log(addPrimeSum(5));
console.log(addPrimeSum(21));
console.log(addPrimeSum(100));
console.log(addPrimeSum(239));
console.log(addPrimeSum(956));

Solution

Convert camelToCase to snake_case in JavaScript

Chinwendu Agbaetuo — Wed, 09 Oct 2024 08:36:36 +0000

Write a function that takes a single string in camelCase format and converts it into a string in snake_case format.

Solution

// A function camelToCase that takes a string (text) as the parameter.
function camelToCase(text) {

  // Transform each uppercase letter (character) based on its position.
  function upperToUnderScoreLower(character, position) {

    // If the letter isn't the first character, add an underscore and convert it to lowercase.
    return (position > 0 && "_") + character.toLowerCase();
  }

  // Replace all uppercase letters in (text) by calling the upperToUnderScoreLower function.
  return text.replace(/[A-Z]/g, upperToUnderScoreLower);
}

console.log(camelToCase("camelToCase"));

Result

> camel_to_case

Find the maximum number in an array - JavaScript

Chinwendu Agbaetuo — Tue, 08 Oct 2024 12:17:46 +0000

Find the maximum number from an array of positive integers using JavaScript

Solution

//findMaxNumber.js

// 1st Method
function findMaxNumber(numbers) {
//Initializes result to track the maximum number, starting at 0.
  let result = 0;

  //Stores the length of the numbers array for use in the loop.
  const numbersLength = numbers.length;

  //Check if the array is not empty before processing it.
  if (numbersLength > 0) {

    //Loops through each number in the array.
    for (let i = 0; i < numbersLength; i++) {

      //Compare each number to the result to check if it's larger.
      if (numbers[i] > result) {

        //Updates result with the current number if it's the largest
        result = numbers[i];
      }
    }
    console.log(result);
    return result;
  }

  return result;
}

// 2nd Method
function findMaxNumber(numbers) {
  const maxNumber = Math.max(numbers);
  return maxNumber;
}

findMaxNumber([5, 33, 47, 103]);

Result

> 103

Search and replace letters of a string in JavaScript

Chinwendu Agbaetuo — Mon, 07 Oct 2024 09:43:29 +0000

Create a function that accepts three parameters:

A string where you want to replace a letter.
The letter you want to replace (the second argument).
The letter you want to use as a replacement (the third argument).

This function should replace all occurrences of the second letter with the third letter in the given string.

Solution

// searchAndReplace.js

function searchAndReplace(text, firstLetter, secondLetter) {
  const replacedString = text
    .split("")
    .map((item) => (item === firstLetter ? secondLetter : item))
    .join("");


  return replacedString;
}

console.log(searchAndReplace("Drastic measures made fast", "a", "o"));

Result


> Drostic meosures mode fost

Reverse the case of a string - Javascript

Chinwendu Agbaetuo — Fri, 04 Oct 2024 08:55:04 +0000

Write a function that takes a string and reverses the case of all its letters.

Solution

function reverseStringCase(text) {
  let reversedString = [];

  for (let i = 0; i < text.length; i++) {
    if (text[i] == text[i].toUpperCase()) {
      reversedString.push(text[i].toLowerCase());
    } else {
      reversedString.push(text[i].toUpperCase());
    }
  }

  console.log(reversedString.join(""));
  return reversedString.join("");
}

// Another solution for reversing string cases

function reverseStringCases(text) {
  const reversedString = text
    .split("")
    .map((item) =>
      item === item.toUpperCase() ? item.toLowerCase() : item.toUpperCase()
    )
    .join("");

  console.log(reversedString);
  return reversedString;
}

reverseStringCase(
  "L'âme nE se dÉvelopPe pAs sAnS ChAngEmenT, eT leS DoUtes Sont EsSentIels à la crOisSanCe."
);

reverseStringCases(
  "L'âme nE se dÉvelopPe pAs sAnS ChAngEmenT, eT leS DoUtes Sont EsSentIels à la crOisSanCe."
);

Result

l'ÂME Ne SE DéVELOPpE PaS SaNs cHaNGeMENt, Et LEs dOuTES sONT eSsENTiELS À LA CRoISsANcE.

l'ÂME Ne SE DéVELOPpE PaS SaNs cHaNGeMENt, Et LEs dOuTES sONT eSsENTiELS À LA CRoISsANcE.

Count the occurrence of a character in a string - Javascript

Chinwendu Agbaetuo — Wed, 10 Jul 2024 12:32:15 +0000

Solution

function countStringOccurrences(str) {
  let occurrence = {};

  Array.from(str).forEach(char => {
    let currentCount = occurrence[char] || 0;
    occurrence[char] = currentCount + 1;
  });

  console.log(occurrence);
  return occurrence; 
}

countStringOccurrences("hello");
countStringOccurrences("👍😉😉👍");

Result

Object { h: 1, e: 1, l: 2, o: 1 };
Object { 👍: 2, 😉: 2 }

Recreate Angular Logo with SVG

Chinwendu Agbaetuo — Wed, 03 Jul 2024 22:35:47 +0000

Introduction

Using path elements, the first thing to create is the outer shield. The logo shield is made of a lighter and darker portion, which creates an illusion of a fold. Let's create the shield.

<svg width="800" height="600">
   <path fill="#dd002e" d="M 0 50 L 100 0 L 200 50 L 190 185 L 100 235 L 10 185 Z"></path>
   <path fill="#c4002b" d="M 100 0 L 200 50 L 190 185 L 100 235 Z"></path>
</svg>

Explanation:

For the darker portion, there are seven instructions:
M 0 50
L 100 0
L 200 50
L 190 185
L 100 235
L 10 185
Z

The instructions work with coordinates, and M is the initiating origin, where the SVG starts from, L command is for lines that need to be drawn to a coordinate, and the Z command closes a path.

To draw letter A

// <svg width="800" height="600">
// <path fill="#dd002e" d="M 0 50 L 100 0 L 200 50 L 190 185 L 100 235 L 10 185 Z"></path>
// <path fill="#c4002b" d="M 100 0 L 200 50 L 190 185 L 100 235 Z"></path>
   <path fill="#fff" d="M 100 35 L 30 185 H 50 L 100 70 Z"></path>
   <path fill="#fff" d="M 100 35 L 170 185 L 150 185 L 100 70 Z"></path>
   <path fill="#fff" d="M 78 120 L 122 120 L 132 140 L 68 140 Z"></path>
// svg

Result

See the Pen
SVG Angular Logo by Chinwendu (@dindustack)
on CodePen.