Write a method called collapse that accepts a stack of integers as a parameter and that collapses it by replacing each successive pair of integers with the sum of the pair. For example, if the stack stores [7, 2, 8, 9, 4, 11, 7, 1, 42], the first pair should be collapsed into 9 (7 + 2), the second pair should be collapsed into 17 (8 + 9), and so on. If the stack stores an odd number of elements, such as the 42 at the end of our example stack, the final element is not collapsed. So for this stack your method would yield [9, 17, 15, 8, 42]. Use one queue as auxiliary storage.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.