Grouping similar strings in a String array in Java

Replies

• 

  Anoop Kumar

  use Set .
  make all different sets and compare with elements
• 

  rahul69

  Well in my opinion, you can start with partial groups and move towards more perfect grouping.
  First divide on the basis of string length.
  Then in each group:
  match first string letters with rest of the strings (increment the flag if a letter is found anywhere in
  string), so that all letters are matched.
  those strings which are not matched are put in new group and matching check is repeated again,
  until:
  only one string remains in the group.
  Thus the groups are created.
  I don't know whether this is the best possible solution or not but hope this helps. 😎
• 

  ankur8819

  I was able to do it in following way.Any comments to improve the performance if the String array length is say 10000.
  
  

  import java.util.ArrayList;
  import java.util.Collections;
  import java.util.Comparator;
  import java.util.HashSet;
   
   
  public class SimilarStrings {
   
      public static void main(String[] args) {
     
          String s[]= new String[]{"AXP","PXA","ABCD","XPA","TYPZ","YTPZ","DESP","PDSE","XAP","ZYTP","BACD","DACB"};
          ModifiedString md= null;
          ArrayList al= new ArrayList();
          ArrayList groupList= new ArrayList();
          ArrayList finalList= new ArrayList();
          for(int i=0;i
                                      

• 

  simplycoder

  Your approach is correct, but instead of sorting each string and then comparing,
  store a copy of all strings in another storage,remember the indices and sort them and replace the indices.
  then your can gather according to your need al at once.
  
  If you are trying this for optimization, I would suggest you implement some sorting algorithm like radix sort or similar.
• 

  suraz

  why not join nataraz.blogspot.com where we are uploading all standard question daily