← All problemsSign in

3397. Maximum Number of Distinct Elements After Operations

LeetCodeArrayGreedySortingOpen on judge ↗

You are given an integer array nums and an integer k. You are allowed to perform the following operation on each element of the array at most once: - Add an integer in the range [-k, k] to the element. Return the maximum possible number of distinct elements in nums after performing the operations. Example 1: Input: nums = [1,2,2,3,3,4], k = 2 Output: 6 Explanation: nums changes to [-1, 0

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