Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 877273
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 15, 20262026-05-15T11:34:46+00:00 2026-05-15T11:34:46+00:00

Code:public class duplicate { public static void main(String[] args)throws IOException { System.out.println(Enter words separated

  • 0

Code:public class duplicate

{

public static void main(String[] args)throws IOException

  {

  System.out.println("Enter words separated by spaces ('.' to quit):");

  Set<String> s = new HashSet<String>();

  Scanner input = new Scanner(System.in);

  while (true)

  {

  String token = input.next();

  if (".".equals(token))

  break;

  if (!s.add(token))

  System.out.println("Duplicate detected: " + token);

  }

  System.out.println(s.size() + " distinct words:\n" + s);
 Set<String> duplicatesnum = new HashSet<String>();

String token = input.next();
if (!s.add(token))
{
duplicatesnum.add(token);
System.out.println(“Duplicate detected: ” + token);
}

System.out.println(duplicatesnum.size());

}
}
the output is:
Enter words separated by spaces (‘.’ to quit):
one two one two .
Duplicate detected: one
Duplicate detected: two
2 distinct words:
[two, one]

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-15T11:34:47+00:00Added an answer on May 15, 2026 at 11:34 am

    I assume you want to know the number of different duplicate words. You can use another HashSet<String> for the duplicates.

    //Outside the loop
    Set<String> duplicates = new HashSet<String>();
    
    //Inside the loop
    if (!s.add(token))
    {
        duplicates.add(token);
        System.out.println("Duplicate detected: " + token);
    }
    
    //Outside the loop
    System.out.println(duplicates.size());
    

    Also if you care for the occurences of each word declare a HashMap<String, Integer> as in others posts is mentioned.

    But if you want the number of all duplicate words(not different) just declare a counter:

    //Outside the loop
    int duplicates = 0;    
    
    //Inside the loop
    if (!s.add(token))
    {
        duplicates++;
        System.out.println("Duplicate detected: " + token);
    }
    
    //Outside the loop
    System.out.println(duplicates);
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Ask A Question

Stats

  • Questions 490k
  • Answers 490k
  • Best Answers 0
  • User 1
  • Popular
  • Answers
  • Editorial Team

    How to approach applying for a job at a company ...

    • 7 Answers
  • Editorial Team

    What is a programmer’s life like?

    • 5 Answers
  • Editorial Team

    How to handle personal stress caused by utterly incompetent and ...

    • 5 Answers
  • Editorial Team
    Editorial Team added an answer First of all, it's a really bad idea to use… May 16, 2026 at 9:17 am
  • Editorial Team
    Editorial Team added an answer If you are not dead set on using a listbox,… May 16, 2026 at 9:17 am
  • Editorial Team
    Editorial Team added an answer killproc will terminate programs in the process list which match… May 16, 2026 at 9:17 am

Trending Tags

analytics british company computer developers django employee employer english facebook french google interview javascript language life php programmer programs salary

Top Members

Related Questions

Possible Duplicate: Locking main() thread Below you'll find my code, Main calls two threads,
i have a problem calling multiple instance of a class that i have coded
Possible Duplicate: Project Euler, Problem 10 java solution not working So, I'm attempting to
Sorry if it is a duplicate post. link text but i didnt get any
This will probably be an extremely simple question. I'm simply trying to remove duplicate
i need to build a position manager class to tell me if a position
I am trying to get my Blackberry application to display a custom modal dialog,
I've written dozens of extension methods and they all work as expected. But this
I have written a program in Java to read in a text file of

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.