René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/rotate-function","name":"#396 - Rotate Function - LeetCode JavaScript Solutions","description":"You are given an integer array nums of length n. Assume arrk to be an array obtained by rotating nums by k positions clock-wise. We define t...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {number[]} nums\n * @return {number}\n */\nvar maxRotateFunction = function(nums) {\n  const sum = nums.reduce((a, b) => a + b, 0);\n  let current = nums.reduce((total, n, i) => total + i * n, 0);\n  let result = current;\n\n  for (let i = 1; i < nums.length; i++) {\n    current = current + sum - nums.length * nums[nums.length - i];\n    result = Math.max(result, current);\n  }\n\n  return result;\n};","keywords":"LeetCode 396, #396 - Rotate Function, Medium, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}