| about | help | code help+videos | done | prefs | 
| Given a number n, create and return a new int array of length n, containing the numbers n-1, n-2, ... 0. (This is very similar to the fizzArray problem in arrays4) countDownArray(3) → [2, 1, 0] countDownArray(0) → [] countDownArray(5) → [4, 3, 2, 1, 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
Copyright Nick Parlante 2017 - privacy