I recently got this question in an interview and wasn\'t able to figure out a good approach.\n\nProblem:\nGiven two arrays A and B containing N elements each.\nWe can pick a range [L , R] where 1 <= L <= R <= N,\nSuch that for each index i, L <= i <= R, \nwe can either take ith element from **A or B**, but we must ensure that sum of elements taken from A equals sum of elements taken from B within the range.\n\nWe need to find the number of possible unique ways to choose ranges [L, R] such that this condition is satisfied.\nNote: Two ranges are different if L or R are different **or** if in one, ith element is taken from A and in other from B.\n\nReturn the answer modulo 1e9+7.\nN <= 10000\nSum of elements of A <= 10000\nSum of elements of B <= 10000\n\n\nI was trying some DP approaches but ultimately am unable to think up a correct solution. Any ideas ?\n

I recently got this question in an interview and wasn\'t able to figure out a good approach.\n\nProblem:\nGiven two arrays A and B containing N elements each.\n