Add solution #3397

Author: JoshCrozier

README.md

@@ -362,6 +362,7 @@
 2529|[Maximum Count of Positive Integer and Negative Integer](./2529-maximum-count-of-positive-integer-and-negative-integer.js)|Easy|
 2535|[Difference Between Element Sum and Digit Sum of an Array](./2535-difference-between-element-sum-and-digit-sum-of-an-array.js)|Easy|
 3396|[Minimum Number of Operations to Make Elements in Array Distinct](./3396-minimum-number-of-operations-to-make-elements-in-array-distinct.js)|Easy|
+3397|[Maximum Number of Distinct Elements After Operations](./3397-maximum-number-of-distinct-elements-after-operations.js)|Medium|
 3402|[Minimum Operations to Make Columns Strictly Increasing](./3402-minimum-operations-to-make-columns-strictly-increasing.js)|Easy|
 
 ## License

solutions/3397-maximum-number-of-distinct-elements-after-operations.js

@@ -0,0 +1,31 @@
+/**
+ * 3397. Maximum Number of Distinct Elements After Operations
+ * https://leetcode.com/problems/maximum-number-of-distinct-elements-after-operations/
+ * Difficulty: Medium
+ *
+ * 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.
+ */
+
+/**
+ * @param {number[]} nums
+ * @param {number} k
+ * @return {number}
+ */
+var maxDistinctElements = function(nums, k) {
+  nums.sort((a, b) => a - b);
+  let last = nums[0] - k;
+  let count = 1;
+
+  for (let i = 1; i < nums.length; i++) {
+    if (last + 1 > nums[i] + k) continue;
+    last = Math.max(last + 1, nums[i] - k);
+    count++;
+  }
+
+  return count;
+};