1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 |
package practice; import java.util.Iterator; import java.util.LinkedHashSet; import java.util.Scanner; public class RemoveDuplicates { public static void main(String[] args) { Scanner sc = new Scanner(System.in); System.out.println("Please enter string for test"); String sampleString = sc.next(); LinkedHashSet<String> aMap = new LinkedHashSet<String>(); for (int i = 0; i < sampleString.length(); i++) { if (!aMap.contains(String.valueOf(sampleString.charAt(i)))) { aMap.add(String.valueOf(sampleString.charAt(i)).toLowerCase()); } } Iterator<String> itr = aMap.iterator(); System.out.println("String After Removing Duplicates"); while (itr.hasNext()) { System.out.print(itr.next()); } } } |
1 2 3 |
Please enter string for test Testing tesing |
Important Notes:
- LinkedHashSet is used to preserve the insertion order.
- Please debug the code for better understanding.
- Converting all character to Lower Case to make program case-insensitive.