I had two technical interviews. I passed the first one, but I didn't pass the second.

First, they explained the position and the company. Then, they asked algorithmic questions.

I solved the first question quickly. I don't remember the second question, but it was very difficult.

Given an array height containing integers, where each integer represents the height of a vertical line, we want to determine the maximum amount of water that can be trapped between any two of these vertical lines and the x-axis.

To do this, we need to find two vertical lines that, along with the x-axis, form a container holding the maximum amount of water.