Last Updated : 23 Jul, 2025
Size of LinkedHashMap can be obtained in multiple ways like by using an inbuilt function and by iterating through the LinkedHashMap.
Example:
Input : List : [1 : "John", 2 : "Tom", 3 : "Tim"] Output: 3 Input : List : [1 : "John", 2 : "Tom"] Output: 2
Approach 1: using Iteration
Below is the implementation of the above approach:
Java
// Java Program to find the size of LinkedHashMap
import java.util.*;
public class LinkedHashMapSizeExample {
public static void main(String[] args)
{
// LinkedHashMap Initialization
LinkedHashMap<Integer, String> lhMapColors
= new LinkedHashMap<Integer, String>();
lhMapColors.put(1, "red");
lhMapColors.put(2, "white");
lhMapColors.put(3, "blue");
// Create of size variable and initialize with 0
int size = 0;
for (Map.Entry mapElement :
lhMapColors.entrySet()) {
size++;
}
System.out.println("Size of LinkedHashMap is "
+ size);
}
}
Size of LinkedHashMap is 3
Approach 2: Using size() Method
Syntax:
List.size()
Return Type:
Integer
Below is the implementation of the above approach:
Java
// Java Program to find the size of LinkedHashMap
import java.util.LinkedHashMap;
public class LinkedHashMapSizeExample {
public static void main(String[] args)
{
// Initialize LinkedHashMap
LinkedHashMap<Integer, String> lhMapColors
= new LinkedHashMap<Integer, String>();
// Add elements
lhMapColors.put(1, "red");
lhMapColors.put(2, "white");
lhMapColors.put(3, "blue");
// Create size variable and initialize
// it with size() method
int size = lhMapColors.size();
System.out.println("Size of LinkedHashMap is "
+ size);
}
}
Size of LinkedHashMap is 3
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4