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

  • Home
  • SEARCH
  • 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 7933383
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 3, 20262026-06-03T21:18:56+00:00 2026-06-03T21:18:56+00:00

I working with this code while((dictionaryWord = br_.readLine()) != null) { if(dictionaryWord.matches(^+word.replace(* , .

  • 0

I working with this code

                   while((dictionaryWord = br_.readLine()) != null) 
            {
                if(dictionaryWord.matches("^"+word.replace("*" , "." )+"$"))
                {   
                    incrementCounter();
                    System.out.println(dictionaryWord);
                }
            }

Desired Goal: word = dgo

Output: dog, god, dogma megalogdon, etc….

  • 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-06-03T21:18:58+00:00Added an answer on June 3, 2026 at 9:18 pm

    You can build a Set<Character> of all the chars in word, and iterate it. If one character is not in dictionaryWord, then dictionaryWord does not fit. Only if all appear – print dictionaryWord

        String word = "dog";
        String  dictionaryWord;
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        while((dictionaryWord = br.readLine()) != null)  {
            Set<Character> chars = new HashSet<Character>();
            for (char c : word.toCharArray()) {
                chars.add(c);
            }
            boolean match = true;
            for (Character c : chars) {
                String s = "" + c;
                if (!dictionaryWord.contains(s)) {
                    match = false;
                    break;
                }
            }
            if (match == true) 
                System.out.println(dictionaryWord);
        }
    

    In the above code, the set creation can be moved out of the while loop, of course.

    More efficient solution could be to create a Set from dictionaryWord as well, and then check if the intersection of the two sets is identical to the set representing word.

    This will be:

        String word = "dog";
        Set<Character> set1 = new HashSet();
        for (char c : word.toCharArray()) {
            set1.add(c);
        }
        String  dictionaryWord;
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        while((dictionaryWord = br.readLine()) != null)  {
            Set<Character> set2 = new HashSet();
            for (char c : dictionaryWord.toCharArray()) {
                set2.add(c);
            }           Set<String> intersection = new HashSet(CollectionUtils.intersection(set1, set2));
            if (set1.equals(intersection)) {
                System.out.println(dictionaryWord);
            } else System.out.println("bad");
        }
    

    using CollectionUtils.intersection() from apache commons

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I came across this code while working through code-analysis warnings on our code base.
I been working on this code for a while and can't seem to get
I have been working on this code but I can't find out what is
i am new in programming under linux and trying to get working this code:
I am working on this code but even after consulting other threads I am
I have this code working in C#: var request = (HttpWebRequest)WebRequest.Create(https://x.com/service); request.Method = GET;
i got this code working and it to return the last tweet from my
I have this working code, but now i need to be able to change
Why isn't this code working? I've been stuck on this for 2 days. public
I used to have this code working with my Tomcat server: HttpRequestBase targetRequest =

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.