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 513733
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 13, 20262026-05-13T07:27:09+00:00 2026-05-13T07:27:09+00:00

Im stuck on writing Word occurrence in a string. I got some tip(in task

  • 0

Im stuck on writing Word occurrence in a string.
I got some tip(in task notes) to use is compareToIgnoreCase. so I tried something like this:

splitwords = StringCont.split("\\s");
for(int i=0; i<splitwords.length; i++)
{
    if(splitwords[1].compareToIgnoreCase(splitwords[i]) == 0)
        splitcount++;
}

It is of course just what I can do and probably bad way. When I run the code, I get sometimes out of array exeption and sometimes it runs.
What is missing is: go through all words and check them and skip the words which were already counted.
I will be happy to get any help with this so can move along and understand how it can be coded. Thank you 🙂

Edit: It seems I did not explain the problem enough clearly, but I get nice answer about the map object which easily put together what I needed. I did not know about map.
So yea, I was trying to find the number of times every given word is found in the string.

tangens: it should mean-take the first word(where first whitespace is) splitwords[1] and compare it to all other words in string splitwords[i] and if it is 0(equals), then count++.

Esko: there indeed are white spaces like in sentence. But I still got this exeption.
I dont know why thru.

  • 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-13T07:27:09+00:00Added an answer on May 13, 2026 at 7:27 am

    Store the words and their counts in a Map.

    String[] words = string.toLowerCase().split("\\s+");
    Map<String, Integer> wordCounts = new HashMap<String, Integer>();
    
    for (String word : words) {
        Integer count = wordCounts.get(word);
        if (count == null) {
            count = 0;
        }
        wordCounts.put(word, count + 1);
    }
    

    Note that I called toLowerCase() before split() as you seem want to have case insensitivity.

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

Sidebar

Related Questions

I'm a bit stuck on this. Basically I want to do something like the
I'm stuck on a PHP 4 server, and I would like to start moving
I'm stuck with .Net 1.1 application (i.e. I can not use the generics goodies
I'm stuck in .NET 2.0 Windows Forms. It doesn't look like the ability to
I have seen majority of web programmers (writing some script with sql to make
Being stuck with a legacy database schema that no longer reflects your data model
Really stuck on trying to write code to unzip a file or directory on
Disclaimer: I'm stuck on TFS and I hate it. My source control structure looks
I'm stuck on a fix to a legacy Visual C++ 6 app. In the
I'm kinda stuck with this one so I hoped someone could help me. I

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.