Yes

I have an update regarding the description. The physical meaning of the problem is to calculate total area occupied by a set of rectanges. The formula in the description is not correct: it's true only when two rects intersect with each other. For three and more it gives wrong result (less that the real one because common area subtracted more time than it's needed).

for instance,
{{1, 4, 2, 7}, {1, 4, 2, 6}, {1, 4, 4, 5}, {2, 5, 6, 7}, {4, 3, 7, 6}}

Why are you using equalsIgnoreCase? '#' is not case-sensitive.

Would fit well for strange cases when you need low persormance for whatever reason. Average complexity here is O(n^3×log(n)) while some implementations achieve O(n).