freeCodeCamp/curriculum/challenges/english/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/where-do-i-belong.english.md

id, title, isRequired, challengeType, isHidden, forumTopicId

id	title	isRequired	challengeType	isHidden	forumTopicId
a24c1a4622e3c05097f71d67	Where do I Belong	true	5	false	16094

Description

Return the lowest index at which a value (second argument) should be inserted into an array (first argument) once it has been sorted. The returned value should be a number. For example, getIndexToIns([1,2,3,4], 1.5) should return 1 because it is greater than 1 (index 0), but less than 2 (index 1). Likewise, getIndexToIns([20,3,5], 19) should return 2 because once the array has been sorted it will look like [3,5,20] and 19 is less than 20 (index 2) and greater than 5 (index 1).

Instructions

Tests

tests:
  - text: <code>getIndexToIns([10, 20, 30, 40, 50], 35)</code> should return <code>3</code>.
    testString: assert(getIndexToIns([10, 20, 30, 40, 50], 35) === 3);
  - text: <code>getIndexToIns([10, 20, 30, 40, 50], 35)</code> should return a number.
    testString: assert(typeof(getIndexToIns([10, 20, 30, 40, 50], 35)) === "number");
  - text: <code>getIndexToIns([10, 20, 30, 40, 50], 30)</code> should return <code>2</code>.
    testString: assert(getIndexToIns([10, 20, 30, 40, 50], 30) === 2);
  - text: <code>getIndexToIns([10, 20, 30, 40, 50], 30)</code> should return a number.
    testString: assert(typeof(getIndexToIns([10, 20, 30, 40, 50], 30)) === "number");
  - text: <code>getIndexToIns([40, 60], 50)</code> should return <code>1</code>.
    testString: assert(getIndexToIns([40, 60], 50) === 1);
  - text: <code>getIndexToIns([40, 60], 50)</code> should return a number.
    testString: assert(typeof(getIndexToIns([40, 60], 50)) === "number");
  - text: <code>getIndexToIns([3, 10, 5], 3)</code> should return <code>0</code>.
    testString: assert(getIndexToIns([3, 10, 5], 3) === 0);
  - text: <code>getIndexToIns([3, 10, 5], 3)</code> should return a number.
    testString: assert(typeof(getIndexToIns([3, 10, 5], 3)) === "number");
  - text: <code>getIndexToIns([5, 3, 20, 3], 5)</code> should return <code>2</code>.
    testString: assert(getIndexToIns([5, 3, 20, 3], 5) === 2);
  - text: <code>getIndexToIns([5, 3, 20, 3], 5)</code> should return a number.
    testString: assert(typeof(getIndexToIns([5, 3, 20, 3], 5)) === "number");
  - text: <code>getIndexToIns([2, 20, 10], 19)</code> should return <code>2</code>.
    testString: assert(getIndexToIns([2, 20, 10], 19) === 2);
  - text: <code>getIndexToIns([2, 20, 10], 19)</code> should return a number.
    testString: assert(typeof(getIndexToIns([2, 20, 10], 19)) === "number");
  - text: <code>getIndexToIns([2, 5, 10], 15)</code> should return <code>3</code>.
    testString: assert(getIndexToIns([2, 5, 10], 15) === 3);
  - text: <code>getIndexToIns([2, 5, 10], 15)</code> should return a number.
    testString: assert(typeof(getIndexToIns([2, 5, 10], 15)) === "number");
  - text: <code>getIndexToIns([], 1)</code> should return <code>0</code>.
    testString: assert(getIndexToIns([], 1) === 0);
  - text: <code>getIndexToIns([], 1)</code> should return a number.
    testString: assert(typeof(getIndexToIns([], 1)) === "number");

Challenge Seed

function getIndexToIns(arr, num) {
  return num;
}

getIndexToIns([40, 60], 50);

Solution

function getIndexToIns(arr, num) {
  arr = arr.sort((a, b) => a - b);

  for (let i = 0; i < arr.length; i++) {
    if (arr[i] >= num) {
      return i;
    }
  }

  return arr.length;
}

getIndexToIns([40, 60], 50);