Finding repeated words on a string and counting the repetitions

Question

I need to find repeated words on a string  and then count how many times they were repeated  So basically  if the input string is this   String s    House  House  House  Dog  Dog  Dog  Dog     I need to create a new string list without repetitions and save somewhere else the amount of repetitions for each word  like such   New String   House  Dog   New Int Array   3  4   Is there a way to do this easily with Java  I ve managed to separate the string using s split   but then how do I count repetitions and eliminate them on the new string  Thanks

User · Answer

package string   import java util HashMap  import java util Map  import java util Set   public class DublicatewordinanArray   public static void main String   args    String str    This is Dileep Dileep Kumar Verma Verma   DuplicateString str         public static void DuplicateString String str    String word     str split       Map  lt  String  Integer  gt  map   new HashMap  lt  String  Integer  gt      for  String w  word  if   map containsKey w     map put w  1         else   map put w  map get w    1             Set  lt  Map Entry  lt  String  Integer  gt  gt  entrySet   map entrySet     for  Map Entry  lt  String  Integer  gt  entry  entrySet  if  entry getValue    gt  1     System out printf   s    d  n   entry getKey    entry getValue

User · Answer

program to find number of repeating characters in a string   Developed by Rahul Lakhmara  import java util     public class CountWordsInString       public static void main String   args            String original    I am rahul am i sunil so i can say am i              making String type of array         String   originalSplit   original split                  if word has only one occurrence         int count   1             LinkedHashMap will store the word as key and number of occurrence as            value         Map lt String  Integer gt  wordMap   new LinkedHashMap lt String  Integer gt              for  int i   0  i  lt  originalSplit length - 1  i                  for  int j   i   1  j  lt  originalSplit length  j                      if  originalSplit i  equals originalSplit j                             Increment in count  it will count how many time word                        occurred                     count                                                   if word is already present so we will not add in Map             if  wordMap containsKey originalSplit i                      count   1                else                   wordMap put originalSplit i   count                   count   1                                   Set word   wordMap entrySet            Iterator itr   word iterator            while  itr hasNext                  Map Entry map    Map Entry  itr next                   Printing             System out println map getKey           map getValue

User · Answer

Please use the below code  It is the most simplest as per my analysis  Hope you will like it   import java util Arrays  import java util Collections  import java util HashMap  import java util HashSet  import java util List  import java util Scanner  import java util Set   public class MostRepeatingWord        String mostRepeatedWord String s           String   splitted   s split               List lt String gt  listString   Arrays asList splitted           Set lt String gt  setString   new HashSet lt String gt  listString           int count   0          int maxCount   1          String maxRepeated   null          for String inp  setString               count   Collections frequency listString  inp               if count  gt  maxCount                   maxCount   count                  maxRepeated   inp                                  return maxRepeated            public static void main String   args                        System out println  Enter The Sentence              Scanner s   new Scanner System in           String input   s nextLine            MostRepeatingWord mrw   new MostRepeatingWord            System out println  Most repeated word is      mrw mostRepeatedWord input

User · Answer

If this is a homework  then all I can say is  use String split   and HashMap lt String Integer gt     I see you ve found split   already  You re along the right lines then

User · Answer

as introduction of stream has changed the way we code  i would like to add some of the ways of doing this using it     String   strArray   str split  quot   quot               1  All string value with their occurrences     Map lt String  Long gt  counterMap                Arrays stream strArray  collect Collectors groupingBy e- gt e  Collectors counting             2  only duplicating Strings     Map lt String  Long gt  temp   counterMap entrySet   stream   filter map- gt map getValue    gt  1  collect Collectors toMap map - gt  map getKey    map - gt  map getValue          System out println  quot test    quot  temp              3  List of Duplicating Strings     List lt String gt  masterStrings   Arrays asList strArray       Set lt String gt  duplicatingStrings                masterStrings stream   filter i - gt  Collections frequency masterStrings  i   gt  1  collect Collectors toSet

