So, I have trouble understanding and solving the following question:
You are given a 2D array. Design an algorithm that, given two coordinates (each with two indexes ofc), returns the minimum in the rectangle between those coordinates. You know that the number of lines in that rectangle (of each query) is greater than $\frac{n}{3}$. Preparation time should be $O(n^2)$ and query time should be $O(1)$.
Thanks in advance.