Challenge: Where to Insert

This challenge will test your skills in implementing arrow functions to write compact and efficient code in JavaScript.

Problem statement #

Given an unsorted array of numbers and another number, you are required to find the index at which the number would be placed if it were to be inserted in a sorted version of the array of numbers.

Note: The purpose of this exercise is to help you practice arrow functions.

The function getIndex has already been defined for you. However, for this exercise, re-write the declaration of getIndex using arrow functions and use them in its implementation as well.

Input #

An array and a number to be inserted

Output #

Lowest index at which the number should be inserted

Sample input #


Sample output #


Level up your interview prep. Join Educative to access 70+ hands-on prep courses.