restore-finishing-order

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

You are given an integer array <code>order</code> of length <code>n</code> and an integer array <code>friends</code>.

<ul>
	<li><code>order</code> contains every integer from 1 to <code>n</code> exactly once, representing the IDs of the participants of a race in their finishing order.</li>
	<li><code>friends</code> contains the IDs of your friends in the race sorted in strictly increasing order. Each ID in friends is guaranteed to appear in the <code>order</code> array.</li>
</ul>

Return an array containing your friends&#39; IDs in their finishing order.

&nbsp;
Example 1:

<div class="example-block">
Input: order = [3,1,2,5,4], friends = [1,3,4]

Output: [3,1,4]

Explanation:

The finishing order is <code>[3, 1, 2, 5, 4]</code>. Therefore, the finishing order of your friends is <code>[3, 1, 4]</code>.
</div>

Example 2:

<div class="example-block">
Input: order = [1,4,5,3,2], friends = [2,5]

Output: [5,2]

Explanation:

The finishing order is <code>[1, 4, 5, 3, 2]</code>. Therefore, the finishing order of your friends is <code>[5, 2]</code>.
</div>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= n == order.length &lt;= 100</code></li>
	<li><code>order</code> contains every integer from 1 to <code>n</code> exactly once</li>
	<li><code>1 &lt;= friends.length &lt;= min(8, n)</code></li>
	<li><code>1 &lt;= friends[i] &lt;= n</code></li>
	<li><code>friends</code> is strictly increasing</li>
</ul>