I have the following code
let range = [1,2,3];
let multiples = [1,2,3,4,5,6,2,4,6,3,6];I want to find the first number in the multiples array that occurs range.lenght times (3);
I want to start with multiples[0] check how many times it occurs in multiples, if it occurs 3 times I want to return multiples[0], if it is less than 3 times, I want to check how many times multiples[1] occurs in the multiples array. If multiples[1] occurs 3 times I want to return multiples[1], else I move on to check multiples[2], etc. until I find a number that occurs 3 times. In the code above I should return 6.
I've looked at How to count the number of certain element in an array? and Idiomatically find the number of occurrences a given value has in an array and get closest number out of array among other research but have not figured it out yet.
I tried to simplify the question as much as possible. But if more info is needed it relates to this challenge on freeCodeCamp. Where I am at with my code is
function smallestCommons(arr) {
  let sortArr = arr.sort((a, b) => a - b);
  console.log(sortArr);
  let range = [];
  for (let i = sortArr[0]; i <= sortArr[1]; i++) {
    range.push(i);
  }
  console.log("range = " + range);
  let maxNum = range.reduce( (a, b) => a * b);
  console.log("maxNum = " + maxNum);
  let multiples = [];
  for (let i = 0; i < maxNum; i++) {
    let j = 0;
    do {
      multiples.push(j + range[i]);
      j += range[i];
    } while (j < maxNum);
    //j = 0;
  }
  for (let i = 0; i < multiples.length; i++) {
    let numberToFind = multiples[i];
   /*stuck here hence my question, maybe I shouldn't even start with a for loop*/ 
   //tried reduce, forEach, filter, while loop, do while loop 
  }
  console.log("multiples = " + multiples);
 }
console.log(smallestCommons([1,3]));
The logs are
1,3
range = 1,2,3
maxNum = 6
multiples = 1,2,3,4,5,6,2,4,6,3,6,NaN,NaN,NaN
 
     
    