Greatest number divisible by n within a bound in JavaScript


Problem

We are required to write a JavaScript function that takes in a number n and bound number b.

Our function should find the largest integer num, such that −

  • num is divisible by divisor

  • num is less than or equal to bound

  • num is greater than 0.

Example

Following is the code −

 Live Demo

const n = 14;
const b = 400;
const biggestDivisible = (n, b) => {
   let max = 0;
   for(let j = n; j <= b; j++){
      if(j % n == 0 && j > max){
         max = j;
      };
   }
   return max;
};
console.log(biggestDivisible(n, b));

Output

392

Updated on: 20-Apr-2021

270 Views

Kickstart Your Career

Get certified by completing the course

Get Started
Advertisements