Daily Challenge #194 - Spread Number

Setup

Implement a function that will create an array and fill it with numbers ranging from 1 to n. The numbers will always be positive.

Examples

spreadNumber(1) => [1]

spreadNumber(2) => [1, 2]

spreadNumber(5) => [1, 2, 3, 4, 5]

Tests

spreadNumber(3)

spreadNumber(6)

spreadNumber(9)

Good luck!

---

This challenge comes from linisnie on CodeWars. Thank you to CodeWars, who has licensed redistribution of this challenge under the 2-Clause BSD License!

Want to propose a challenge idea for a future post? Email [e-mail] with your suggestions!

Comments

[Sagiv ben giat]

JavaScript:

const spreadNumber = n => [...Array(n).keys()]

[Jeroen Cornelissen]

That creates an Array from 0 to n not from 1 to n ;-)

const spreadNumber = n => Array(n).fill(0).map((_, i) => i+1);

[Sagiv ben giat]

Yeah, i didnt notice its not zero based

[Daan Wilmer]

I think you have an off-by-one error: spreadNumber(2) gives [0, 1] instead of [1, 2]. Nice and concise, though!

[Sagiv ben giat]

Thanks. I didnt notice its zero based

[Matt Ellen-Tsivintzeli]

Another way:

const spreadNumber = n => Array.from({length:n}).map((_, i) => i+1);

[Craig McIlwrath]

Haskell, many ways

spreadNumber n = [1..n]
spreadNumber = enumFromTo 1
spreadNumber = flip take [1..]

-- The most flexible way
spreadEnum :: Enum a => a -> a
spreadEnum = enumFromTo $ toEnum 1

[Craig McIlwrath]

This challenge was simple, so here's a brainfuck solution too. Only works with characters 1-9 as inputs (I have an idea for reading multidigit numbers as input, but I'm on my phone and don't want to type it out).

,>++++++[-<-------->>++++++++<]<[->>+.<<]

[David Mendoza (He/Him)]

Python

def spreadNumber(n):
    return range(1,n+1)

[Rafael Acioly]

this will not work, it doesn't include the last digit:

spreadNumber(4) => [1, 2, 3]

you forgot to add +1 on n

[David Mendoza (He/Him)]

You are right, I didnt take that in consideration, but it just range(1,n+1)

[Natamo]

Late to the party, as always.

Func<int, int[]> SpreadNumber = (int n) => Enumerable.Range(1, n).ToArray();

Example:

foreach(int i in SpreadNumber(10)) {
    Console.WriteLine(i);
}

[Cent]

Javascript, just using a for loop

const spreadNumber = (number) => {
  let returnArray = [];

  for (let i = 0; i < number; i++) {
    returnArray.push(i+1);
  }

  return returnArray;
}

Codepen

[@nobody]

Clojure short and simple

(ns daily-challenge.one-ninety-four)

(defn spreadNumber [n]
;; precondition check to bound domain
 {:pre [(> 0 n)]}

  (unless (= n 1)
   (vec (range 1 n))
   [1])) 

and some tests...

(deftest one-ninety-four
  (is (= [1 2 3] (spreadNumber 3)))
  (is (= [1 2 3 4 5 6] (spreadNumber 6)))
  (is (= [1 2 3 4 5 6 7 8 9] (spreadNumber 9))))


(run-tests 'daily-challenge.one-ninety-four)

=> Testing daily-challenge.one-ninety-four

Ran 1 tests containing 3 assertions.
0 failures, 0 errors.
{:type :summary, :test 1, :pass 3, :fail 0, :error 0}

[Lamonte]

dart

List<int> spreadNumber(int n) {
  var nums = List<int>();
  for(var x = 1; x <= n.abs(); x++) {
    nums.add(x);
  }
  return nums;
}

lol damn, while this is one way, looking at other solutions. I forgot range was a thing.

List<int> spreadNumber(int n) {
  return List<int>.generate(n.abs(), (n) => n + 1);
}

[Kosta Zivic]

Python, shortest approach

lambda  x: [i+1 for i in range(x)]

[Rafael Acioly]

you could've use just range like this:

lambda x: range(1, x+1)

[SavagePixie]

Elixir

def spread_number(n), do: Enum.to_list 1..n

[Avalander]

Haskell

The easiest challenge yet.

spreadNumber :: Int -> [Int]
spreadNumber n = [1..n]