"Avoid Obstacles" - Codesignal #22 - JAVA Solution
Try these popular Algorithm and Java books:
1. Cracking the Coding Interview: 150 Programming Questions and Solutions
https://amzn.to/37emg3w
2. Introduction to Algorithms
https://amzn.to/356uJmC
3. Java Pocket Guide: Instant Help for Java Programmers
https://amzn.to/3k6ajAt
*As an Amazon Associate I earn from qualifying purchases.
*******************************************************************************************
Like and Subscribe if you enjoy my content!
Or give advice or alternative solutions in the comments below!
Problem: https://app.codesignal.com/arcade/int...
You are given an array of integers representing coordinates of obstacles situated on a straight line.
Assume that you are jumping from the point with coordinate 0 to the right. You are allowed only to make jumps of the same length represented by some integer.
Find the minimal length of the jump enough to avoid all the obstacles.
More CodeSignal: • CodeSignal
More LeetCode: • Leetcode
More HackerRank: • HackerRank
*******************************************************************************************
Follow me on:
Twitter - / joshuacadavez
LinkedIn - / joshuacadavez
GitHub - https://github.com/JoshuaTheEngineer