René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/minimum-common-value","name":"#2540 - Minimum Common Value - LeetCode JavaScript Solutions","description":"Given two integer arrays nums1 and nums2, sorted in non-decreasing order, return the minimum integer common to both arrays. If there is no c...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {number[]} nums1\n * @param {number[]} nums2\n * @return {number}\n */\nvar getCommon = function(nums1, nums2) {\n  let i = 0;\n  let j = 0;\n\n  while (i < nums1.length && j < nums2.length) {\n    if (nums1[i] === nums2[j]) return nums1[i];\n    if (nums1[i] < nums2[j]) i++;\n    else j++;\n  }\n\n  return -1;\n};","keywords":"LeetCode 2540, #2540 - Minimum Common Value, Easy, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}