- Executors
-
Learn
Learn Python Runnable examples, NumPy, pandas, and more Learn AI / Machine LearningNeural networks, ML and LLMs from scratch Learn C & C++ Pointers, memory, STL, and modern C++ Learn C#C# basics, OOP, LINQ, async, and .NET exercises Learn MatplotlibLine, bar, scatter and pie charts with live visualizers Learn RustOwnership, traits, error handling, and threads Learn GoSlices, interfaces, goroutines, and channels Python Algorithms Search, sorting, recursion, and visualizers O(n) C & C++ Algorithms Compare algorithms implemented in C and C++ Coding for Kids Learn to code by playing!
- QuizzesNew
- ChallengesNew
- For TeachersNew
- Updates
- Buy me a coffee
Java HashMap Quiz
This Java quiz tests how HashMap really behaves. You will predict what put(), get(), getOrDefault(), merge() and computeIfAbsent() return, see why keys need both equals() and hashCode(), and handle null values safely.
Sample question
Question 1 of 10What does this print?
import java.util.HashMap;
import java.util.Map;
public class Main {
public static void main(String[] args) {
Map<String, Integer> m = new HashMap<>();
System.out.println(m.put("a", 1) + " " + m.put("a", 2) + " " + m.get("a"));
}
}
Show the answer
C. null 1 2 put() returns the value previously stored for the key: null the first time, then 1. The second put() replaces the value, so get() returns 2.
What this quiz covers
put()returns the old value,get()returnsnullwhen missing- Counting and grouping with
merge()andcomputeIfAbsent() - Keys need matching
equals()andhashCode() nullvalues,containsKey()and unboxing- Iteration order:
HashMap,LinkedHashMap,TreeMap
Questions people ask
Do I need an account?
No. Anyone can play. Sign in to keep your XP, streak, badges and history.
Can I retake it?
Yes. Your best score is kept, and the questions and answers are shuffled each time.