Variant on "find the highest value in this array"

Minimum number of jumps in an array question explained incorrectly I understand that your intention may have been to test my communication skills, but your approach was unfair. You did not explicitly state that the algorithm cannot visit the first index twice, and you did not explain all of the conditions under which the algorithm works. When I cross-questioned you about this, you confirmed that the algorithm can visit the first index twice, which is incorrect. Here is a description of the minimum jumps algorithm for future reference for other candidates: Algorithm: · Create a recursive function that determines the minimum jumps required to reach the end of the array. · Start with the first element of the array and recurse for each step till current step > 0. · At each step, check if the current index is Reachable. If it is, update the minimum jumps count and recurse for the next step. · If the current index is not reachable, return the minimum jumps count. · The minimum jumps count is the minimum number of jumps required to reach the end of the array from the current index. Example: Python def min_jumps(arr, n): if n == 0 or arr[0] == 0: return float('inf') jumps = [float('inf')] * n jumps[0] = 0 for i in range(1, n): for j in range(i): if arr[j] >= i - j and jumps[j] != float('inf'): jumps[i] = min(jumps[i], jumps[j] + 1) return jumps[n - 1] # Example usage: arr = [1, 3, 6, 3, 2, 1, 2, 4, 2, 0, 1, 1] n = len(arr) print(min_jumps(arr, n))