← All problemsSign in

1846. Maximum Element After Decreasing and Rearranging

LeetCodeArrayGreedySortingOpen on judge ↗

You are given an array of positive integers arr. Perform some operations (possibly none) on arr so that it satisfies these conditions: - The value of the first element in arr must be 1. - The absolute difference between any 2 adjacent elements must be less than or equal to 1. In other words, abs(arr[i] - arr[i - 1]) <= 1 for each i where 1 <= i < arr.length (0-indexed). abs(x) is the absolute va

HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start