4-64ff3adb125f84b1.js","269","static/chunks/269-5f9235f83b944543.js","222","static/chunks/222-e37d1f81e0d6d2ef.js","934","static/chunks/app/cs/problems/%5Bslug%5D/page-935d3f20891d8cfc.js"],"default"] 18:I[2647,["874","static/chunks/874-64ff3adb125f84b1.js","269","static/chunks/269-5f9235f83b944543.js","222","static/chunks/222-e37d1f81e0d6d2ef.js","934","static/chunks/app/cs/problems/%5Bslug%5D/page-935d3f20891d8cfc.js"],"default"] 1a:I[7912,["874","static/chunks/874-64ff3adb125f84b1.js","269","static/chunks/269-5f9235f83b944543.js","222","static/chunks/222-e37d1f81e0d6d2ef.js","934","static/chunks/app/cs/problems/%5Bslug%5D/page-935d3f20891d8cfc.js"],"default"] 19:Tc1e,

Problem

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.

Examples

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'.

Solution

Method 1 – Hash Set for First Repeated Letter

Intuition

We need to find the first letter that appears twice in the string. By iterating through the string and keeping track of seen letters in a hash set, we can immediately return the first letter that is already in the set.

Approach

Initialize an empty set to store seen letters.
Iterate through each character in s:
- If the character is already in the set, return it.
- Otherwise, add it to the set.
The problem guarantees there is at least one repeated letter, so we will always find an answer.

Complexity

⏰ Time complexity: O(n), where n is the length of s, since we process each character once.
🧺 Space complexity: O(1), since the set can contain at most 26 letters.

Code

[{"language":"Java","code":"class Solution {\n    public char repeatedCharacter(String s) {\n        Set<Character> seen = new HashSet<>();\n        for (char c : s.toCharArray()) {\n            if (seen.contains(c)) return c;\n            seen.add(c);\n        }\n        return 'a'; // guaranteed to find a repeated character\n    }\n}","lang":"java"},{"language":"C++","code":"class Solution {\npublic:\n    char repeatedCharacter(string s) {\n        unordered_set<char> seen;\n        for (char c : s) {\n            if (seen.count(c)) return c;\n            seen.insert(c);\n        }\n        return 'a'; // guaranteed to find a repeated character\n    }\n};","lang":"cpp"},{"language":"Python","code":"class Solution:\n    def repeatedCharacter(self, s: str) -> str:\n        seen = set()\n        for c in s:\n            if c in seen:\n                return c\n            seen.add(c)","lang":"python"}]

8:["$","div",null,{"className":"max-w-7xl mx-auto px-4 py-8","children":[["$","header",null,{"className":"mb-8 pb-4","children":[["$","div",null,{"className":"flex flex-wrap items-start justify-between gap-4","children":[["$","h1",null,{"className":"text-4xl font-bold text-gray-900 dark:text-gray-100","children":"

Related Tags