What is the difference between hashset and hashmap?
- 1 Answers
- 1147 Views
- I also Faced
- E-Mail Answers
Answer Posted / Kuldeep Sharma
HashSet is a collection that implements the Set interface, while HashMap is a map implementation. HashSet stores unique elements (without duplicates), whereas HashMap maps keys to values. HashSet uses a hash table for fast lookup times, and its primary operation is the boolean contains() method. HashMap provides methods for adding, retrieving, and updating key-value pairs.
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
Draw a binary Tree for the expression : A * B - (C + D) * (P / Q)
Write a program for Sorting an Array. Which sorting will you prefer?
Can you declare an array without assigning the size of an array?
For the following COBOL code, draw the Binary tree? 01 STUDENT_REC. 02 NAME. 03 FIRST_NAME PIC X(10). 03 LAST_NAME PIC X(10). 02 YEAR_OF_STUDY. 03 FIRST_SEM PIC XX. 03 SECOND_SEM PIC XX.
“int a[] = new int[3]{1, 2, 3}” – This a legal way of defining the arrays?
What sort of serious problems have you experienced, and how have you handled them?
