Available question text
You can reorder and decrease array elements so the first element is 1 and every adjacent difference is at most 1; return the largest possible value any element can have after such operations. The task is to decide how to lower and arrange values to maximize the sequence's final peak under the adjacent-difference constraint.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1846. Maximum Element After Decreasing and Rearranging
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source