avatar Bite 288. Smallest number

Write a function that accepts a list of digits and returns the smallest number that can be created by combining unique digits.

Therefore, you have to ignore duplicated digits.  

Examples:  

[1] => 1

[7, 1] => 17  

[1, 9, 5, 9, 1] => 159

Note: An empty input list [] should return 0.

Login and get coding
go back Beginner level
Bitecoin 2X

218 out of 219 users completed this Bite.
Will you be the 219th person to crack this Bite?
Resolution time: ~25 min. (avg. submissions of 5-240 min.)
Our community rates this Bite 3.0 on a 1-10 difficulty scale.
» You can do it! 😌

Focus on this Bite hiding sidebars, turn on Focus Mode.

Ask for Help