Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 1544 with 24 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 1544 # by problem number
lcpy gen -s make_the_string_great # by problem name
s of lower and upper case English letters.
A good string is a string which doesn’t have two adjacent characters s[i] and s[i + 1] where:
0 <= i <= s.length - 2s[i] is a lower-case letter and s[i + 1] is the same letter but in upper-case or vice-versa.Input: s = "leEeetcode"
Output: "leetcode"
Input: s = "abBAcC"
Output: ""
Input: s = "s"
Output: "s"
1 <= s.length <= 100s contains only lower and upper case English letters.class Solution:
# Time: O(n)
# Space: O(n)
def make_good(self, s: str) -> str:
stack: list[str] = []
for ch in s:
if stack and stack[-1].lower() == ch.lower() and stack[-1] != ch:
stack.pop()
else:
stack.append(ch)
return "".join(stack)
| Time | Space |
|---|---|
| O(n) | O(n) |