| about | help | code help+videos | done | prefs |
Given an positive integer return an array of integers containing each digit of the number where the first element of the array has the most significant digit and the last element of the array has the least significant digit. digs(1) → [1] digs(1234567890) → [1, 2, 3, 4, 5, 6, 7, 8, 9, 0] digs(1010101) → [1, 0, 1, 0, 1, 0, 1] ...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: 200
Copyright Nick Parlante 2017 - privacy