Custom Sort String
Try to solve the Custom Sort String problem.
We'll cover the following
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:
order.length
s.length
order
 andÂs
 consist of lowercase English letters.All the characters ofÂ
order
 are unique.
Examples
Level up your interview prep. Join Educative to access 80+ hands-on prep courses.