Skip to content

aldoruizluna/frog_leap_problem

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

10 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

frog_leap_problem

Function that returns the earliest time when a frog can jump to the other side of a river

Problem Statement

A small frog wants to get to the other side of a river. The frog is currently located at position 0, and wants to get to position X. Leaves fall from a tree onto the surface of the river. You are given a non-empty zero-indexed array A consisting of N integers representing the falling leaves. A[K] represents the position where one leaf falls at time K, measured in minutes. The goal is to find the earliest time when the frog can jump to the other side of the river. The frog can cross only when leaves appear at every position across the river from 1 to X. For example, you are given integer X = 5 and array A such that: A[0] = 1 A[1] = 3 A[2] = 1 A[3] = 4 A[4] = 2 A[5] = 3 A[6] = 5 A[7] = 4 In minute 6, a leaf falls into position 5. This is the earliest time when leaves appear in every position across the river.

Write a function that, given a non-empty zero-indexed array A consisting of N integers and integer X, returns the earliest time when the frog can jump to the other side of the river. If the frog is never able to jump to the other side of the river, the function should return -1. For example, given X = 5 and array A such that: A[0] = 1 A[1] = 3 A[2] = 1 A[3] = 4 A[4] = 2 A[5] = 3 A[6] = 5 A[7] = 4 the function should return 6, as explained above. Assume that: N and X are integers within the range [1..100,000]; each element of array A is an integer within the range [1..X]. Complexity: expected worst-case time complexity is O(N); expected worst-case space complexity is O(X), beyond input storage (not counting the storage required for input arguments). Elements of input arrays can be modified.

How to run function

Run the following command: ruby frog_leap_time_calculator.rb {river_width} {leaves_positions} where {river_width} is the width of the river represented by integer X and where {leaves_positions} is the order in which the leaves fall onto the surface of the river, represented by array A (stored as a file)

Example: ruby frog_leap_time_calculator.rb 5 falling_leaves.txt

Instructions to run tests: Run the command bundle install if 'rspec gem' is not installed Run the command rspec spec See the tests pass and enjoy!

About

Function that returns the earliest time when a frog can jump to the other side of a river

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Contributors

Languages