You are given a basket that can carry a maximum weight of $5000$ units and an integer array weight where each element represents the weight of an apple.

Return the maximum number of apples you can place into the basket such that their total weight does not exceed $5000$.

Constraints:

• $1 \leq$ weight.length $\leq 10^3$

• $1 \leq$ weight[i] $\leq 10^3$

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.