Skip to content

Tag Archives: Java-HashMap

Java HashMap is an implementation of the Map interface which maps a Value to a Key which essentially forms an associative pair wherein we can… Read More
HashMap in Java is the realization of the Hash Table data structure of sorts. It is composed of Key and Value pairs which are symbolically… Read More
EnumMap and HashMap both are the classes that implement the Map interface. But there are some differences that exist between them. So we have tried… Read More
The HashMap class of Java provides the functionality of the hash table data structure. This class is found in the java.util package. It implements the… Read More
HashMap is part of the Collections framework of java. It stores the data in the form of key-value pairs.  These values of the HashMap can… Read More
Maps are used for when you want to associate a key with a value and Lists are an ordered collection. Map is an interface in… Read More
HashMap is a part of Java’s collection providing the basic implementation of the Map interface of Java by storing the data in (Key, Value) pairs… Read More
HashMap is similar to the HashTable, but it is unsynchronized. It allows to store the null keys as well, but there should be only one… Read More
ArrayList is a resizable array. It is under the java package java.util. It gives dynamic arrays in Java. ArrayList is useful in programs where a… Read More
Considering a string object that contains the student name and roll number separated by a comma, and each student contains the name and roll number… Read More
Serialization is the process by which we convert an object into a stream of bytes and store these bytes in file systems/databases or put them… Read More
Given an array arr[] consisting of N non-negative integers, the task is to find the number of operations required to make all array elements equal.… Read More
Given an array arr[] consisting of N integers, the task is to check if all subarrays of the array have at least one unique element… Read More
Given two integers K, X, and an array arr[] consisting of N distinct elements, the task is to find X elements closest to the Kth… Read More
Given an array arr[] consisting of N integers, the task is to maximize the resultant sum obtained after adding remaining elements after every removal of… Read More