Numbers smaller than the current number JavaScript

We are required to write a JavaScript function that takes in an array of Numbers as the only argument.

The function should return an array of Numbers that contains the number of elements smaller than each corresponding element in the original array.

For example −

If the input array is −

const arr = [3, 5 4, 1, 2];

Then the output should be −

const output = [2, 4, 3, 0, 1];

Example

const arr = [3, 5, 4, 1, 2];
const smallerNumbersThanCurrent = (arr = []) => {
   const res=[];
   for(let i = 0; i < arr.length; i++){
      let count = 0;
      let j = 0;
      while(j < arr.length){
         if(arr[i] > arr[j]){
            count++;
            j++;
         }else{
            j++;
         };
      };
      res.push(count);
   };
   return res;
};
console.log(smallerNumbersThanCurrent(arr));

Output

And the output in the console will be −

[2, 4, 3, 0, 1]

AmitDiwan

Updated on 25-Nov-2020 07:49:06

• Related Questions & Answers
• Counting How Many Numbers Are Smaller Than the Current Number in JavaScript
• Counting smaller numbers after corresponding numbers in JavaScript
• Largest rectangle sum smaller than num in JavaScript
• C++ Program to Find the Number of Ways to Write a Number as the Sum of Numbers Smaller than Itself
• Count of Binary Digit numbers smaller than N in C++
• An interesting solution to get all prime numbers smaller than n?
• Number of smaller and larger elements - JavaScript
• Getting equal or greater than number from the list of numbers in JavaScript
• Just smaller number with monotone digits in JavaScript
• Print all Jumping Numbers smaller than or equal to a given value in C++
• Count numbers (smaller than or equal to N) with given digit sum in C++
• Checking if all array values are smaller than a limit using JavaScript
• Find largest number smaller than N with same set of digits in C++
• Largest number smaller than or equal to N divisible by K in C++
• Number of elements smaller than root using preorder traversal of a BST in C++