id/email
password
forgot password | create account
about | help | code help+videos | done | prefs
CodingBat code practice

 

jebbert@volusia.k12.fl.us > sept28_2018_SLHL_slinkyDog
prev  |  next  |  chance

Write a method that returns the shortest wait time in the array of wait times that are passed in as the input parameter. All of the wait times will be greater than zero. There could be ties for shortest wait times. The 'waitTimes' array will contain at least one element.


sept28_2018_SLHL_slinkyDog([50, 15, 30, 50, 70, 90, 80, 40]) → 15
sept28_2018_SLHL_slinkyDog([70, 30, 16, 26]) → 16
sept28_2018_SLHL_slinkyDog([100, 100, 100, 100, 100, 100]) → 100

...Save, Compile, Run (ctrl-enter)

public int sept28_2018_SLHL_slinkyDog(int[] waitTimes) { }

Editor font size %:
Shorter output


Forget It! -- delete my code for this problem

Progress graphs:
 Your progress graph for this problem
 Random user progress graph for this problem
 Random Epic Progress Graph

Java Help

Misc Code Practice

Difficulty: 290

Copyright Nick Parlante 2017 - privacy