Relative Sort Array at DE Shaw
Easy75.1% acceptance
This problem has 75.0% frequency at DE Shaw.
Problem Description
Given two arrays `arr1` and `arr2`, the elements of `arr2` are distinct, and all elements in `arr2` are also in `arr1`. Sort the elements of `arr1` such that the relative ordering of items in `arr1` are the same as in `arr2`. Elements that do not appear in `arr2` should be placed at the end of `arr...
Read full problem and hintsTopics
Also asked at 5 companies
More DE Shaw Questions
Find Minimum Cost to Remove Array ElementsMediumLetter Combinations of a Phone NumberMediumMaximum Points After Collecting Coins From All NodesHardMaximum Strength of K Disjoint SubarraysHardRemoving Minimum Number of Magic BeansMedium
View all DE Shaw questions