3121. Count the Number of Special Characters II
Read the full problem statement on LeetCode.
Difficulty: medium Acceptance: 42% Topics: Hash Table, String
View full problem on LeetCode Reading material
Reference solution (spoiler · python)
# Time: O(n + 26)
# Space: O(26)
import itertools
# hash table
class Solution(object):
def numberOfSpecialChars(self, word):
"""
:type word: str
:rtype: int
"""
lookup1 = [len(word)]*26
lookup2 = [-1]*26
for i, x in enumerate(word):
if x.islower():
lookup1[ord(x)-ord('a')] = i
elif lookup2[ord(x)-ord('A')] == -1:
lookup2[ord(x)-ord('A')] = i
return sum(x < y for x, y in itertools.izip(lookup1, lookup2))
Solution from kamyu104/LeetCode-Solutions · MIT