Скачать или смотреть Leetcode Daily Challenge | Oct 18 2025 | Leetcode 3397

🎯 Maximize Distinct Elements | LeetCode Greedy Problem Explained

In this video, we dive deep into a greedy algorithm that finds the maximum number of distinct elements you can form when each element in an array can be moved within a given range [num - k, num + k].

💡 What you’ll learn:

The intuition behind choosing values smartly within a range

How sorting helps build the solution step-by-step

The greedy logic using Math.min() and Math.max()

A detailed dry run example to visualize the algorithm

Full Java implementation explained line by line

⚙️ Algorithm summary:
1️⃣ Sort the array
2️⃣ For each number, pick the smallest possible value greater than the last chosen one
3️⃣ Stay within [num - k, num + k] range
4️⃣ Count how many distinct values you can form

📈 Time Complexity: O(n log n)
🧠 Approach Used: Greedy

If you enjoy problem-solving and want to master greedy algorithms, this one’s a must-watch! 🚀

#LeetCode #GreedyAlgorithm #JavaProgramming #DSA #CodingInterview #MaxDistinctElements