You are given an array restaurants where restaurants[i] = [id_i, rating_i, veganFriendly_i, price_i, distance_i]. You are also given the filtering criteria veganFriendly, maxPrice, and maxDistance.

Filter the restaurants based on the following conditions:

• If veganFriendly equals $1$, only select restaurants where veganFriendly_i equals $1$. If veganFriendly equals $0$, select restaurants regardless of their veganFriendly_i value.

• Only select restaurants where price_i \leq maxPrice.

• Only select restaurants where distance_i \leq maxDistance.

Return the list of id values of the filtered restaurants, sorted by rating in descending order. If multiple restaurants share the same rating, sort them by id in descending order.

Constraints:

• $1 \leq$ restaurants.length $\leq 10^4$

• restaurants[i].length $= 5$

• $1 \leq$ id_i, rating_i, price_i, distance_i $\leq 10^5$

• $1 \leq$ maxPrice, maxDistance $\leq 10^5$

• veganFriendly_i and veganFriendly are either $0$ or $1$.

• All id_i are distinct.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.