Grand Temple- Sorting challenges

Hello sir/ma’am,
i am unable to understand this question. What is the size of the 2d array that we have to consider? and how the answer in the sample test case coming 2?

@priyanshi.agarwal3405 This ques is based on greedy approach. All we need to do is just store all the X and Y coordinates and then sort them. Then we will calculate maximum ΔX and ΔY where ΔX = (Xi -Xi-1) & ΔY = (Yi -Yi-1). Then the area will be (ΔY-1)*(ΔX-1).

We have to find the maximum area of land(so we exclude the rivers).
Clearly the maximum area would be between the intersection points of (2,4) and (5,2) for the given sample testcase.

Area = | 5 - 2 - 1 | * | 2 - 4 - 1| = 2 * 1 = 2

We implement the formula ,
Area = abs( y2 - y1 - 1) * abs( x2 - x1 - 1)//take abs as area cant be negative

We add an extra -1 in our calculation since we should consider the river area. If we simply implement (y2 - y1) or (x2 - x1) then we would end up counting 1 edge of the vertical river and 1 edge of the horizontal river. We should not include that area as the temple cannot be built over the river edge.

Hope this helps :slightly_smiling_face:

Umm…Sir i requested you to just explain me the question…not the approach to the solution. by the way Thanks for sharing the approach as well.