René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/first-missing-positive","name":"#41 - First Missing Positive - LeetCode JavaScript Solutions","description":"Given an unsorted integer array nums, return the smallest missing positive integer. You must implement an algorithm that runs in O(n) time a...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {number[]} nums\n * @return {number}\n */\nvar firstMissingPositive = function(nums) {\n  let i = 0;\n\n  while (i < nums.length) {\n    if (nums[i] > 0 && nums[i] <= nums.length && nums[nums[i] - 1] !== nums[i]) {\n      [nums[nums[i] - 1], nums[i]] = [nums[i], nums[nums[i] - 1]];\n    } else {\n      i++;\n    }\n  }\n\n  for (i = 0; i < nums.length; i++) {\n    if (nums[i] !== i + 1) {\n      return i + 1;\n    }\n  }\n\n  return i + 1;\n};","keywords":"LeetCode 41, #41 - First Missing Positive, Hard, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}