10 JavaScript Problem Solving

Arafat Hossain

·

Follow

2 min read

·

Nov 5, 2020

--

Listen

Share

1.Finding the largest number of an array

var array = [3 , 6, 2, 56, 32, 5, 89, 32];
var largest= 0;for (i=0; i<=largest;i++){
    if (array>largest) {
        var largest=array[i];
    }
}console.log(largest);

2.Sum of all numbers in an array

const array = [1,2,3,4,5]
let total = 0;
total = array.reduce(total,element)=> total+elemenet ,0;
console.log(total)

3.Remove duplicate item from an array

var arr  = ["a","b", "a","c","b"]const newArr =arr.filter((value , index) => arr.indexOf(value)===index)
console.log(newArr)
//["a","b", "c"]

4.Calculate factorial of a number using for loop

var inputNumber = 4;
var total = 1;for (i = 0; i < inputNumber; i++){
    total = total * (inputNumber - i);
}console.log(inputNumber + '! = ' + total);
// 4! = 24

5.Calculate factorial of a number using for while loop

var factorial = 4var result = 1;
  while(factorial){
     if (factorial == 0 || factorial == 1){
        break;
     }
     // ?
     factorial = factorial - 1;
     console.log(result);
  }
// 24

6.Calculate factorial of a number using recursion

function factorial(x)  {    
 if (x === 0)  {    
 return 1;  }  
 return x * factorial(x-1);    
   }
 console.log(factorial(4));
// 24

7.Create fibonacci series using for loop

var i;
var fib = [0,1]; 
for (i = 2; i <= 10; i++) {  fib[i] = fib[i - 2] + fib[i - 1];
  console.log(fib[i]);
}

8.Check prime number or not

let i = 3
if(i%2===1){
console.log(i + "is a prime number")
}
else {
console.log(i + "is not a prime number")
}

9.Create fibonacci number using recursion

const fibonacci = (n) => {
if(n===0)
return 0;
}
if(n===1)
return 1;
}
else{
return fibonacci(n-1)+fibonacci(n-2);
}

10.Create fibonacci series using recursion

const fibonacci = (n) => {
if(n===0)
return 0;
}
if(n===1)
return 1;
}
else{
var fibo = fibo(n-1);
var nextElement = fibo[n-1] + fibo[n-2];
fibo.push(nextElement)
return fibo;
}