frog jump

class Solution { int[] dp; public int minimumEnergy(int[] height, int n) { dp = new int[n]; Arrays.fill(dp, -1); return helper(n - 1, height); } private int helper(int i, int[] height) { if (i == 0) r...