# 2351. First Letter to Appear Twice

## Description

Given a string s consisting of lowercase English letters, return the first letter to appear twice.

Note:

• A letter a appears twice before another letter b if the second occurrence of a is before the second occurrence of b.
• s will contain at least one letter that appears twice.

Example 1:

Input: s = "abccbaacz"
Output: "c"
Explanation:
The letter 'a' appears on the indexes 0, 5 and 6.
The letter 'b' appears on the indexes 1 and 4.
The letter 'c' appears on the indexes 2, 3 and 7.
The letter 'z' appears on the index 8.
The letter 'c' is the first letter to appear twice, because out of all the letters the index of its second occurrence is the smallest.

Example 2:

Input: s = "abcdd"
Output: "d"
Explanation:
The only letter that appears twice is 'd' so we return 'd'.

Constraints:

• 2 <= s.length <= 100
• s consists of lowercase English letters.
• s has at least one repeated letter.

## Solutions

• class Solution {
public char repeatedCharacter(String s) {
int[] cnt = new int[26];
for (int i = 0;; ++i) {
char c = s.charAt(i);
if (++cnt[c - 'a'] == 2) {
return c;
}
}
}
}

• class Solution {
public:
char repeatedCharacter(string s) {
int cnt[26]{};
for (int i = 0;; ++i) {
if (++cnt[s[i] - 'a'] == 2) {
return s[i];
}
}
}
};

• class Solution:
def repeatedCharacter(self, s: str) -> str:
cnt = Counter()
for c in s:
cnt[c] += 1
if cnt[c] == 2:
return c

• func repeatedCharacter(s string) byte {
cnt := [26]int{}
for i := 0; ; i++ {
cnt[s[i]-'a']++
if cnt[s[i]-'a'] == 2 {
return s[i]
}
}
}

• function repeatedCharacter(s: string): string {
const vis = new Array(26).fill(false);
for (const c of s) {
const i = c.charCodeAt(0) - 'a'.charCodeAt(0);
if (vis[i]) {
return c;
}
vis[i] = true;
}
return ' ';
}

• class Solution {
/**
* @param String $s * @return String */ function repeatedCharacter($s) {
for ($i = 0; ;$i++) {
$hashtable[$s[$i]] += 1; if ($hashtable[$s[$i]] == 2) {
return $s[$i];
}
}
}
}

• impl Solution {
pub fn repeated_character(s: String) -> char {
let mut vis = [false; 26];
for &c in s.as_bytes() {
if vis[(c - b'a') as usize] {
return c as char;
}
vis[(c - b'a') as usize] = true;
}
' '
}
}