You are given two integers memory1 and memory2 representing the initial available memory in two memory sticks.

Starting at second $1$, memory is allocated every second as follows:

• At second $i$, $i$ bits of memory are allocated from the stick that currently has more available memory.

• If both sticks have an equal amount of available memory, the memory is allocated from the first stick memory1.

If neither memory stick has at least $i$ bits of available memory at second $i$, the program crashes immediately.

Return an array containing three integers: [crashTime, memory1Left, memory2Left], representing the exact second at which the program crashes, along with the remaining available memory in memory1 and memory2 respectively.

Constraints:

• $0 \le$ memory1, memory2 $\le 2^{31} - 1$

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.