Leetcode - Custom Sort String Solution
1 min read

Leetcode - Custom Sort String Solution

S and T are strings composed of lowercase letters. In S, no letter occurs more than once.

S was sorted in some custom order previously. We want to permute the characters of T so that they match the order that S was sorted. More specifically, if x occurs before y in S, then x should occur before y in the returned string.

Return any permutation of T (as a string) that satisfies this property.

Example :

S = "cba"
T = "abcd"
Output: "cbad"
"a", "b", "c" appear in S, so the order of "a", "b", "c" should be "c", "b", and "a". 
Since "d" does not appear in S, it can be at any position in T. "dcba", "cdba", "cbda" are also valid outputs.


  • S has length at most 26, and no character is repeated in S.
  • T has length at most 200.
  • S and T consist of lowercase letters only.

Solution in Python

from collections import Counter
class Solution:
    def customSortString(self, S: str, T: str) -> str:
        S_COUNT = Counter(S)
        T_COUNT = Counter(T)
        PREFIX = ""
        SUFFIX = ""
        for i in S:
            if i in T:
                PREFIX+= i*T_COUNT[i]
                del T_COUNT[i]
        for i in T_COUNT:
            SUFFIX+= i*T_COUNT[i]
        return PREFIX+SUFFIX

Enjoying these posts? Subscribe for more

Adblocker detected! Please consider reading this notice.

We've detected that you are using AdBlock Plus or some other adblocking software which is preventing the page from fully loading.

That's okay. But without advertising-income, we can't keep making this site awesome.

We don't have any banner, Flash, animation, obnoxious sound, or popup ad. We do not implement these annoying types of ads!

We need money to operate the site, and almost all of it comes from our online advertising.

Please add thepoorcoder.com to your ad blocking whitelist or disable your adblocking software.