Maximize Consecutive Elements in an Array After Modification solution and explanation

def max_consecutive_elements(nums):
    nums.sort()
    max_count = 0
    count = 0
    
    for i in range(len(nums)):
        count = 1
        for j in range(i + 1, len(nums)):
            if nums[j] <= nums[i] + 1:
                count += 1
            else:
                break
        max_count = max(max_count, count)
    
    return max_count

# Example usage:
nums = [2,1,5,1,1]
print(max_consecutive_elements(nums))  # Output: 3

#include <vector>
#include <algorithm>
using namespace std;

int maxConsecutiveElements(vector<int>& nums) {
    sort(nums.begin(), nums.end());
    int max_count = 0;
    int count = 0;

    for (size_t i = 0; i < nums.size(); ++i) {
        count = 1;
        for (size_t j = i + 1; j < nums.size(); ++j) {
            if (nums[j] <= nums[i] + 1) {
                count++;
            } else {
                break;
            }
        }
        max_count = max(max_count, count);
    }

    return max_count;
}

// Example usage:
// vector<int> nums = {2,1,5,1,1};
// int result = maxConsecutiveElements(nums); // result is 3

import java.util.HashMap;
import java.util.Map;

public class MaxConsecutiveElements {
    public int maxConsecutiveElements(int[] nums) {
        Map<Integer, Integer> freq = new HashMap<>();
        for (int num : nums) {
            freq.put(num, freq.getOrDefault(num, 0) + 1);
        }

        int maxCount = 0;
        for (int num : freq.keySet()) {
            int currentCount = freq.get(num);
            if (freq.containsKey(num + 1)) {
                currentCount += freq.get(num + 1);
            }
            maxCount = Math.max(maxCount, currentCount);
        }

        return maxCount;
    }

    // Example usage:
    // public static void main(String[] args) {
    //     int[] nums = {2, 1, 5, 1, 1};
    //     MaxConsecutiveElements m = new MaxConsecutiveElements();
    //     System.out.println(m.maxConsecutiveElements(nums)); // Output: 3
    // }
}

using System;
using System.Collections.Generic;

public class Solution {
    public int MaxConsecutiveElements(int[] nums) {
        Dictionary<int, int> freq = new Dictionary<int, int>();
        foreach (int num in nums) {
            if (!freq.ContainsKey(num)) {
                freq[num] = 0;
            }
            freq[num]++;
        }

        int maxCount = 0;
        foreach (int num in freq.Keys) {
            int currentCount = freq[num];
            if (freq.ContainsKey(num + 1)) {
                currentCount += freq[num + 1];
            }
            maxCount = Math.Max(maxCount, currentCount);
        }

        return maxCount;
    }

    // Example usage:
    // public static void Main(string[] args) {
    //     int[] nums = {2, 1, 5, 1, 1};
    //     Solution sol = new Solution();
    //     Console.WriteLine(sol.MaxConsecutiveElements(nums)); // Output: 3
    // }
}