Details of the problem ...
Input is crossing time list. (for example x= [1 2 5 8])
Output is the minimum time. (for original problem y_correct= 15)
Assumption 1: for this problem only four people will cross the bridge
Assumption 2: crossing times are integer
give nth decimal place of pi
Back to basics 25 - Valid variable names
Spot the outlier
Find the nearest integer
Elastic Collision 001: 1-D
Repeat string n times - 2
Recaman Sequence - III
Recaman Sequence - I
Pi Digit Probability
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office