User · Answer

import java util ArrayList  import java util Arrays  import java util HashMap  import java util HashSet  import java util List  import java util Map  import java util Set   public class DuplicateWord        public static void main String   args            String para    this is what it is this is what it can be           List  lt  String  gt  paraList   new ArrayList  lt  String  gt              paraList   Arrays asList para split                System out println paraList           int size   paraList size             int i   0          Map  lt  String  Integer  gt  duplicatCountMap   new HashMap  lt  String  Integer  gt              for  int j   0  size  gt  j  j                  int count   0              for  i   0  size  gt  i  i                      if  paraList get j  equals paraList get i                          count                        duplicatCountMap put paraList get j   count                                                       System out println duplicatCountMap           List  lt  Integer  gt  myCountList   new ArrayList  lt   gt              Set  lt  String  gt  myValueSet   new HashSet  lt   gt              for  Map Entry  lt  String  Integer  gt  entry  duplicatCountMap entrySet                  myCountList add entry getValue                 myValueSet add entry getKey                       System out println myCountList           System out println myValueSet              Input  this is what it is this is what it can be  Output     this  is  what  it  is  this  is  what  it  can  be    can 1  what 2  be 1  this 2  is 3  it 2    1  2  1  2  3  2    can  what  be  this  is  it

User · Answer

You ve got the hard work done   Now you can just use a Map to count the occurrences   Map lt String  Integer gt  occurrences   new HashMap lt String  Integer gt      for   String word   splitWords        Integer oldCount   occurrences get word      if   oldCount    null           oldCount   0          occurrences put word  oldCount   1       Using map get word  will tell you many times a word occurred   You can construct a new list by iterating through map keySet     for   String word   occurrences keySet           do something with word     Note that the order of what you get out of keySet is arbitrary   If you need the words to be sorted by when they first appear in your input String  you should use a LinkedHashMap instead

User · Answer

Using Java 8 streams collectors   public static Map lt String  Integer gt  countRepetitions String str        return Arrays stream str split                 collect Collectors toMap s - gt  s  s - gt  1   a  b  - gt  a   1        Input   House  House  House  Dog  Dog  Dog  Dog  Cat   Output   Cat 1  House 3  Dog 4

User · Answer

Try this   public class DuplicateWordSearcher    SuppressWarnings  unchecked   public static void main String   args         String text    a r b k c d se f g a d f s s f d s ft gh f ws w f v x s g h d h j j k f sd j e wed a d f        List lt String gt  list   Arrays asList text split             Set lt String gt  uniqueWords   new HashSet lt String gt  list       for  String word   uniqueWords            System out println word          Collections frequency list  word

User · Answer

If you pass a String argument it will count the repetition of each word             param string     return map which contain the word and value as the no of repatation     public Map findDuplicateString String str        String   stringArrays   str split           Map lt String  Integer gt  map   new HashMap lt String  Integer gt         Set lt String gt  words   new HashSet lt String gt  Arrays asList stringArrays        int count   0      for  String word   words            for  String temp   stringArrays                if  word equals temp                       count                                  map put word  count           count   0             return map       output    Word1 2  word2 4  word2 1

User · Answer

program to find number of repeating characters in a string   Developed by Subash lt subash senapati ymail com gt    import java util Scanner   public class NoOfRepeatedChar        public static void main String   args           input through key board  Scanner sc   new Scanner System in    System out println  Enter a string       String s1  sc nextLine            formatting String to char array      String s2 s1 replace              char    ch s2 toCharArray         int counter 0         for-loop tocompare first character with the whole character array      for int i 0 i lt ch length i                  int count 0           for int j 0 j lt ch length j                           if ch i   ch j                   count      if character is matching with others                   if count gt 1                        boolean flag false                 for-loop to check whether the character is already refferenced or not              for  int k i-1 k gt  0  k--                                 if ch i     ch k      if the character is already refferenced                     flag true                            if   flag     if flag  false                   counter counter 1                      if counter  gt  0    if there is are any repeating characters             System out println  Number of repeating charcters in the given string is are    counter       else             System out println  Sorry there is are no repeating charcters in the given string

