René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/maximum-or","name":"#2680 - Maximum OR - LeetCode JavaScript Solutions","description":"You are given a 0-indexed integer array nums of length n and an integer k. In an operation, you can choose an element and multiply it by 2. ...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {number[]} nums\n * @param {number} k\n * @return {number}\n */\nvar maximumOr = function(nums, k) {\n  const n = nums.length;\n  const prefixOr = new Array(n + 1).fill(0n);\n  const suffixOr = new Array(n + 1).fill(0n);\n\n  for (let i = 0; i < n; i++) {\n    prefixOr[i + 1] = prefixOr[i] | BigInt(nums[i]);\n  }\n\n  for (let i = n - 1; i >= 0; i--) {\n    suffixOr[i] = suffixOr[i + 1] | BigInt(nums[i]);\n  }\n\n  let maxOr = 0n;\n  for (let i = 0; i < n; i++) {\n    maxOr = maxOr > (prefixOr[i] | (BigInt(nums[i]) << BigInt(k)) | suffixOr[i + 1])\n      ? maxOr\n      : (prefixOr[i] | (BigInt(nums[i]) << BigInt(k)) | suffixOr[i + 1]);\n  }\n\n  return Number(maxOr);\n};","keywords":"LeetCode 2680, #2680 - Maximum OR, Medium, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}