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

AmitDiwan

Published on 20-Apr-2021 09:49:40

• Related Questions & Answers
• Generating a random number that is divisible by n in JavaScript
• Greatest Sum Divisible by Three in C++
• Finding the count of numbers divisible by a number within a range using JavaScript
• Smallest number that is divisible by first n numbers in JavaScript
• Sum which is divisible by n in JavaScript
• Smallest possible number divisible by all numbers from 1 to n in JavaScript
• Count n digit numbers divisible by given number in C++
• Greatest digit of a number in JavaScript
• Find N digits number which is divisible by D in C++
• Largest N digit number divisible by given three numbers in C++
• Finding greatest digit by recursion - JavaScript
• Finding a pair that is divisible by some number in JavaScript
• Find the number closest to n and divisible by m in C++
• Greatest number in a dynamically typed array in JavaScript
• Finding a greatest number in a nested array in JavaScript