We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 43aabe3 commit 605789bCopy full SHA for 605789b
problem11.java
@@ -0,0 +1,43 @@
1
+/**
2
+SOlved by Mohammed Azarudeen K, CSE
3
+*/
4
+
5
+import java.io.*;
6
7
+import java.util.*;
8
9
+public class FindFirstNonRepeatedCharacter {
10
11
+public static void main(String[] args) {
12
13
+char name[] = "repeated".toCharArray();
14
15
+for (int i = 0; i < name.length; i++) {
16
17
+boolean uniqueChar = true;
18
19
+for (int j = 0; j < name.length; j++) {
20
21
+if (i != j && name[i] == name[j]) {
22
23
+uniqueChar = false;
24
25
+break;
26
27
+}
28
29
30
31
+if (uniqueChar) {
32
33
+System.out.println(name[i]);
34
35
36
37
38
39
40
41
42
43
0 commit comments