René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/array-nesting","name":"#565 - Array Nesting - LeetCode JavaScript Solutions","description":"A zero-indexed array A of length N contains all integers from 0 to N-1. Find and return the longest length of set S, where S[i] = {A[i], A[A...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {number[]} nums\n * @return {number}\n */\nvar arrayNesting = function(nums) {\n  const history = new Set();\n  let max = 0;\n  for (let i = 0; i < nums.length; i++) {\n    let count = 0;\n    let j = i;\n    while (!history.has(nums[j])) {\n      j = nums[j];\n      history.add(j);\n      count++;\n    }\n    max = Math.max(max, count);\n  }\n  return max;\n};","keywords":"LeetCode 565, #565 - Array Nesting, Medium, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}