You are given an integer array transactions representing a sequence of financial transactions.

You start with an initial balance of $0$ and process the transactions in the given order from left to right. You can choose to accept or skip each transaction. Whenever you accept a transaction, its value is added to your current balance. Your balance must never become negative at any point after accepting a transaction.

Return the maximum number of transactions you can accept.

Constraints:

• $1 \leq$ transactions.length $\leq 10^5$

• $-10^9 \leq$ transactions[i] $\leq 10^9$

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.