Display the Longest Name

// Java code for the above approach
import java.io.*;
import java.util.*;

class GFG 
{
  
    // Function to display longest names
    // contained in the array
    public static ArrayList<String> solve(String arr[],
                                          int N)
    {
      
        // Edge Case
        if (N == 0) {
            ArrayList<String> temp
                = new ArrayList<String>();
            return temp;
        }

        // Initialize Max
        int Max = arr[0].length();

        // Create an arraylist res
        ArrayList<String> res = new ArrayList<String>();

        // Insert first element in res
        res.add(arr[0]);

        // Traverse the array
        for (int i = 1; i < N; i++) {

            // If string with greater length
            // is found
            if (arr[i].length() > Max) {
                Max = arr[i].length();
                res.clear();
                res.add(arr[i]);
            }

            // If string with current max length
            else if (arr[i].length() == Max) {
                res.add(arr[i]);
            }
        }

        // Return the final answer
        return res;
    }

    // Driver Code
    public static void main(String[] args)
    {
        String arr[] = { "GeeksforGeeks", "FreeCodeCamp",
                         "StackOverFlow", "MyCodeSchool" };

        int N = arr.length;

        // Function call
        ArrayList<String> v = solve(arr, N);

        // Printing the answer
        for (String i : v) {
            System.out.print(i + " ");
        }
        System.out.println();
    }
}

// This code is contributed by Rohit Pradhan

// Java code to Display the Longest Name Using Hashing
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;

public class Main {
    // Function to display longest names
    public static List<String>
    findLongestNames(List<String> arr)
    {
        int maxLen = 0;
        Map<Integer, List<String> > lengthMap
            = new HashMap<>(); // Hash map to store names
                               // grouped by their lengths

        // Iterate through each name in the list
        for (String it : arr) {
            int len = it.length(); // Calculate the length
                                   // of the current name

            // Update the hash map with the current name
            // added to its corresponding length group
            List<String> namesList = lengthMap.getOrDefault(
                len, new ArrayList<>());
            namesList.add(it);
            lengthMap.put(len, namesList);

            // Update maxLen if the current length is
            // greater
            if (len > maxLen) {
                maxLen = len;
            }
        }

        // Retrieve all the names from the hash map for the
        // length maxLen
        return lengthMap.get(maxLen);
    }
    //   Driver Code
    public static void main(String[] args)
    {
        List<String> arr
            = List.of("GeeksforGeeks", "FreeCodeCamp",
                      "StackOverFlow", "MyCodeSchool");
        List<String> longestNames = findLongestNames(arr);
        for (String name : longestNames) {
            System.out.print(name + " ");
        }
        System.out.println();
    }
}
// This code is contributed by Veerendra_Singh_Rajpoot

import java.util.ArrayList;
import java.util.Collections;
import java.util.List;

public class LongestNamesFinder {
    public static void main(String[] args) {
        // Input array of names
        List<String> arr = List.of("GeeksforGeeks", "FreeCodeCamp", "StackOverFlow", "MyCodeSchool");

        // Call the function to find the longest names
        List<String> longestNames = findLongestNames(arr);

        // Print the longest names
        System.out.print("Longest Names: ");
        for (String name : longestNames) {
            System.out.print(name + " ");
        }
        System.out.println();
    }

    private static List<String> findLongestNames(List<String> arr) {
        // Create a copy of the input list to avoid modifying the original
        List<String> sortedArr = new ArrayList<>(arr);

        // Sort the list in descending order of length
        Collections.sort(sortedArr, (a, b) -> Integer.compare(b.length(), a.length()));

        // Find the length of the first (longest) name
        int maxLength = sortedArr.get(0).length();

        // Initialize a list to store the longest names
        List<String> longestNames = new ArrayList<>();

        // Iterate through the sorted list and add names with the same length as the first name
        for (String name : sortedArr) {
            if (name.length() == maxLength) {
                longestNames.add(name);
            } else {
                break; // Names are sorted by length, so we can stop when a shorter name is encountered
            }
        }

        return longestNames;
    }
}
//this code is contributed by utkarsh