Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
27 lines (20 loc) · 753 Bytes

File metadata and controls

27 lines (20 loc) · 753 Bytes
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
import java.util.HashMap;
public class Program128 {
//First Non-Repeating Character in a String (Using HashMap)
public static void main(String[] args) {
String s = "aabbcdde";
HashMap<Character, Integer> freq = new HashMap<>();
// Count frequency of each character
for (char c : s.toCharArray()) {
freq.put(c, freq.getOrDefault(c, 0) + 1);
}
// Find the first character with frequency = 1
for (char c : s.toCharArray()) {
if (freq.get(c) == 1) {
System.out.println("First non-repeating character: " + c);
return;
}
}
System.out.println("No unique character found.");
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.