Solution 3 for Scaler Topics Fortnightly Contest - 12

This article is part of the Scaler Topics Fortnightly Contest - 12

Solution Approach

• Note that the Brute force of $O(N^4)$ can be reduced to $O(N^3)$ by considering the fact that only tuple with property $j-i = l-k$ will be counted.
• Can you optimize it further?
• This question can be solved in $O(n^2)$ by mapping all elements into very big elements let's say in the range 1 to $10^15$ and the sum of subarrays can be used as hash values.
• Now we can just store the sum in the map to find an answer in $O(N^2)$.
• Note that a similar array must have the same sum, although the converse is not true: for example $1+3 = 2 +2$ but 1, 2, and 3 are randomly mapped to a very big integer.
• Thus the possibility of collision is very low.

C++ Implementation

Java Implementation

Python Implementation