```\nAn array of costs was given. \nYou can either take two jumps forward or one jump backward. If you land on a particular index, you have to add the cost to your total. \nFind the minimum cost needed to cross the array or reach the end of the array.\n```\n\n```\nCan we use normal DP here? I don\'t think so because it is not a DAG, since we go back also. \nHow to solve it? \n```

\nAn array of costs was given. \nYou can either take two jumps forward or one jump backward. If you land on a particular index, you have to add the cost to your