Coderbyte - Number Search - Code challenge - JavaScript Solution Source Code

#coderbyte #codechallenge #solution
Coderbyte - Number Search - Code challenge - JavaScript Solution Source Code
Source code with comments - JavaScript:

Thank you for watching!

[_RahulVerma-espr]

Hey great content
Can you share this code in c++…

[hanafa]

let letters = 0
let numbers = 0


for (let i = 0; i < str.length; i++) {
if (str[i] != ' ') {
if (isNaN(str[i])) {
letters++;
} else {
numbers += parseInt(str[i])
}
}
}

return Math.round(numbers / letters)

[juandavidblancovergara]

thank u, sr. this is other way solution:

function numberSearch(str: string): number|string{
const regex = /^[a-zA-Z0-9]+$/
const splitedString = str.split("");
let counterN = 0;
let counterS = 0;

for (let i = 0; i < splitedString.length; i++) {
const strI = splitedString[i];
if(regex.test(strI)) {
if(isNaN(Number(strI))) {
counterS++
} else {
counterN+=Number(strI)
}
}
}
if(counterS) return "it should be there at least 1 letter"
const res =
return res
}
9world 2, Nic8e D7ay!"))