Basic Problems Solving in JavaScript

//feet to inch converter problem
// so we know that 1 feet  = 12inch

//solutions
function feetToInch(feet){
    const inch = 12;
    const totalInch = feet*inch;

    return totalInch;

}

const calFeetToInch = feetToInch(6);
console.log(calFeetToInch);

//centimeter to meter converter problem

//we know 100cm = 1m

//solution

function centimeterToMeter(cm){
    const divider = 100;
    const meter =  cm/divider;

    return meter;
}

const calCmToMeter = centimeterToMeter(200);
console.log(calCmToMeter);


//problem is to get total amount of papers for book quantities

//for book 1 reserved 100 papers
//for book 2 reserved 200 papers
//for book 3 reserved 300 papers
//add quantiity for each book through function and calculate total numbers of papers


// solution

function paperRequirements(bookOneQt,bookTwoQt,bookThreeQt){
    const bookOneReservedPaper =100;
    const bookTwoReservedPaper =200;
    const bookThreeReservedPaper =300;

    const totalNumberOfPapers = (bookOneReservedPaper*bookOneQt)+(bookTwoReservedPaper*bookTwoQt)+(bookThreeReservedPaper*bookThreeQt);


    return totalNumberOfPapers;

}

const numberOfPapers = paperRequirements(5,6,8);

console.log('Number of papaers requrired: ',numberOfPapers);


//find your best friend / find the biggest name from array

//solution
const friends = ['Ajmal','Shahin','Javed','Rajib Islam','Miraz','Soumick Chattergee'];

function bestFriend(arr){
    let biggestName =  arr[0];

    for (var i =0; i<arr.length;i++){
        const name = arr[i];
        if(name.length > biggestName.length){
            biggestName =  name;
        }
    }

    return biggestName;
}

const myBestFriend = bestFriend(friends);

console.log(myBestFriend);

// extract only the positive numbers from the array
// break when it finds a negative number

//soultion

function onlyPositive(arr){
    const positiveNumbers = [];
    for(var i = 0;i<arr.length;i++){

        const number =  arr[i];

        if(number < 0){
            break;
        }else{
            positiveNumbers.push(number);
        }

    }
    return positiveNumbers;
}

const myNumbers =  [5,6,8,9,15,16,-18,20,25];

console.log('positive numbers ',onlyPositive(myNumbers));



// write a fibonacci programme
// fibonacci calculation always depends on previous two values
// n = n[i-1]+n[i-2]

function fib(numbers){

    //initial value
    let number = 0;

    for (var i =2; i<25; i++){

        number =  numbers[i-1]+numbers[i-2];

        numbers.push(number);

    }

    return numbers;

}

const fibNumbers =  fib([0,1]);

console.log(fibNumbers);