René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/maximum-difference-between-increasing-elements","name":"#2016 - Maximum Difference Between Increasing Elements - LeetCode JavaScript Solutions","description":"Given a 0-indexed integer array nums of size n, find the maximum difference between nums[i] and nums[j] (i.e., nums[j] - nums[i]), such that...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {number[]} nums\n * @return {number}\n */\nvar maximumDifference = function(nums) {\n  let max = 0;\n\n  for (let i = 0, min = nums[0]; i < nums.length; i++) {\n    min = Math.min(min, nums[i]);\n    max = Math.max(max, nums[i] - min);\n  }\n\n  return max === 0 ? -1 : max;\n};","keywords":"LeetCode 2016, #2016 - Maximum Difference Between Increasing Elements, Easy, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}