Tap here to switch tabs
Problem
Submissions

Problem: Custom Sort String

Custom Sort String gives a preferred character order and a second string. Return any permutation that keeps ordered characters in relative order, while other characters may appear anywhere.

Statement

Given two strings, order and s, where all characters in order are unique and arranged in a custom order, return any permutation of s that satisfies the following condition:

The characters in the permuted s should appear in the same relative order as they do in order. Specifically, if a character x appears before a character y in order, then x must also appear before y in the permuted string.

Constraints:

  • 1≤1 \leq order.length ≤26\leq 26

  • 1≤1 \leq s.length ≤200\leq 200

  • order and s consist of lowercase English letters.

  • All the characters of order are unique.

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Custom Sort String

Custom Sort String gives a preferred character order and a second string. Return any permutation that keeps ordered characters in relative order, while other characters may appear anywhere.

Statement

Given two strings, order and s, where all characters in order are unique and arranged in a custom order, return any permutation of s that satisfies the following condition:

The characters in the permuted s should appear in the same relative order as they do in order. Specifically, if a character x appears before a character y in order, then x must also appear before y in the permuted string.

Constraints:

  • 1≤1 \leq order.length ≤26\leq 26

  • 1≤1 \leq s.length ≤200\leq 200

  • order and s consist of lowercase English letters.

  • All the characters of order are unique.