Practice›Java Fundamentals›Module 10. Collections›10.2 HashSet

Task 7 of 7 · 0 solved · 7 to go0%

You can read the problem, but answers are checked only for signed-in students. Sign in to answer →

Problem

10.2 HashSet — capstone: distinct and duplicates

Read a count and then that many words. Print how many distinct words there were, whether any word repeated, and finally whether one more word you read is among them.

For 5, a b a c b, a:

3
true
true

Remember add returns false when the value was already there — that alone detects a repeat.

1000 ms

256 Mb

Solution

Attempts: 0 A hint guides you to the fix — it never writes the code for you.

✦

Ready to check

Press «Submit» to run your code against the task's test cases — that is what sets your score. «AI review» is an optional second opinion: it reads your code — logic and style, not just the output — and suggests the next step without handing over the answer. It never changes your score.

Next module →

Working…