We use cookies (including Google cookies) to personalize ads and analyze traffic. By continuing to use our site, you accept our Privacy Policy.

SimplyLeet
TagsDisclaimersPrivacyTermsContactAbout Us

Detect Capital

Difficulty: Easy

Problem Description

Given a string word, return true if the usage of capitals in it is right. The usage of capitals is right if one of the following cases holds:

  1. All letters in this word are capitals, like "USA".
  2. All letters in this word are not capitals, like "leetcode".
  3. Only the first letter in this word is capital, like "Google".

Key Insights

  • The word can be validated based on three conditions regarding the capitalization of letters.
  • We can check the capitalization using string methods available in most programming languages.
  • The solution should iterate through the string to determine which case the word fits into.

Space and Time Complexity

Time Complexity: O(n) where n is the length of the word (we may need to traverse the entire string). Space Complexity: O(1) since we are using a constant amount of extra space.

Solution

To solve the problem, we can use a simple approach:

  1. Check if all characters are uppercase using a built-in function.
  2. Check if all characters are lowercase using a built-in function.
  3. Check if only the first character is uppercase and the rest are lowercase. We can use string comparisons and methods provided by the programming language to achieve this.

Code Solutions

def detectCapitalUse(word: str) -> bool:
    # Check if all characters are uppercase
    if word.isupper():
        return True
    # Check if all characters are lowercase
    elif word.islower():
        return True
    # Check if only the first character is uppercase and the rest are lowercase
    elif word[0].isupper() and word[1:].islower():
        return True
    # If none of the conditions are satisfied, return False
    return False
← Back to All Questions