User · Answer

public static void main String   args       String string    elamparuthi  elam  elamparuthi       String   s   string replace          split           String   op      String ops            for int i 0  i lt  s length-1  i             if  ops contains s i                    if ops       ops                     ops  s i                        System out println ops

User · Answer

package day2   import java util ArrayList  import java util HashMap  enter code here  import java util List   public class DuplicateWords        public static void main String   args            String S1    House  House  House  Dog  Dog  Dog  Dog           String S2   S1 toLowerCase            String   S3   S2 split    s             List lt String gt  a1   new ArrayList lt String gt             HashMap lt String  Integer gt  hm   new HashMap lt  gt              for  int i   0  i  lt  S3 length - 1  i                   if  a1 contains S3 i                                  a1 add S3 i                              else                               continue                             int Count   0               for  int j   0  j  lt  S3 length - 1  j                                  if S3 j  equals S3 i                                          Count                                                 hm put S3 i   Count                      System out println  Duplicate Words and their number of occurrences in String S1       hm

User · Answer

import java util HashMap  import java util Scanner  public class class1   public static void main String   args        Scanner in   new Scanner System in       String inpStr   in nextLine        int key       HashMap lt String Integer gt  hm   new HashMap lt String Integer gt         String   strArr   inpStr split            for int i 0 i lt strArr length i             if hm containsKey strArr i                 key   hm get strArr i                hm put strArr i  key 1                      else              hm put strArr i  1                          System out println hm

User · Answer

public static void main String   args        String s  sdf sdfsdfsd sdfsdfsd sdfsdfsd sdf sdf sdf        String st   s split           System out println st length       Map lt String  Integer gt  mp  new TreeMap lt String  Integer gt         for int i 0 i lt st length i              Integer count mp get st i            if count    null               count 0                               mp put st i    count            System out println mp size        System out println mp get  sdfsdfsd

User · Answer

It may help you somehow   String st  I am am not the one who is thinking I one thing at time   String   ar   st split    s    Map lt String  Integer gt  mp  new HashMap lt String  Integer gt     int count 0   for int i 0 i lt ar length i         count 0       for int j 0 j lt ar length j             if ar i  equals ar j             count                                         mp put ar i   count      System out println mp

User · Answer

For Strings with no space  we can use the below mentioned code  private static void findRecurrence String input        final Map lt String  Integer gt  map   new LinkedHashMap lt  gt         for int i 0  i lt input length                int pointer   i          int startPointer   i          boolean pointerHasIncreased   false          for int j 0  j lt startPointer  j                 if pointer lt input length    amp  amp  input charAt j   input charAt pointer   amp  amp  input charAt j   32                   pointer                    pointerHasIncreased   true               else                  if pointerHasIncreased                       break                                                    if pointer - startPointer  gt   2                String word   input substring startPointer  pointer               if map containsKey word                    map put word  map get word  1                else                  map put word  1                             i pointer           else              i                        for Map Entry lt String  Integer gt  entry   map entrySet             System out println entry getKey              entry getValue   1              Passing some input as  hahaha  or  ba na na  or  xxxyyyzzzxxxzzz  give the desired output

User · Answer

You can use Prefix tree  trie  data structure to store words and keep track of count of words within  Prefix Tree Node      define  ALPHABET SIZE 26      Structure of each node of prefix tree   struct prefix tree node       prefix tree node     count 0         int count      prefix tree node  child ALPHABET SIZE          void insert string in prefix tree string word          prefix tree node  current   root      for unsigned int i 0 i lt word size     i            Assuming it has only alphabetic lowercase characters                Note       Change this check or convert into lower case     const unsigned int letter   static cast lt int gt  word i  -  a              Invalid alphabetic character  then continue          Note      Change this condition depending on the scenario       if letter  gt  26          throw runtime error  Invalid alphabetic character           if current- gt child letter     NULL          current- gt child letter    new prefix tree node           current   current- gt child letter           current- gt count         Insert this string into Max Heap and sort them by counts           Data structure for storing in Heap will be something like this     struct MaxHeapNode          int count         string word           After inserting all words  you have to print word and count by iterating Maxheap

