Java Program to Sort LinkedHashMap By Values

The LinkedHashMap is just like HashMap with an additional feature of maintaining an order of elements inserted into it. HashMap provided the advantage of quick insertion, search, and deletion, but it never maintained the track and order of insertion which the LinkedHashMap provides where the elements can be accessed in their insertion order. 

Hence LinkedHashMap Is the child class of HashMap. Now, in LinkedHashMap insertion order has to be maintained, so convert the LinkedHashMap into a list and after that print the list in which values are in sorted order.

Illustration:

Input : LinkedHashMap = {{“for”, 2}, {“Geek”, 3}, {“Geeks”, 1}}

Output:  

Key -> Geeks : value -> 1

Key -> for : value -> 2

Key -> Geek : value ->3 

Procedure:

1. Create an object of LinkedHashMap Class where the object is declared of type Integer and String.
2. Add elements to the above object created of the map using the put() method. Elements here are key-value pairs.
3. Retrieve above all entries from the map and convert them to a list using entrySet() method.
4. Sort the value of the list using the custom comparator.
5. Now use the Collections class sort method inside which we are using a custom comparator to compare the value of a map.
6. Print the above list object using for each loop.

Implementation:

Example 

Key -> Geeks: Value ->1
Key -> for: Value ->2
Key -> Geek: Value ->3