about | help | code help+videos | done | prefs |
Write a method that accepts an array of any length. Each element in the array will be a positive number. Your goal is to find the sum of all the digits in all the ones places of all the numbers in array 'nums'. Return the sum of all the digits in the ones places. Look at the test data for examples. As a precondition you may assume that the array meets all the conditions explained above. test2023_11_02_APP1SLHL_sumOnesPlace([325, 912, 1240]) → 7 test2023_11_02_APP1SLHL_sumOnesPlace([42694]) → 4 test2023_11_02_APP1SLHL_sumOnesPlace([]) → 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: 230
Copyright Nick Parlante 2017 - privacy