Given an input array of 1s and 0s, return a range of array which when flipped will give maximum 0s in the array\n\nInput: [0, 1, 1, 0, 1, 1]\nOutput: [1, 5]\n\nExplanation: When elements [1, 5] are flipped it gives the array [0, 0, 0, 1, 0, 0] which has max 0s possible, any other range would not be optimal.\n\nTried to solve calculating subsquences of 1s but failed few cases\n\nAnyone come across a similar problem on leetcode?

Given an input array of 1s and 0s, return a range of array which when flipped will give maximum 0s in the array\n\nInput: [0, 1, 1, 0, 1, 1]\nOutput: [1, 5]\n\n