There are $n$ ice cream bars available in a store. You are given an integer array costs of length $n$, where costs[i] denotes the price of the ice cream bar at index i. You are also given an integer coins representing the initial number of coins you possess.

Return the maximum number of ice cream bars you can purchase with coins coins.

Note: The ice cream bars can be purchased in any order.

Constraints:

• costs.length $== n$

• $1 \leq n \leq 10^5$

• $1 \leq$ costs[i] $\leq 10^5$

• $1 \leq$ coins $\leq 10^8$

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.