Separate Squares II
You receive a 2D integer array squares . Each squares[i] = [x i , y i , l i ] represents the coordinates of the bottom-left point and the side length of a square parallel to the x-axis.
Find the minimum y-coordinate value of a horizontal line such that the total area covered by squares above the line equals the total area covered by squares below the line.
Answers within 10^-5 of the actual answer will be accepted.
Note : Squares may overlap. Overlapping areas should be counted only once in this version.
Input: squares = [[0,0,1],[2,2,1]]
Output: 1.00000
Explanation: 
For this case, any horizontal line between y = 1 and y = 2 results in an equal split, with 1 square unit above and 1 square unit below. The minimum y-value is 1.
Input: squares = [[0,0,2],[1,1,1]]
Output: 1.00000
Explanation: 
For this case, since the blue square overlaps with the red square, it will not be counted again. Thus, the line y = 1 splits the squares into two equal parts.
Constraints
1 <= squares.length <= 5 * 10^4squares[i] = [x i , y i , l i ]squares[i].length == 30 <= x i , y i <= 10^91 <= l i <= 10^9- The total area of all the squares will not exceed
10^15.
Did this problem appear in one of your interviews?
Responses stay private.