Skip to main content

Duplicate occurrences of characters in String without Collections

I have searched multiple websites to find the answer how to identify the duplicate characters in a given string "AMBERROADSOFTWARE" without using Collections API. But, still no luck. So, finally me and my team member Ramanjulu has found the way to solve this problem. This is also one of the question which is asking multiple companies interviews.

package com.javatbrains.practice;

public class FindDuplicatesFromString {
 public static void main(String[] args) {
  findUniqueChars();
  findDuplicateChar();
  findDuplicateWords();
 }

 private static void findUniqueChars() {
  String str = "NALLAMACHU";
  int count = 0;
  String finalString = "";

  if (str != null) {
   for (int i = 0; i < str.length(); i++) {
    char initialChar = str.charAt(i);
    int length = str.length();
    str = str.replaceAll(str.charAt(i) + "", "");
    count = length - str.length();
    if (count == 1)
     finalString = finalString + initialChar + "";
    i--;
   }
   System.out.println("Unique Character in String is: " + finalString);
  }
 }

 public static void findDuplicateChar() {
  String str = "NALLAMACHU";
  int count = 0;
  if (str != null) {
   System.out.println();
   System.out.println("Each Character repeated in given String is: ");
   for (int i = 0; i < str.length(); i++) {
    char initialChar = str.charAt(i);
    int length = str.length();
    str = str.replaceAll(str.charAt(i) + "", "");
    count = length - str.length();
    System.out.println(initialChar + " repeated at " + count);
    i--;
   }
  }
 }

 public static void findDuplicateWords() {
  String str = "Subbareddy Nallamachu Nallamachu Subbareddy Java";
  int count = 0;

  if (str != null) {
   System.out.println();
   System.out.println("Repeated words in given String is: ");
   str = str.toLowerCase();
   String[] arStr = str.split(" ");
   for (int i = 0; i < arStr.length; i++) {
    String s = arStr[i];
    int length = str.length();
    str = str.replaceAll(s, "");
    count = length - str.length();
    if (count > s.length()) {
     System.out.println(s);
    }
   }
  }
 }
}

The above logic will help you how to find the duplicate characters without using the Collections API in java. Now, you can see the below by using Collection API how can we find the same duplicate characters in given string.

import java.util.HashMap;
import java.util.Set;

public class FindDuplicates {

 public static void main(String[] args) {
  String str = "AMBERROADSOFTWARE";
  int count = 0;

  char[] chArray = str.toCharArray();
  HashMap<Character, Integer> hm = new HashMap<Character, Integer>();
  for (Character ch : chArray) {
   if (!hm.containsKey(ch)) {
    hm.put(ch, 1);
   } else {
    count = hm.get(ch);
    hm.put(ch, count + 1);
   }
  }

  if (hm != null) {
   Set<Character> charSet = hm.keySet();
   for (char ch3 : charSet) {
    System.out.println(ch3 + " repeated at " + hm.get(ch3));
   }
  }
 }
}
OutPut:
D repeated 1
T repeated 1
E repeated 2
W repeated 1
F repeated 1
A repeated 3
S repeated 1
B repeated 1
R repeated 3
M repeated 1
O repeated 2

Popular posts from this blog

JNDI configuration for Tomcat 9 with Oracle

In this article, I am going to place the required source code to get data from the table by using the JNDI configuration. Below are the environment details that I have configured currently. Windows - 7 Oracle - 10g Tomcat - 9 JDK - 8 Eclipse Oxygen Ojdbc6 jar required First, we need to create the Dynamic Web Project. If you don't know how to do <Click Here>. I have faced a lot of issues before getting the output like 405, No driver class to load, etc. I am using JSP & Servlets in the current explanation. Before started writing the application logic, we need to do the below configuration in the installed tomcat directory. Place OJDBC6.jar in the Tomcat LIB directory. Add this Resource under <GlobalNamingResources> in Server.xml file which is present under the conf directory in Tomcat. < Resource name = "jdbc/myoracle" global= "jdbc/myoracle" auth = "Container" type= "javax.sql.DataSource" driverClass...

Prime, Fibonacci and Factorial number with example in java

Prime number, Fibonacci series and Factorial number programs are most commonly asked questions in interview. Read this article to know what is and how to write programs for prime number, fibonacci series and factorial number. Prime Number: prime number is natural number greater than 1 that has no positive divisor other than 1 and itself. A natural number greater than 1 is not a prime number, is called Composite number . For example, 7 is a prime number. Because it can divide with 1 and 7 only. Where as 8 is composite number. Since it has the divisor 2 and 4 in addition to the 1 and 8. The below example represents the finding the passing number is prime number or not. If the passing number is prime number it will print true otherwise it will print false. package com . javatbrains . practice ; public class PrimeNumber { public boolean isPrimeNumber ( int number ) { if ( number <= 1 ) return false ; // There's only one ...

JVM, JRE and JDK in Java

JVM, JRE and JDK are the most basic common concepts to know in java. These are the basic features to understand how Java architecture works? JVM stands for Java Virtual Machine, which doesn't have any physical directories created in java installation. JRE stands for Java Runtime Environment, which creates the directory under Java installation path and also present in JDK. JDK stands for Java Development Kit, which creates the directory in Java installation path and also it has it's own JRE. Since we have already learn that Java is platform independent means if we have implemented any of the java class in one environment, it will be executed in any other environment and provides the same output. But, JVM, JRE and JDK all are platform dependent . So that, for windows, linux, unix, mac, solaris..etc has it's own JVM, JRE and JDK. One will be not compatible with other environments. While installing the Java, we might come to know a bit about JRE and JDK. But, JVM is the other...