Grand temple question

#1

i have tried brute force approach but its giving time limit error, any optimised approach?

#2

Hello @sktg99,

You can implement the following approach:

Make two vectors:
1.1. first: to store the x coordinates provided as input.
1.2. second: to store all the y coordinates provided as input.

Sort both the vectors.

Find the maximum difference between the adjacent elements of each vector as dx and dy.

Print the Area by multiplying both the differences.

Note: Observe the figure carefully, you have to subtract 1 from both dx and dy before multiplication.

Hope, this would help.
Give a like, if you are satisfied.