4008. Restore Finishing Order
My accepted Python solution to LeetCode problem 4008, Restore Finishing Order, running in 0ms.
- Difficulty: Easy
- Python
- Runtime 0ms
- Memory 17.4MB
- Updated
Read the problem on LeetCode View on GitHub
The problem statement is LeetCode’s and stays on their site. What follows is my accepted solution.
Python
Accepted on LeetCode — runtime 0ms, memory 17.4MB, accepted 2025-12-30.
class Solution:
def recoverOrder(self, order: List[int], friends: List[int]) -> List[int]:
s = set(friends)
return [x for x in order if x in s]