Possibility of moving out of maze

Given n integers in a maze indicating a number of moves to be made from that position and a string which has ">" and "<" indicating which side to move. The starting position is the first position. 
Print whether it stays inside the array or moves out of the array. 

Example:  

Input : 3 
 2 1 1 
 > > < 
Output: It stays inside forever
Explanation: 
It moves towards right by a position of 2, 
hence is at the last index, then it moves 
to the left by 1, and then it again moves 
to the right by 1. Hence it doesn't go
out.

Input: 2
 1 2 
 > < 
Output: comes out 
Explanation: 
Starts at 0th index, moves right by 1 
position, and then moves left by 2 to 
come out 

The approach to the above problem is as follows:
We start from the 0th index and move until we exceed n or decrease 0. If we reach the same position twice, then we are in an infinite loop and can never move out. 
* use a mark array to mark the visited positions 
* start from 0th index and check the sign of move and move to that place, marking that position as visited 
* if visited we can never move out, hence break out 
* check the reason for the break from loop, and print the desired result.
// below is the python implementation of the above approach. 

Output:  

comes out

Time complexity: O(n) 

Auxiliary Space: O(n) as a vector of n size is been created, since n extra space has been taken.