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

To Lower Case

Difficulty: Easy

Problem Description

Given a string s, return the string after replacing every uppercase letter with the same lowercase letter.

Key Insights

  • The task requires transforming uppercase letters in a string to their lowercase equivalents.
  • Strings in many programming languages provide built-in methods for case conversion.
  • The problem can be efficiently solved using iteration or string manipulation functions.

Space and Time Complexity

Time Complexity: O(n), where n is the length of the string. Space Complexity: O(n), as a new string may be created to hold the result.

Solution

To solve this problem, we can use a straightforward approach by iterating through each character of the input string, checking if it is uppercase, and converting it to lowercase if necessary. Most programming languages provide functions or methods to handle this conversion efficiently.

Code Solutions

def to_lower_case(s: str) -> str:
    # Initialize an empty result string
    result = ""
    # Iterate through each character in the input string
    for char in s:
        # Convert to lowercase if the character is uppercase
        if 'A' <= char <= 'Z':
            result += chr(ord(char) + 32)  # Convert to lowercase
        else:
            result += char  # Keep the character as is
    return result
← Back to All Questions