René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/maximum-employees-to-be-invited-to-a-meeting","name":"#2127 - Maximum Employees to Be Invited to a Meeting - LeetCode JavaScript Solutions","description":"A company is organizing a meeting and has a list of n employees, waiting to be invited. They have arranged for a large circular table, capab...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {number[]} fav\n * @return {number}\n */\nvar maximumInvitations = function(fav) {\n  const n = fav.length;\n  const graph = new Array(n).fill().map(() => []);\n  const seen = new Set();\n  let result = 0;\n\n  for (let i = 0; i < n; i++) {\n    graph[fav[i]].push(i);\n  }\n\n  for (let i = 0; i < n; i++) {\n    result += i < fav[i] || fav[fav[i]] != i ? 0 : dfs(i, fav[i]) + dfs(fav[i], i);\n  }\n\n  for (let i = 0; i < n; i++) {\n    let j = i;\n\n    if (!seen.has(i)) {\n      const m = new Map();\n\n      for (let k = 0; !seen.has(j); k++) {\n        seen.add(j);\n        m.set(j, k);\n        j = fav[j];\n      }\n\n      result = Math.max(result, m.size - m.get(j) || 0);\n    }\n  }\n\n  function dfs(i, j) {\n    return graph[i].reduce((max, n) => Math.max(max, n == j ? 0 : dfs(n, j)), 0) + 1;\n  };\n\n  return result;\n};","keywords":"LeetCode 2127, #2127 - Maximum Employees to Be Invited to a Meeting, Hard, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}