Java Program To Find First Non Repeated Character | Java | Ashok IT

✍️✍️ Register Here For Online Training : bit.ly/4dBYJbX
** For Online Training ► Call: [phone]
Subscribe to our channel and hit the bell 🔔🔔🔔 icon to get video updates.
💡 Visit Our Website
For Online Training: www.ashokit.in
💡 About Ashok IT :
Ashok IT is the No.1 quality training institute in India for the candidates who want to build their future in Information Technology. We are into online training, class room training, corporate training and one to one training with more passion and dedication. Ashok IT aims in providing best quality realtime oriented trainings on C, C++, Java, Spring , Spring REST, Spring Cloud, Microservices, Python, DJango, .Net, Angular, React JS, Salesforce, , Testing, Android, Docker, Kubernates, Manual Testing, Selenium and Digital Marketing.
-----------------------------------------------------------------------------------
💡 Our Online Training Features
🎈 Training with Real-time Working Professionals
🎈 Industry Matching use cases
🎈 Live Coding
🎈 Real-time Environment
🎈 Class Notes
🎈 Doubts Clarifications in Each Session
-----------------------------------------------------------------------------------
💡 Contact details:
☎ WhatsApp Number: [phone]
► Website : www.ashokit.in
► Join with us in Telegram : bit.ly/3iP2KyA
► Like us in Facebook : bit.ly/3dw6R0A
► Follow us in Instagram : bit.ly/3jzEKl8
► Follow us in Twitter : bit.ly/2SDqdK4

[@ashokit]

🔥 Welcome to Ashok IT..!!
👉 Register Here For Online Training : bit.ly/4dBYJbX
👉 Follow us in Instagram : bit.ly/3jzEKl8
👉 Follow Us in WhatsApp : bit.ly/49wCWje
👉 Visit Our Website : ashokit.in/

[@rptech6902]

public class practicee {
public static void main(String args[])
{
String s="AABCDBE";
int count=0;
char[] k =s.toCharArray();
for (int i = 0; i < k.length; i++) {
for (int j = 0; j < k.length; j++) {
if (k[i]==k[j]) {
count++;
}

}
if (count==1) {
System.out.println(k[i]);
break;
}
count=0;
}
}
}
this is my approach

[@dipikasharma748]

Shouldn't the map be LinkedHashMap so that it maintains the insertion order to correctly identify first non-repeated character?

[@mishra1576]

Yes it should be😊

[@YashSingh-xs5yj]

Collection approach is the best ❤

[@Ravikumar-gj6qw]

Ur way of explaining or teaching is excellent 👌😉bro superb 👌👍👏, nobody is there ...

[@jatinsharma3792]

In hashMap the insertion order is not maintain, how can you be sure it will give your the First Non Repeated Char boss ????

[@ashokit]

please contact our admin team : [phone]

[@ram8705]

My approach :
String unique = "AABDCE";
for (int i = 0; i < unique.length(); i++) {
for (int j = i+1; j < unique.length(); j++) {
if(unique.charAt(i) != unique.charAt(j)) {
System.out.println("1st non repeating char is : "+unique.charAt(j));
return;
}
}
}

[@DanishAli-ql1es]

Very nice explanation

[@ashokit]

Thanks for liking

[@rajeevkalangi2472]

Thanks Bro. Your explanation is super cool.

[@jagadeeshbaskaran4881]

Excellent . Thanks sir

[@kameshwaran6689]

Really superb

[@kkiran-zk8ed]

You can use j=i+1

[@alokkumar-pl6ds]

same doubt

[@krishkhemani96]

I don't think j=i+1 would work because in that case first iteration A and A would be compared in second iteration A and b would be compared and thus compiler would declare A as the first non repeating character.I am also not sure.

[@garvitrangi3263]

@@krishkhemani96 if we take j = i+1 then it will consider the last duplicate character as the first non-repeating character for eg It will consider 'A' of index 1 as a non-repeating character.

[@moumajhi23]

using this collection approach it won't give correct output , if the non repeated occurs at the first position , for example input = "kaabcdbe" output should be k but it would give c.

[@Ravikumar-gj6qw]

Tq Ashok bro

[@ganeshbodduaddasuryanitinb7811]

Using index Of method?

[@DILEEPKUMAR-gp7ic]

It is coming last non repeated char we need first non repeated characters

[@DILEEPKUMAR-gp7ic]

Could u correct the code thro hashmap

[@hchemlal]

Your coding still needs some polishing, first approach you should have used j=i+1 and the second approach you should have used LinkedHashMap.

[@anbuv.g.k495]

Yeass bro and the hashmap does not maintain insertion order right? How he got the answer bro..!

[@hchemlal]

@@anbuv.g.k495 It will work 90% of the time, but in production setting you'll face reality.

[@krishkhemani96]

I don't think j=i+1 would work because in that case first iteration A and A would be compared in second iteration A and b would be compared and thus compiler would declare A as the first non repeating character.I am also not sure.