The problem was following: You have n values and you are given a process. • Start at 0 • Each time you are in position i, jump to i + val[i] Find whether it is: • if it's infinite loop -> last point you have been to • out of bounds (you are allowed to travel between 0 and n-1) n <= 10^5 -10^9 <= val[i] <= 10^9