EasyNo. 0709

To Lower Case — LeetCode 709 Python Solution

Pattern
Hash Map
Topics
String
Reading time
2 min

The problem

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

Example

Input
s = "Hello"
Output
"hello"

Python solution

PythonSolution
class Solution:
    def toLowerCase(self, s: str) -> str:
        return "".join([chr(ord(c) | 32) if c.isupper() else c for c in s])

Complexity

Time
O(n)
Space · auxiliary
O(1) to O(n)

Pattern: Hash Map

Trade memory for time: remember what you have seen so the second pass never happens. LeetCode 709. To Lower Case 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

Related problems
No.ProblemDifficulty
0006Zigzag ConversionMedium
0008String to Integer (atoi)Medium
0038Count and SayMedium
0058Length of Last WordEasy
0065Valid NumberHard
0068Text JustificationHard

Frequently asked questions

How hard is LeetCode 709. To Lower Case?

LeetCode 709. To Lower Case is rated Easy on LeetCode.

What topics does LeetCode 709. To Lower Case cover?

LeetCode 709. To Lower Case is tagged String on LeetCode.

Stuck on problems like this in a live interview?

Stealth Interview is a desktop app for macOS and Windows. It reads the problem off your screen and returns a working solution with a step-by-step explanation and its time and space complexity, invisible to screen sharing.

Free to download. Check it runs on your machine, then pick a plan.