techInterview Discussion

A computer program places N equilateral triangles of the same size randomly on the screen.
You observe that you can cover any of these triangles by moving the other triangles without rotating.
If this observation holds true for any configuration, what is the minimum possible value of N?

Could you provide an example of the problem?
I don't understand the meaning of "cover".

it's like one triangle is dragged and put over the other to cover it