User · Answer

Use Function identity   inside Collectors groupingBy and store everything in a MAP  String a     quot Gini Gina Gina Gina Gina Protijayi Protijayi  quot            Map lt String  Long gt  map11   Arrays stream a split  quot   quot    collect Collectors                  groupingBy Function identity   Collectors counting              System out println map11       output   gt   Gina 4  Gini 1  Protijayi 2   In Python we can use collections Counter   a    quot Roopa Roopi  loves green color Roopa Roopi quot  words   a split    wordsCount   collections Counter words  for word count in sorted wordsCount items         print   quot  s quot  is repeated  d time s      word count  quot s quot  if count  gt  1 else  quot  quot      Output    quot Roopa quot  is repeated 2 times   quot Roopi quot  is repeated 2 times   quot color quot  is repeated 1 time   quot green quot  is repeated 1 time   quot loves quot  is repeated 1 time

User · Answer

I hope this will help you  public void countInPara String str         Map lt Integer String gt  strMap   new HashMap lt Integer String gt         List lt String gt  paraWords   Arrays asList str split            Set lt String gt  strSet   new LinkedHashSet lt  gt  paraWords       int count       for String word   strSet            count   Collections frequency paraWords  word           strMap put count  strMap get count   null   word   strMap get count  concat     word               for Map Entry lt Integer String gt  entry   strMap entrySet            System out println entry getKey            entry getValue

User · Answer

count no of Word in String using TreeMap we can use HashMap also but word will not display in sorted order     import java util     public class Genric3       public static void main String   args                 Map lt String  Integer gt  unique   new TreeMap lt String  Integer gt             String string1  Ram Ram  Dog  Dog  Dog  Dog leela leela house house shayam           String string2   string1 split                for  int i 0  i lt string2 length  i                          String string string2 i               unique put string  unique get string     null 1  unique get string  1                        System out println unique

User · Answer

import java util HashMap  import java util LinkedHashMap   public class CountRepeatedWords        public static void main String   args              countRepeatedWords  Note that the order of what you get out of keySet is arbitrary  If you need the words to be sorted by when they first appear in your input String  you should use a LinkedHashMap instead                public static void countRepeatedWords String wordToFind            String   words   wordToFind split               HashMap lt String  Integer gt  wordMap   new LinkedHashMap lt String  Integer gt              for  String word   words                wordMap put word                   wordMap get word     null   1    wordMap get word    1                            System out println wordMap

User · Answer

As mentioned by others use String  split    followed by some map  hashmap or linkedhashmap  and then merge your result  For completeness sake putting the code   import java util     public class Genric lt E gt        public static void main String   args                 Map lt String  Integer gt  unique   new LinkedHashMap lt String  Integer gt             for  String string    House  House  House  Dog  Dog  Dog  Dog  split                      if unique get string     null                  unique put string  1               else                 unique put string  unique get string    1                     String uniqueString   join unique keySet                   List lt Integer gt  value   new ArrayList lt Integer gt  unique values              System out println  Output       uniqueString           System out println  Values       value               public static String join Collection lt String gt  s  String delimiter            StringBuffer buffer   new StringBuffer            Iterator lt String gt  iter   s iterator            while  iter hasNext                  buffer append iter next                 if  iter hasNext                      buffer append delimiter                                   return buffer toString              New String is Output   House  Dog  Int array  or rather list  Values    3  4   you can use List  toArray  for getting an array

User · Answer

