Given n integers in a maze indicating number of moves to be made from that position and a string which has “>” and “<" indicating which side to move. Starting position is 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
Approach to the above problem is as follows:
We start from 0th index and move until we exceed n or decreased 0. If we reach at the same position twice then we are in an infinite loop and can never move out.
* use 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 of break from loop , and print the desired result.
// below is the python implementation of the above approach
Time complexity: O(n)
This article is contributed by Twinkl Bajaj. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
- Possibility of a word from a given set of characters
- Count unequal element pairs from the given Array
- Find the last remaining Character in the Binary String according to the given conditions
- Find starting index for every occurence of given array B in array A using Z-Algorithm
- Partition the array into two odd length groups with minimized absolute difference between their median
- Fill the missing numbers in the array of N natural numbers such that arr[i] not equal to i
- Find number of subarrays ending with arr[i] where arr[i] is the minimum element of that subarray
- Number formed by deleting digits such that sum of the digits becomes even and the number odd
- Reverse the substrings of the given String according to the given Array of indices
- Length of Smallest Subsequence such that sum of elements is greater than equal to K
- Check if the Depth of Parentheses is correct in the given String
- Count the number of times graph crosses X-axis
- Python | Replacing Nth occurrence of multiple characters in a String with the given character
- Find an array of size N having exactly K subarrays with sum S
Improved By : vt_m