1846-maximum-element-after-decreasing-and-rearranging.js

/**
 * 1846. Maximum Element After Decreasing and Rearranging
 * https://leetcode.com/problems/maximum-element-after-decreasing-and-rearranging/
 * Difficulty: Medium
 *
 * 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 value of x.
 *
 * There are 2 types of operations that you can perform any number of times:
 * - Decrease the value of any element of arr to a smaller positive integer.
 * - Rearrange the elements of arr to be in any order.
 *
 * Return the maximum possible value of an element in arr after performing the operations to
 * satisfy the conditions.
 */

/**
 * @param {number[]} arr
 * @return {number}
 */
var maximumElementAfterDecrementingAndRearranging = function(arr) {
  arr.sort((a, b) => a - b);
  let maxPossible = 1;

  for (let i = 1; i < arr.length; i++) {
    if (arr[i] > maxPossible) {
      maxPossible++;
    }
  }

  return maxPossible;
};