Skip to content

Commit a08df91

Browse files
solves #2351: First Letter to Appear Twice in java
1 parent bd38977 commit a08df91

File tree

2 files changed

+20
-1
lines changed

2 files changed

+20
-1
lines changed

README.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -754,7 +754,7 @@
754754
| 2341 | [Maximum Number of Pairs in Array](https://leetcode.com/problems/maximum-number-of-pairs-in-array) | [![Java](assets/java.png)](src/MaximumNumberOfPairsInArray.java) | |
755755
| 2347 | [Best Poker Hand](https://leetcode.com/problems/best-poker-hand) | [![Java](assets/java.png)](src/BestPokerHand.java) | |
756756
| 2348 | [Number of Zero-Filled Subarrays](https://leetcode.com/problems/number-of-zero-filled-subarrays) | [![Python](assets/python.png)](python/number_of_zero_filled_subarrays.py) | |
757-
| 2351 | [First Letter to Appear Twice](https://leetcode.com/problems/first-letter-to-appear-twice) | | |
757+
| 2351 | [First Letter to Appear Twice](https://leetcode.com/problems/first-letter-to-appear-twice) | [![Java](assets/java.png)](src/FirstLetterToAppearTwice.java) | |
758758
| 2357 | [Make Array Zero by Subtracting Equal Amounts](https://leetcode.com/problems/make-array-zero-by-subtracting-equal-amounts) | | |
759759
| 2360 | [Longest Cycle in a Graph](https://leetcode.com/problems/longest-cycle-in-a-graph) | [![Python](assets/python.png)](python/longest_cycle_in_graph.py) | |
760760
| 2363 | [Merge Similar Items](https://leetcode.com/problems/merge-similar-items) | | |

src/FirstLetterToAppearTwice.java

+19
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,19 @@
1+
// https://leetcode.com/problems/first-letter-to-appear-twice
2+
// T: O(1)
3+
// S: O(1)
4+
5+
import java.util.HashSet;
6+
import java.util.Set;
7+
8+
public class FirstLetterToAppearTwice {
9+
public char repeatedCharacter(String s) {
10+
final Set<Character> characters = new HashSet<>();
11+
for (int index = 0 ; index < s.length() ; index++) {
12+
if (characters.contains(s.charAt(index))) {
13+
return s.charAt(index);
14+
}
15+
characters.add(s.charAt(index));
16+
}
17+
return 'a';
18+
}
19+
}

0 commit comments

Comments
 (0)