3668. Restore Finishing Order

LeetCodeArrayHash TableOpen on judge ↗

You are given an integer array order of length n and an integer array friends. - order contains every integer from 1 to n exactly once, representing the IDs of the participants of a race in their finishing order. - friends contains the IDs of your friends in the race sorted in strictly increasing order. Each ID in friends is guaranteed to appear in the order array. Return an array containing yo

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI