We are given coordinates of obstacles on a straight line. We start jumping from point 0, we need to reach end avoiding all obstacles. Length of every jump has to be same (For example, if we jump from 0 to 4, then we must make next jump from 4 to 8). We need to find the minimum length of jump so that we can reach end and we avoid all obstacles.
Input : obs = [5, 3, 6, 7, 9] Output : 4 Obstacles are at points 3, 5, 6, 7 and 9 We jump from 0 to 4, then 4 to 8, then 4 to 12. This is how we reach end with jumps of length 4. If we try lower jump lengths, we cannot avoid all obstacles. Input : obs = [5, 8, 9, 13, 14] Output : 6
We insert locations of all obstacles in a hash table. We also find maximum value of obstacle. Then we try all possible jump sizes from 1 to maximum. If any jump size leads to a obstacle, we do not consider that jump.
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- Minimum number of Circular obstacles required to obstruct the path in a Grid
- Find the minimum of maximum length of a jump required to reach the last island in exactly k jumps
- Check if it is possible to reach a number by making jumps of two given length
- Count minimum factor jumps required to reach the end of an Array
- Paths requiring minimum number of jumps to reach end of array
- Minimum number of jumps to reach end | Set 2 (O(n) solution)
- Minimum number of Fibonacci jumps to reach end
- Maximum path sum in the given arrays with at most K jumps
- Reach the numbers by making jumps of two given lengths
- Maximum path sum for each position with jumps under divisibility condition
- Number of jumps for a thief to cross walls
- Traversal of tree with k jumps allowed between nodes of same height
- Count ways to reach end from start stone with at most K jumps at each step
- Find minimum length sub-array which has given sub-sequence in it
- Minimum length of the reduced Array formed using given operations
- Maximum length L such that the sum of all subarrays of length L is less than K
- Length of longest Palindromic Subsequence of even length with no two adjacent characters same
- Length of longest subarray of length at least 2 with maximum GCD
- Minimum distance between the maximum and minimum element of a given Array
- Find the Minimum length Unsorted Subarray, sorting which makes the complete array sorted
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.