René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/missing-element-in-sorted-array","name":"#1060 - Missing Element in Sorted Array - LeetCode JavaScript Solutions","description":"Given an integer array nums which is sorted in ascending order and all of its elements are unique and given also an integer k, return the kt...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {number[]} nums\n * @param {number} k\n * @return {number}\n */\nvar missingElement = function(nums, k) {\n  const n = nums.length;\n\n  if (k > getMissingCount(n - 1)) {\n    return nums[n - 1] + k - getMissingCount(n - 1);\n  }\n\n  let left = 0;\n  let right = n - 1;\n\n  while (left < right) {\n    const mid = Math.floor((left + right) / 2);\n\n    if (getMissingCount(mid) < k) {\n      left = mid + 1;\n    } else {\n      right = mid;\n    }\n  }\n\n  return nums[left - 1] + k - getMissingCount(left - 1);\n\n  function getMissingCount(index) {\n    return nums[index] - nums[0] - index;\n  }\n};","keywords":"LeetCode 1060, #1060 - Missing Element in Sorted Array, Medium, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}