Created
September 20, 2017 10:21
-
-
Save javamultiplex/83c16d6c2a41150bf1e45f6467c4b868 to your computer and use it in GitHub Desktop.
Duplicate Characters Finder
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
package com.javamultiplex.string; | |
import java.util.HashSet; | |
import java.util.Iterator; | |
import java.util.LinkedHashSet; | |
import java.util.Scanner; | |
/** | |
* | |
* @author Rohit Agarwal | |
* @category String Interview Question | |
* @Problem Print all duplicate characters in a String | |
* | |
*/ | |
public class DuplicateCharactersInString { | |
public static void main(String[] args) { | |
Scanner input = null; | |
try { | |
input = new Scanner(System.in); | |
System.out.println("Enter String: "); | |
String string = input.next(); | |
// Converting String to char array. | |
char[] stringToChar = string.toCharArray(); | |
int orignalLength = stringToChar.length, charCount = 0; | |
String newString = getStringAfterDuplicatesRemoval(stringToChar); | |
// Converting String to char array. | |
char[] stringToCharAfterDuplicateRemoval = newString.toCharArray(); | |
int newLength = stringToCharAfterDuplicateRemoval.length; | |
if (string.equals(newString)) { | |
System.out.println("No duplicate character available."); | |
} else { | |
System.out.println("Duplicate characters are: "); | |
for (int i = 0; i < newLength; i++) { | |
charCount = 0; | |
for (int j = 0; j < orignalLength; j++) { | |
if (stringToCharAfterDuplicateRemoval[i] == stringToChar[j]) { | |
charCount++; | |
} | |
} | |
if (charCount > 1) { | |
System.out.println(stringToCharAfterDuplicateRemoval[i]); | |
} | |
} | |
} | |
} finally { | |
if (input != null) { | |
input.close(); | |
} | |
} | |
} | |
// Removing duplicates by converting char Array to Set. | |
private static String getStringAfterDuplicatesRemoval(char[] stringToChar) { | |
HashSet<Character> set = new LinkedHashSet<>(); | |
String result = ""; | |
int orignalLength = stringToChar.length; | |
for (int i = 0; i < orignalLength; i++) { | |
set.add(stringToChar[i]); | |
} | |
Iterator<Character> iterator = set.iterator(); | |
while (iterator.hasNext()) { | |
result += iterator.next(); // Converting Set to String | |
} | |
return result; | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment