Another weird problem

Правка en1, от The-Winner, 2025-03-14 23:12:50

Hello! I came up with the following problem, tried to solve it (faster than $$$O(N^2)$$$) and failed. I asked some other people (all much smarter than me) but neither could they solve it.

The problem statement:

There is an array of positive integers. Count the number of even length subarrays such that the first half has the same sum as the second half.

Is it possible to solve this faster than $$$O(N^2)$$$? Maybe if we add additional constraints like the values are small or randomly generated (this one does not seem to help but I included it anyways). Thank you for your time.

Теги problem

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en4 Английский The-Winner 2025-03-14 23:52:31 25 (published)
en3 Английский The-Winner 2025-03-14 23:15:21 70
en2 Английский The-Winner 2025-03-14 23:13:32 13 Tiny change: 't neither could they solve it.' -> 't neither of them could solve it.'
en1 Английский The-Winner 2025-03-14 23:12:50 603 Initial revision (saved to drafts)