Detect Capital — LeetCode 520 Python Solution
EasyString
- Problem
- #520
- Pattern
- Hash Map
- Reading time
- 2 min
- Source
- leetcode.com
The problem
We define the usage of capitals in a word to be right when one of the following cases holds: All letters in this word are capitals, like "USA". All letters in this word are not capitals, like "leetcode".
Example
- Input
- word = "USA"
- Output
- true
Python solution
Python
class Solution:
def detectCapitalUse(self, word: str) -> bool:
cnt = sum(c.isupper() for c in word)
return cnt == 0 or cnt == len(word) or (cnt == 1 and word[0].isupper())Complexity
| Measure | Complexity |
|---|---|
| Time | O(n), where n is the length of the string `word` |
| Space | O(1) auxiliary |
Pattern: Hash Map
Trade memory for time: remember what you have seen so the second pass never happens. LeetCode 520. Detect Capital is filed here because the reference solution below belongs to the algorithm family this hub collects, even though its LeetCode tags point elsewhere.
The hash map guide has the Python template for the pattern and the 709 LeetCode problems that use it.
Related problems
Frequently asked questions
- How hard is LeetCode 520. Detect Capital?
- LeetCode 520. Detect Capital is rated Easy on LeetCode.
- What is the time complexity of LeetCode 520. Detect Capital?
- The Python solution on this page runs in O(n), where n is the length of the string `word`.
- What is the space complexity of LeetCode 520. Detect Capital?
- The Python solution on this page uses O(1) auxiliary space.
- What topics does LeetCode 520. Detect Capital cover?
- LeetCode 520. Detect Capital is tagged String on LeetCode.