Codestin Search App

Practice › LeetCode › LeetCode (archived) › LeetCode 07xx ›

LeetCode 798: Smallest Rotation with Highest Score

Problem Restatement We are given an array nums . A rotation by k changes the array into: nums[k], nums[k + 1], ..., nums[n - 1], nums[0], ..., nums[k - 1] After rotating, an element earns one point if its value is less than or equal to its new index. We need to return the rotation index k that gives the highest score. If multiple rotations have the same highest score,...

Practice › LeetCode › LeetCode (archived) › LeetCode 03xx ›

LeetCode 370: Range Addition

Problem Restatement We are given an array of length length . Initially, every element is 0 . We are also given a list of update operations. Each update has this form: [startIndex, endIndex, inc] For each update, add inc to every index from startIndex to endIndex , inclusive. After all updates are applied, return the final array. The update range is inclusive, and the official example is length = 5...

Wiki › Algorithms › 02. Data Structures › 1. Core Data Structures and Operations › 1.1 Arrays and Dynamic Arrays ›

Difference Array

Difference Array A difference array stores how each element changes from the previous element. It lets you apply range additions in constant time and reconstruct the final array with a prefix sum. You use it when many range updates are applied before the final values are needed. Problem Given an array $A$ of length $n$, support range updates of the form: $$ A[i] = A[i] + x $$ for every...

#difference-array

LeetCode 798: Smallest Rotation with Highest Score

LeetCode 370: Range Addition

Difference Array