Easy
Restore Finishing Order — Python
Full explanation · Time O(n + min(8, n)) · Space O(min(8, n))
# Time: O(n + min(8, n))
# Space: O(min(8, n))
# hash table
class Solution(object):
def recoverOrder(self, order, friends):
"""
:type order: List[int]
:type friends: List[int]
:rtype: List[int]
"""
lookup = set(friends)
return [x for x in order if x in lookup]