jgreenawalt@ccboe.com initials > wheresWee
prev  |  next  |  chance

Given an array of ints, find the position of the smallest value. If more than one value ties for the smallest number, return the smallest minimum position. If the array is empty return -1; wheresWee([3, 5, 1, 8]) → 2 wheresWee([]) → -1 wheresWee([-4, -5, -6]) → 2 Go...Save, Compile, Run (ctrl-enter) public int wheresWee(int [] nums){ } Go Editor font size %:75100125150 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

• Java Example Solution Code
• Java String Introduction (video)
• Java Substring v2 (video)
• Java String Equals and Loops
• Java String indexOf and Parsing
• Java If and Boolean Logic
•   If Boolean Logic Example Solution Code 1 (video)
•   If Boolean Logic Example Solution Code 2 (video)
• Java For and While Loops
• Java Arrays and Loops
• Java Map Introduction
• Java Map WordCount
• Java Functional Mapping
• Java Functional Filtering

Misc Code Practice

• Code Badges
• Introduction to Mod (video)
• MakeBricks problem and solution (video x 2)
• FizzBuzz the famous code interview question (video)

Difficulty: 200

Copyright Nick Parlante 2017 - privacy