Sweta reaching the end of array

Sweta has an array of integers. She has to start from the first index and reach the end. The only steps she can take are $+3$ or $-1$. Cost of a path is equal to the sum of all integers in the path. Help her to find the cost of the lowest cost path. If no path is possible, print $-1$. ### Input - First line will contain $T$, number of testcases. Then the testcases follow. - In each test case, fir