Leetcode - Reverse Only Letters Solution — The Poor Coder

Given a string S, return the "reversed" string where all characters that are not a letter stay in the same place, and all letters reverse their positions.

Example 1:

Text

Input: "ab-cd"
Output: "dc-ba"

Example 2:

Text

Input: "a-bC-dEf-ghIj"
Output: "j-Ih-gfE-dCba"

Example 3:

Text

Input: "Test1ng-Leet=code-Q!"
Output: "Qedo1ct-eeLg=ntse-T!"

Note:

S.length <= 100
33 <= S[i].ASCIIcode <= 122
S doesn't contain \ or "

Solution in Python#

Python

class Solution(object):
    def reverseOnlyLetters(self, S):
        letters = [c for c in S if c.isalpha()]
        ans = []
        for c in S:
            if c.isalpha():
                ans.append(letters.pop())
            else:
                ans.append(c)
        return "".join(ans)

May 112021

Leetcode - Camelcase Matching Solution

A query word matches a given pattern if we can insert lowercase letters to the pattern word so that it equals the query. (We may insert each character at any position, and may insert 0 characters.) Given a list of…

leetcode string trie2 min read

May 112021

Leetcode - Determine if String Halves Are Alike Solution

You are given a string s of even length. Split this string into two halves of equal lengths, and let a be the first half and b be the second half. Two strings are alike if they have the same number of vowels ('a', 'e'…

leetcode string1 min read

May 112021

Leetcode - Count the Number of Consistent Strings Solution

You are given a string allowed consisting of distinct characters and an array of strings words. A string is consistent if all characters in the string appear in the string allowed. Return the number of consistent…

leetcode string1 min read

Solution in Python#

Related posts

Leetcode - Camelcase Matching Solution

Leetcode - Determine if String Halves Are Alike Solution

Leetcode - Count the Number of Consistent Strings Solution