René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/132-pattern","name":"#456 - 132 Pattern - LeetCode JavaScript Solutions","description":"Given an array of n integers nums, a 132 pattern is a subsequence of three integers nums[i], nums[j] and nums[k] such that i < j < k a...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {number[]} nums\n * @return {boolean}\n */\nvar find132pattern = function(nums) {\n  const stack = [];\n\n  for (let i = nums.length - 1, j = -Infinity; i >= 0; i--) {\n    while (nums[i] > stack[stack.length - 1]) {\n      j = stack.pop();\n    }\n    if (nums[i] < j) {\n      return true;\n    }\n    stack.push(nums[i]);\n  }\n\n  return false;\n};","keywords":"LeetCode 456, #456 - 132 Pattern, Medium, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}