Given a string s
consisting of lowercase English letters, return the first letter to appear twice.
Note:
- A letter
a
appears twice before another letterb
if the second occurrence ofa
is before the second occurrence ofb
. s
will contain at least one letter that appears twice.
First Letter to Appear Twice LeetCode Contest
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.
Solution
class Solution {
public:
char repeatedCharacter(string s) {
vector<bool> v(26);
for(char c:s){
if(v[c-'a'])return c;
v[c-'a']=true;
}
return 'a';
}
};
class Solution:
def repeatedCharacter(self, s: str) -> str:
occurences = defaultdict(int)
for char in s:
occurences[char] += 1
if occurences[char] == 2:
return char
class Solution {
public char repeatedCharacter(String s) {
Set<Character> seen = new HashSet<>();
for(int i = 0; i < s.length(); i++){
if(seen.contains(s.charAt(i))){
return s.charAt(i);
}
seen.add(s.charAt(i));
}
return '#';
}
}
Happy Learning – If you require any further information, feel free to contact me.