Find the first non repeating character in a string | String Algorithms

In this video we will find the first non repeating character in a string. we will use a hash-map to store the frequency of every character in the string and then we will try to traverse the string from front and check the character whose frequency is 1. The first character that which has a frequency of 1 is the the first non repeating character

[@raghuvarun5941]

Bro, can you please explain some important programs given in w3resource Java exercises...the way you are explaining is exceptional

[@pratapjavasingh3239]

Boss upload the video regarding the ds and algorithms that's the enough for product based company

[@muaazkhan6156]

Additional Knowledge: 1. while printing remove break; from last if then u will get all the unique character in String. 2. if u use > 1 instead of == the u will get all the dublicated character.

[@asmitabarman7404]

if i write if(currentFreq!=1) will i get the first repeating charechter?

[@AMANSINGH-yv4vv]

same question for me

[@NaryVip]

Better keep that condition as >1 , So you will get the first repeating char.

[@sai3327]

Can you clarify what is the advantage of your way to solving the issue? VS this public static void main(String[] args) { char c = getFirstNonRepeatedChar("aabbddeeff"); System.out.println("Non Repeated Character="+c); } public static char getFirstNonRepeatedChar(String str) { Map countMap = new LinkedHashMap(str.length()); for (char ch : str.toCharArray()) { countMap.put(ch, countMap.containsKey(ch) ? countMap.get(ch)+1:1); } for (Entry entry : countMap.entrySet()) { if (entry.getValue()==1) { //return entry.getKey(); break; } } throw new RuntimeException("didnt find any non repeated Character");