45 day DSA challange day1

Day 1 for 45 days dsa challange 

March 15,2024

Leetcode and geeksforgeeks questions and solutions

begin with simple and straightforward problems to test my concepts.

problem 1 : https://leetcode.com/problems/number-of-common-factors/

solution:

var commonFactors = function(a, b) {

   

    let max=Math.max(a,b)

    let count=0

    for(let i=1;i<=max;i++){

        if(a%i==0 && b%i==0){

            count++

        }

    }

    return count

};

problem 2 : https://leetcode.com/problems/smallest-even-multiple/description/

solution:

var smallestEvenMultiple = function (n) {

let pr=n*2

let gs=findGCD(n,2)

let lcd=pr/gs

return lcd

   

};

function findGCD(a, b) {

    while (b !== 0) {

        var temp = b;

        b = a % b;

        a = temp;

    }

    return Math.abs(a);

}

problem 3 : https://www.geeksforgeeks.org/problems/lcm-and-gcd4516/1

solution:

class Solution{
    lcmAndGcd(a, b){
        //code here
        function lcm(a,b){
            let ans=(a*b)/gcd(a,b)
            return ans
            
        }
        function gcd(a,b){
            while(b!=0){
                let temp=b
                b=a%b
                a=temp
            }
            return Math.abs(a)
        }
        return [lcm(a,b),gcd(a,b)]
    }
}

problem 4 : https://www.geeksforgeeks.org/problems/count-squares3649/1

solution:

class Solution { //Function to count the number of perfect squares. countSquares(N) { //your code here let count=0 for(let i=1;i<Math.sqrt(N);i++){ let sqr=i*i if(sqr<N){ count++ } } return count } }

problem 5 : https://www.geeksforgeeks.org/problems/armstrong-numbers2727/1

solution:

class Solution{

    armstrongNumber(n){

        //code here

        let str=n.toString()

        let sum=0

        for(let i=0;i<str.length;i++){

            sum+= (Number(str[i]**3))

        }

        

        if(sum==n){

            return "Yes"

        }

        else {

            return "No"

        }

    }

}