about | help | code help+videos | done | prefs |
For this method, pass in an array of positive integers that are either in increasing or decreasing order. The array will have at least one such number. Each number in the array tells you how many 1 by 1 squares are in that row. Each number is a new row. Return the total PERIMETER of the resulting region. distanceAround([3, 5, 6]) → 18 distanceAround([43]) → 88 distanceAround([50, 7, 1]) → 106 ...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: 440
Copyright Nick Parlante 2017 - privacy