public class StringsCount       public static void main String args               String value    This is testing Program testing Program            String item     value split                HashMap lt String  Integer gt  map   new HashMap lt  gt              for  String t   item                if  map containsKey t                     map put t  map get t    1                  else                   map put t  1                                   Set lt String gt  keys   map keySet            for  String key   keys                System out println key               System out println map get key

User · Answer

please try these it may be help for you   public static void main String   args            String str1  House  House  House  Dog  Dog  Dog  Dog           String str2 str1 replace                   Map lt String Integer gt  map findFrquenciesInString str2           Set lt String gt  keys map keySet            Collection lt Integer gt  vals map values            System out println keys           System out println vals          private static Map lt String Integer gt  findFrquenciesInString String str1            String   strArr str1 split               Map lt String Integer gt  map new HashMap lt  gt             for int i 0 i lt strArr length i                  int count 1              for int j i 1 j lt strArr length j                      if strArr i  equals strArr j    amp  amp  strArr i    -1                         strArr j   -1                       count                                                if count gt 1  amp  amp  strArr i    -1                     map put strArr i   count                   strArr i   -1                                   return map

User · Answer

public class Counter    private static final int COMMA AND SPACE PLACE   2   private String mTextToCount  private ArrayList lt String gt  mSeparateWordsList   public Counter String mTextToCount        this mTextToCount   mTextToCount       mSeparateWordsList   cutStringIntoSeparateWords mTextToCount      private ArrayList lt String gt  cutStringIntoSeparateWords String text        ArrayList lt String gt  returnedArrayList   new ArrayList lt  gt           if text indexOf         -1                returnedArrayList add text           return returnedArrayList             int position1   0      int position2   0       while position2  lt  text length                  char c                if text toCharArray   position2     c                        String tmp   text substring position1  position2               position1    tmp length     COMMA AND SPACE PLACE              returnedArrayList add tmp                     position2               if position1  lt  position2                returnedArrayList add text substring position1  position2               return returnedArrayList     public int   countWords         if mSeparateWordsList    null  return null        HashMap lt String  Integer gt  wordsMap   new HashMap lt  gt          for String s  mSeparateWordsList                int cnt           if wordsMap containsKey s                         cnt   wordsMap get s               cnt              else               cnt   1                    wordsMap put s  cnt                             return printCounterResults wordsMap      private int   printCounterResults HashMap lt String  Integer gt  m                int index   0      int   returnedIntArray   new int m size          for int i  m values                  returnedIntArray index    i          index               return returnedIntArray

User · Answer

Hope this helps    public static int countOfStringInAText String stringToBeSearched  String masterString        int count   0      while  masterString indexOf stringToBeSearched  gt  0         count   count   1        masterString   masterString substring masterString indexOf stringToBeSearched  1             return count

User · Answer

Once you have got the words from the string it is easy  From Java 10 onwards you can try the following code   import java util Arrays  import java util stream Collectors   public class StringFrequencyMap       public static void main String    args            String   wordArray     House    House    House    Dog    Dog    Dog    Dog            var freq   Arrays stream wordArray                            collect Collectors groupingBy x - gt  x  Collectors counting              System out println freq             Output    House 3  Dog 4

User · Answer

Using java8   private static void findWords String s  List lt String gt  output  List lt Integer gt  count       String   words   s split            Map lt String  Integer gt  map   new LinkedHashMap lt  gt         Arrays stream words  forEach e- gt map put e  map getOrDefault e  0    1        map forEach  k v - gt           output add k           count add v               Also  use a LinkedHashMap if you want to preserve the order of insertion  private static void findWords        String s    House  House  House  Dog  Dog  Dog  Dog       List lt String gt  output   new ArrayList lt  gt         List lt Integer gt  count   new ArrayList lt  gt         findWords s  output  count       System out println output       System out println count       Output   House  Dog   3  4

[java] Finding repeated words on a string and counting the repetitions

Examples related to java

Examples related to string

Examples related to repeat