{"id":359,"date":"2025-07-01T12:14:42","date_gmt":"2025-07-01T12:14:42","guid":{"rendered":"https:\/\/thetestdata.com\/blog\/?p=359"},"modified":"2025-07-16T10:06:07","modified_gmt":"2025-07-16T10:06:07","slug":"what-is-the-difference-between-list-and-set","status":"publish","type":"post","link":"https:\/\/thetestdata.com\/blog\/what-is-the-difference-between-list-and-set\/","title":{"rendered":"What is the difference between List and Set?"},"content":{"rendered":"\n

\ud83d\uddc2\ufe0f Difference Between List and Set<\/p>\n\n\n\n

Feature<\/th>List<\/code><\/th>Set<\/code><\/th><\/tr><\/thead>
Order<\/strong><\/td>Maintains insertion order<\/td>No guaranteed order (unless using LinkedHashSet)<\/td><\/tr>
Duplicates<\/strong><\/td>\u2705 Allows duplicates<\/td>\u274c Does not<\/strong> allow duplicates<\/td><\/tr>
Indexing<\/strong><\/td>Indexed\u2014can access elements by index (get(i)<\/code>)<\/td>Not indexed\u2014no position-based access<\/td><\/tr>
Implementations<\/strong><\/td>ArrayList<\/code>, LinkedList<\/code>, Vector<\/code>, etc.<\/td>HashSet<\/code>, LinkedHashSet<\/code>, TreeSet<\/code>, etc.<\/td><\/tr>
Best Use Case<\/strong><\/td>When order & duplicates matter<\/td>When uniqueness is required<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n

\ud83d\udcbb Code Example<\/p>\n\n\n\n

\ud83d\udccb Using a List<\/code> (e.g., ArrayList<\/code>)<\/p>\n\n\n\n

import java.util.*;\n\npublic class ListExample {\n    public static void main(String[] args) {\n        List<String> fruits = new ArrayList<>();\n        fruits.add(\"Apple\");\n        fruits.add(\"Banana\");\n        fruits.add(\"Apple\");  \/\/ Duplicate allowed\n\n        System.out.println(fruits);  \/\/ [Apple, Banana, Apple]\n    }\n}<\/code><\/pre>\n\n\n\n
\u2705 Using a Set<\/code> (e.g., HashSet<\/code>)<\/p>\n\n\n\n
import java.util.*;\n\npublic class SetExample {\n    public static void main(String[] args) {\n        Set<String> fruits = new HashSet<>();\n        fruits.add(\"Apple\");\n        fruits.add(\"Banana\");\n        fruits.add(\"Apple\");  \/\/ Duplicate ignored\n\n        System.out.println(fruits);  \/\/ [Apple, Banana] (order may vary)\n    }\n}<\/code><\/pre>\n\n\n\n
\ud83d\udccc When to Use Which?<\/p>\n\n\n\n
Situation<\/th>Choose<\/th><\/tr><\/thead>
You want to store elements with duplicates<\/strong> and preserve order<\/strong><\/td>List<\/code><\/td><\/tr>
You need a collection of unique values<\/strong><\/td>Set<\/code><\/td><\/tr>
You want to perform fast lookup, insert, delete<\/strong>, and don’t care about order<\/td>HashSet<\/code><\/td><\/tr>
You need sorted unique elements<\/strong><\/td>TreeSet<\/code><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n
\ud83c\udfaf Interview Takeaways<\/strong><\/p>\n\n\n\n
    \n
  • \u2705 Highlight that List<\/code> allows duplicates and is indexed.<\/li>\n\n\n\n
  • \u2705 Stress that Set<\/code> is all about uniqueness<\/strong> and often better for quick lookups<\/strong>.<\/li>\n\n\n\n
  • \u274c Don\u2019t confuse order preservation\u2014only LinkedHashSet<\/code> maintains insertion order, not HashSet<\/code>.<\/li>\n\n\n\n
  • \u2705 Mention performance: HashSet<\/code> has O(1)<\/strong> average time complexity for basic operations.<\/li>\n\n\n\n
  • Pro tip: Always choose the right collection<\/strong> based on the behavior you want\u2014don’t just default to ArrayList<\/code>.<\/li>\n<\/ul>\n\n\n\n
    <\/p>\n","protected":false},"excerpt":{"rendered":"
    Understand the key differences between List and Set in Java. Learn about ordering, duplicates, and use cases to choose the right data structure in coding.<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"om_disable_all_campaigns":false,"_monsterinsights_skip_tracking":false,"_monsterinsights_sitenote_active":false,"_monsterinsights_sitenote_note":"","_monsterinsights_sitenote_category":0,"site-container-style":"default","site-container-layout":"default","site-sidebar-layout":"default","disable-article-header":"default","disable-site-header":"default","disable-site-footer":"default","disable-content-area-spacing":"default","footnotes":""},"categories":[17],"tags":[],"class_list":["post-359","post","type-post","status-publish","format-standard","hentry","category-java-interview-questions"],"aioseo_notices":[],"_links":{"self":[{"href":"https:\/\/thetestdata.com\/blog\/wp-json\/wp\/v2\/posts\/359","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/thetestdata.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/thetestdata.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/thetestdata.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/thetestdata.com\/blog\/wp-json\/wp\/v2\/comments?post=359"}],"version-history":[{"count":2,"href":"https:\/\/thetestdata.com\/blog\/wp-json\/wp\/v2\/posts\/359\/revisions"}],"predecessor-version":[{"id":415,"href":"https:\/\/thetestdata.com\/blog\/wp-json\/wp\/v2\/posts\/359\/revisions\/415"}],"wp:attachment":[{"href":"https:\/\/thetestdata.com\/blog\/wp-json\/wp\/v2\/media?parent=359"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/thetestdata.com\/blog\/wp-json\/wp\/v2\/categories?post=359"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/thetestdata.com\/blog\/wp-json\/wp\/v2\/tags?post=359"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}