{"id":2991,"date":"2026-10-31T15:47:36","date_gmt":"2026-10-31T15:47:36","guid":{"rendered":"https:\/\/codeinsightacademy.com\/blog\/?p=2991"},"modified":"2026-10-31T15:47:36","modified_gmt":"2026-10-31T15:47:36","slug":"collections-framework","status":"publish","type":"post","link":"https:\/\/codeinsightacademy.com\/blog\/java\/collections-framework\/","title":{"rendered":"Collections Framework"},"content":{"rendered":"\n

The Java Collections Framework (JCF) is an important part of Java programming. It provides a set of interfaces and classes that help developers store, manage, search, sort, and manipulate groups of objects efficiently.<\/p>\n\n\n\n

Instead of working with fixed-size arrays, we can use collections that provide dynamic storage and various data management capabilities.<\/p>\n\n\n\n

In this tutorial, we will understand six important Java collections with real-world examples.<\/p>\n\n\n\n

1. ArrayList \u2013 Store Duplicate Elements with Index-Based Access<\/h2>\n\n\n\n

What is ArrayList?<\/h3>\n\n\n\n

ArrayList is a resizable array implementation of the List interface.<\/p>\n\n\n\n

It allows duplicate elements and maintains insertion order. We can access and update elements using their index.<\/p>\n\n\n\n

Real-world example: Shopping Cart<\/strong><\/p>\n\n\n\n

Imagine an e-commerce application where a customer adds products to a shopping cart. A customer can add the same product multiple times.<\/p>\n\n\n\n

Java Example<\/h3>\n\n\n\n
import java.util.*;\n\npublic class Main {\n    public static void main(String[] args) {\n\n        ArrayList<String> cart = new ArrayList<>();\n\n        cart.add(\"Laptop\");\n        cart.add(\"Mobile\");\n        cart.add(\"Laptop\");\n        cart.add(\"Keyboard\");\n\n        \/\/ Display all products\n        System.out.println(cart);\n\n        \/\/ Access using index\n        System.out.println(cart.get(0));\n\n        \/\/ Update product\n        cart.set(1, \"iPhone\");\n\n        \/\/ Remove product using index\n        cart.remove(2);\n\n        System.out.println(cart);\n    }\n}<\/code><\/pre>\n\n\n\n
Output:<\/strong><\/p>\n\n\n\n
[Laptop, Mobile, Laptop, Keyboard]\nLaptop\n[Laptop, iPhone, Keyboard]<\/code><\/pre>\n\n\n\n
Important Features:<\/strong><\/p>\n\n\n\n
  • Allows duplicate elements.<\/li>
  • Maintains insertion order.<\/li>
  • Supports index-based access.<\/li>
  • Dynamic in size.<\/li>
  • Fast random access by index.<\/li><\/ul>\n\n\n\n
    When should we use ArrayList?<\/strong><\/p>\n\n\n\n
    Use ArrayList when you need to store multiple elements, allow duplicates, and access elements using their index.<\/p>\n\n\n\n
    2. HashSet \u2013 Store Unique Elements<\/h2>\n\n\n\n
    What is HashSet?<\/h3>\n\n\n\n
    HashSet is an implementation of the Set interface. It stores unique elements and does not allow duplicates.<\/p>\n\n\n\n
    It does not guarantee insertion order.<\/p>\n\n\n\n
    Real-world example: Unique Email Registrations<\/strong><\/p>\n\n\n\n
    Imagine a website where users register using their email addresses. We don’t want duplicate email addresses in our collection.<\/p>\n\n\n\n
    Java Example<\/h3>\n\n\n\n
    import java.util.*;\n\npublic class Main {\n    public static void main(String[] args) {\n\n        HashSet<String> emails = new HashSet<>();\n\n        emails.add(\"amit@gmail.com\");\n        emails.add(\"rahul@gmail.com\");\n        emails.add(\"amit@gmail.com\");\n        emails.add(\"priya@gmail.com\");\n\n        \/\/ Display emails\n        System.out.println(emails);\n\n        \/\/ Check whether email exists\n        System.out.println(\n            emails.contains(\"amit@gmail.com\")\n        );\n    }\n}<\/code><\/pre>\n\n\n\n
    Possible Output:<\/strong><\/p>\n\n\n\n
    [rahul@gmail.com, amit@gmail.com, priya@gmail.com]\ntrue<\/code><\/pre>\n\n\n\n
    Important Features:<\/strong><\/p>\n\n\n\n
    • Does not allow duplicate elements.<\/li>
    • Does not guarantee insertion order.<\/li>
    • Does not support index-based access.<\/li>
    • Uses hashing internally.<\/li>
    • Allows one null element.<\/li><\/ul>\n\n\n\n
      When should we use HashSet?<\/strong><\/p>\n\n\n\n
      Use HashSet when you want to maintain a collection of unique elements, such as email addresses, employee IDs, or product categories.<\/p>\n\n\n\n
      3. HashMap \u2013 Store Data in Key-Value Pairs<\/h2>\n\n\n\n
      What is HashMap?<\/h3>\n\n\n\n
      HashMap is an implementation of the Map interface. It stores data in key-value pairs.<\/p>\n\n\n\n
      Each key must be unique, but multiple keys can have the same value.<\/p>\n\n\n\n
      Real-world example: Employee Database<\/strong><\/p>\n\n\n\n
      Imagine an application where each employee has a unique employee ID and an employee name.<\/p>\n\n\n\n
      We can use the employee ID as the key and the employee name as the value.<\/p>\n\n\n\n
      Java Example<\/h3>\n\n\n\n
      import java.util.*;\n\npublic class Main {\n    public static void main(String[] args) {\n\n        HashMap<Integer, String> employees =\n            new HashMap<>();\n\n        employees.put(101, \"Amit\");\n        employees.put(102, \"Rahul\");\n        employees.put(103, \"Priya\");\n\n        \/\/ Get employee using ID\n        System.out.println(employees.get(102));\n\n        \/\/ Add new employee\n        employees.put(104, \"Neha\");\n\n        \/\/ Update employee\n        employees.put(102, \"Rahul Sharma\");\n\n        \/\/ Display all employees\n        System.out.println(employees);\n    }\n}<\/code><\/pre>\n\n\n\n
      Output:<\/strong><\/p>\n\n\n\n
      Rahul\n{101=Amit, 102=Rahul Sharma, 103=Priya, 104=Neha}<\/code><\/pre>\n\n\n\n
      Important Features:<\/strong><\/p>\n\n\n\n
      • Stores data in key-value pairs.<\/li>
      • Keys must be unique.<\/li>
      • Values can be duplicated.<\/li>
      • Does not guarantee insertion order.<\/li>
      • Allows one null key and multiple null values.<\/li><\/ul>\n\n\n\n
        When should we use HashMap?<\/strong><\/p>\n\n\n\n
        Use HashMap when you want to retrieve information using a unique key, such as employee ID, product ID, customer ID, or username.<\/p>\n\n\n\n
        4. TreeMap \u2013 Store Key-Value Pairs in Sorted Order<\/h2>\n\n\n\n
        What is TreeMap?<\/h3>\n\n\n\n
        TreeMap is an implementation of the NavigableMap interface. It stores key-value pairs and automatically sorts entries based on their keys.<\/p>\n\n\n\n
        By default, keys are sorted in ascending natural order.<\/p>\n\n\n\n
        Real-world example: Student Records<\/strong><\/p>\n\n\n\n
        Imagine a college application where student records should be displayed in ascending order of roll numbers.<\/p>\n\n\n\n
        Java Example<\/h3>\n\n\n\n
        import java.util.*;\n\npublic class Main {\n    public static void main(String[] args) {\n\n        TreeMap<Integer, String> students =\n            new TreeMap<>();\n\n        students.put(105, \"Amit\");\n        students.put(102, \"Rahul\");\n        students.put(104, \"Priya\");\n        students.put(101, \"Neha\");\n\n        \/\/ Display sorted student records\n        System.out.println(students);\n    }\n}<\/code><\/pre>\n\n\n\n
        Output:<\/strong><\/p>\n\n\n\n
        {101=Neha, 102=Rahul, 104=Priya, 105=Amit}<\/code><\/pre>\n\n\n\n
        Important Features:<\/strong><\/p>\n\n\n\n
        • Stores key-value pairs.<\/li>
        • Automatically sorts keys.<\/li>
        • Keys must be unique.<\/li>
        • Does not allow null keys with natural ordering.<\/li>
        • Supports operations such as firstKey(), lastKey(), and higherKey().<\/li><\/ul>\n\n\n\n
          When should we use TreeMap?<\/strong><\/p>\n\n\n\n
          Use TreeMap when you need key-value storage and want the keys to remain sorted automatically.<\/p>\n\n\n\n
          5. Queue \u2013 Process Elements Using FIFO<\/h2>\n\n\n\n
          What is Queue?<\/h3>\n\n\n\n
          Queue is an interface in Java that follows the FIFO (First In, First Out) principle.<\/p>\n\n\n\n
          The element inserted first is generally the first element to be removed.<\/p>\n\n\n\n
          Real-world example: Bank Customer Queue<\/strong><\/p>\n\n\n\n
          Imagine customers waiting at a bank counter. The first customer who enters the queue gets served first.<\/p>\n\n\n\n
          Java Example<\/h3>\n\n\n\n
          import java.util.*;\n\npublic class Main {\n    public static void main(String[] args) {\n\n        Queue<String> customers =\n            new LinkedList<>();\n\n        customers.add(\"Amit\");\n        customers.add(\"Rahul\");\n        customers.add(\"Priya\");\n\n        \/\/ Display queue\n        System.out.println(customers);\n\n        \/\/ Serve first customer\n        System.out.println(\n            \"Serving: \" + customers.poll()\n        );\n\n        \/\/ Display remaining customers\n        System.out.println(customers);\n    }\n}<\/code><\/pre>\n\n\n\n
          Output:<\/strong><\/p>\n\n\n\n
          [Amit, Rahul, Priya]\nServing: Amit\n[Rahul, Priya]<\/code><\/pre>\n\n\n\n
          Important Queue Methods:<\/strong><\/p>\n\n\n\n
          Method<\/th>Description<\/th><\/tr>
          add()<\/td>Inserts an element<\/td><\/tr>
          offer()<\/td>Inserts an element<\/td><\/tr>
          poll()<\/td>Removes and returns the head<\/td><\/tr>
          peek()<\/td>Returns the head without removing it<\/td><\/tr>
          remove()<\/td>Removes the head or throws an exception if empty<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n
          Important Features:<\/strong><\/p>\n\n\n\n
          • Follows FIFO in a normal FIFO queue.<\/li>
          • Useful for task processing.<\/li>
          • Supports different implementations such as LinkedList and PriorityQueue.<\/li><\/ul>\n\n\n\n
            When should we use Queue?<\/strong><\/p>\n\n\n\n
            Use Queue when tasks or requests need to be processed in arrival order, such as ticket booking, printer jobs, and customer support requests.<\/p>\n\n\n\n
            6. ConcurrentHashMap \u2013 Thread-Safe Key-Value Storage<\/h2>\n\n\n\n
            What is ConcurrentHashMap?<\/h3>\n\n\n\n
            ConcurrentHashMap is a thread-safe implementation of the ConcurrentMap interface.<\/p>\n\n\n\n
            It is designed for applications where multiple threads need to access and modify a shared key-value map concurrently.<\/p>\n\n\n\n
            Real-world example: Multiple Users Updating Login Counters<\/strong><\/p>\n\n\n\n
            Imagine an application where multiple threads update the login count of the same employee.<\/p>\n\n\n\n
            Using a normal HashMap without synchronization can cause concurrency problems.<\/p>\n\n\n\n
            ConcurrentHashMap provides thread-safe operations for this type of scenario.<\/p>\n\n\n\n
            Java Example<\/h3>\n\n\n\n
            import java.util.concurrent.*;\n\npublic class Main {\n\n    public static void main(String[] args) {\n\n        ConcurrentHashMap<Integer, Integer> loginCount =\n            new ConcurrentHashMap<>();\n\n        Runnable task = () -> {\n\n            for (int i = 0; i < 1000; i++) {\n\n                loginCount.merge(\n                    101,\n                    1,\n                    Integer::sum\n                );\n            }\n        };\n\n        Thread t1 = new Thread(task);\n        Thread t2 = new Thread(task);\n\n        t1.start();\n        t2.start();\n\n        try {\n            t1.join();\n            t2.join();\n        } catch (InterruptedException e) {\n            Thread.currentThread().interrupt();\n        }\n\n        System.out.println(loginCount);\n    }\n}<\/code><\/pre>\n\n\n\n
            Output:<\/strong><\/p>\n\n\n\n
            {101=2000}<\/code><\/pre>\n\n\n\n
            Important Features:<\/strong><\/p>\n\n\n\n
            • Supports concurrent access by multiple threads.<\/li>
            • Provides thread-safe operations.<\/li>
            • Does not allow null keys or null values.<\/li>
            • Provides better concurrency than a synchronized HashMap for many workloads.<\/li>
            • Supports atomic operations such as putIfAbsent() and merge().<\/li><\/ul>\n\n\n\n
              When should we use ConcurrentHashMap?<\/strong><\/p>\n\n\n\n
              Use ConcurrentHashMap when multiple threads need to read and update a shared key-value map safely.<\/p>\n\n\n\n
              Java Collections Quick Comparison<\/h2>\n\n\n\n
              Collection<\/th>Main Purpose<\/th>Duplicates<\/th>Ordering<\/th><\/tr>
              ArrayList<\/td>Index-based storage<\/td>Allowed<\/td>Insertion order<\/td><\/tr>
              HashSet<\/td>Unique elements<\/td>Not allowed<\/td>No guaranteed order<\/td><\/tr>
              HashMap<\/td>Key-value storage<\/td>Unique keys<\/td>No guaranteed order<\/td><\/tr>
              TreeMap<\/td>Sorted key-value storage<\/td>Unique keys<\/td>Sorted keys<\/td><\/tr>
              Queue<\/td>FIFO processing<\/td>Generally allowed<\/td>Processing order<\/td><\/tr>
              ConcurrentHashMap<\/td>Concurrent key-value storage<\/td>Unique keys<\/td>No guaranteed order<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n
              How to Choose the Right Collection?<\/h2>\n\n\n\n
              Remember these practical scenarios:<\/p>\n\n\n\n
              1. Need duplicates and index-based access? Use ArrayList.<\/li>
              2. Need unique elements? Use HashSet.<\/li>
              3. Need key-value storage? Use HashMap.<\/li>
              4. Need sorted keys? Use TreeMap.<\/li>
              5. Need FIFO processing? Use Queue.<\/li>
              6. Need thread-safe concurrent key-value access? Use ConcurrentHashMap.<\/li><\/ol>\n\n\n\n
                Practice Assignments for Students<\/h2>\n\n\n\n
                Try implementing the following scenarios using the appropriate Java collection.<\/p>\n\n\n\n
                1. Create a shopping cart that allows duplicate products.<\/li>
                2. Create a collection of unique email addresses.<\/li>
                3. Store employee IDs and employee names.<\/li>
                4. Store student records sorted by roll number.<\/li>
                5. Implement a bank customer waiting queue.<\/li>
                6. Create a login counter updated by multiple threads using ConcurrentHashMap.<\/li><\/ol>\n\n\n\n
                  Conclusion<\/h2>\n\n\n\n
                  Java Collections Framework makes it easier to manage data in Java applications.<\/p>\n\n\n\n
                  Understanding when to use ArrayList, HashSet, HashMap, TreeMap, Queue, and ConcurrentHashMap is essential for every Java developer.<\/p>\n\n\n\n
                  Instead of memorizing collection classes, focus on understanding their behavior, internal working, performance characteristics, and real-world use cases.<\/p>\n\n\n\n
                  <\/p>\n","protected":false},"excerpt":{"rendered":"
                  The Java Collections Framework (JCF) is an important part of Java programming. It provides a set of interfaces and classes that help developers store, manage, search, sort, and manipulate groups of objects efficiently. Instead of working with fixed-size arrays, we can use collections that provide dynamic storage and various data management capabilities. In this tutorial, […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[3],"tags":[],"_links":{"self":[{"href":"https:\/\/codeinsightacademy.com\/blog\/wp-json\/wp\/v2\/posts\/2991"}],"collection":[{"href":"https:\/\/codeinsightacademy.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/codeinsightacademy.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/codeinsightacademy.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/codeinsightacademy.com\/blog\/wp-json\/wp\/v2\/comments?post=2991"}],"version-history":[{"count":1,"href":"https:\/\/codeinsightacademy.com\/blog\/wp-json\/wp\/v2\/posts\/2991\/revisions"}],"predecessor-version":[{"id":2992,"href":"https:\/\/codeinsightacademy.com\/blog\/wp-json\/wp\/v2\/posts\/2991\/revisions\/2992"}],"wp:attachment":[{"href":"https:\/\/codeinsightacademy.com\/blog\/wp-json\/wp\/v2\/media?parent=2991"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/codeinsightacademy.com\/blog\/wp-json\/wp\/v2\/categories?post=2991"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/codeinsightacademy.com\/blog\/wp-json\/wp\/v2\/tags?post=2991"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}