```\nGiven an array of 1\u2019s and 0\u2019s and a set of ranges, find out the number of 0\u2019s in each range (i, j) including both indexes.\n```\n```\n// Input Array: [1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1] size n\n// Range Array: [[0,4], [3,6], [1, 5], [0, 7]] size m\n// Output: [3, 3, 4, 6]\n```\n\nFollowUp:\n```\nFor the same input find out the number of 0\u2019s which are guarded by 1\u2019s on left and right within the same range.\n// Output: [2, 0, 0, 2]\n```\n\nI was able to solve the first part in O(n) but not the follow up.\n\nAny help is appreciated for the follow up.

\nGiven an array of 1\u2019s and 0\u2019s and a set of ranges, find out the number of 0\u2019s in each range (i, j) including both indexes.\n\n\n// Input Array: