| about | help | code help+videos | done | prefs |
Given an unsorted array of ints, find and return the INDEX of the minimum of the numbers in the array (i.e. the INDEX of the smallest value). If multiple indexes have the smallest value, return the first one. Was there a way to solve the prior problem that makes this problem really easy? To use the prior description's numbers-in-a-book example: what if, instead of remembering the smallest number so far, you put a bookmark on the page where it lives? Could you change the location of the bookmark as you hear new information?apcsaArraysFindMinArrayIndex([0, 1, 2, 3]) → 0 apcsaArraysFindMinArrayIndex([-1, -3, 5]) → 1 apcsaArraysFindMinArrayIndex([0]) → 0 ...Save, Compile, Run (ctrl-enter) |
Progress graphs:
Your progress graph for this problem
Random user progress graph for this problem
Random Epic Progress Graph
Difficulty: 220
Copyright Nick Parlante 2017 - privacy