Maximum Beauty Of An Array After Applying Operation
Sort array, apply sliding window technique to maximize subsequence length after applying operation any number of times.
2779. Maximum Beauty of an Array After Applying Operation Difficulty: Medium Topics: Array, Binary Search, Sliding Window, Sorting You are given a 0-indexed array nums and a non-negative integer k. In one operation, you can do the following: Choose an index i that hasn't been chosen before from the range [0, nums.length - 1]. Replace nums[i] with any integer from the range [nums[i] - k, nums[i] + k]. The beauty of the array is the length of the longest subsequence consisting of equal elements. Return the maximum possible beauty of the array nums after applying the operation any number of tim...