## Solution 1: for loop
```js
export const getFibonacci = (n) => {
 if (n === 1) {
 return [0];
 } else if (n === 2) {
 return [0, 1];
 } else {
 const result = [0, 1];
 for (let i = 2; i < n; i++) {
 const nextNumber = result[i - 1] + result[i - 2];
 result.push(nextNumber);
 }
 return result;
 }
}
```
If n is 1, it returns an array containing only the number 0. If n is 2, it returns an array containing the numbers 0 and 1.
For all other values of n, the function initializes an array `result` with the first two numbers in the Fibonacci sequence (0 and 1) and then uses a loop to calculate the remaining numbers in the sequence. The loop runs n-2 times because the first two numbers are already in the array.
Each number in the sequence is the sum of the previous two numbers. The loop calculates the next number in the sequence, adds it to the array, and continues until all n numbers have been added. Finally, the function returns the resulting array.

<h2>Solution 1: for loop</h2>
<pre><div style="color:#d4d4d4;font-size:13px;text-shadow:none;font-family:Menlo, Monaco, Consolas, &quot;Andale Mono&quot;, &quot;Ubuntu Mono&quot;, &quot;Courier New&quot;, monospace;direction:ltr;text-align:left;white-space:pre;word-spacing:normal;word-break:normal;line-height:1.5;-moz-tab-size:4;-o-tab-size:4;tab-size:4;-webkit-hyphens:none;-moz-hyphens:none;-ms-hyphens:none;hyphens:none;padding:1em;margin:.5em 0;overflow:auto;background:#1e1e1e"><code style="color:#d4d4d4;font-size:13px;text-shadow:none;font-family:Menlo, Monaco, Consolas, &quot;Andale Mono&quot;, &quot;Ubuntu Mono&quot;, &quot;Courier New&quot;, monospace;direction:ltr;text-align:left;white-space:pre;word-spacing:normal;word-break:normal;line-height:1.5;-moz-tab-size:4;-o-tab-size:4;tab-size:4;-webkit-hyphens:none;-moz-hyphens:none;-ms-hyphens:none;hyphens:none" class="language-js">export const getFibonacci = (n) =&gt; {
 if (n === 1) {
 return [0];
 } else if (n === 2) {
 return [0, 1];
 } else {
 const result = [0, 1];
 for (let i = 2; i &lt; n; i++) {
 const nextNumber = result[i - 1] + result[i - 2];
 result.push(nextNumber);
 }
 return result;
 }
}</code></div></pre>
If n is 1, it returns an array containing only the number 0. If n is 2, it returns an array containing the numbers 0 and 1. 
For all other values of n, the function initializes an array <code class="rounded dark:bg-gray-800 dark:text-white text-black bg-gray-100 px-[0.25rem] py-[0.1rem] text-sm font-normal font-mono" data-prestyled="true">result</code> with the first two numbers in the Fibonacci sequence (0 and 1) and then uses a loop to calculate the remaining numbers in the sequence. The loop runs n-2 times because the first two numbers are already in the array. 
Each number in the sequence is the sum of the previous two numbers. The loop calculates the next number in the sequence, adds it to the array, and continues until all n numbers have been added. Finally, the function returns the resulting array.

Write a function <code class="rounded dark:bg-gray-800 dark:text-white text-black bg-gray-100 px-[0.25rem] py-[0.1rem] text-sm font-normal font-mono" data-prestyled="true">getFibonacci(n)</code>, which takes an integer <code class="rounded dark:bg-gray-800 dark:text-white text-black bg-gray-100 px-[0.25rem] py-[0.1rem] text-sm font-normal font-mono" data-prestyled="true">n</code> as an input. This function should return the array containing the first n numbers in the Fibonacci sequence. 
The Fibonacci sequence is a series of numbers where each number is the sum of the previous two numbers, starting with 0 and 1. It is a famous mathematical concept that appears in nature, art, and many other fields. The sequence has a unique mathematical property that makes it useful in many applications, including computer algorithms, finance, and cryptography.
<h2>Instructions</h2>
<ul>
<li>You can assume that the input <code class="rounded dark:bg-gray-800 dark:text-white text-black bg-gray-100 px-[0.25rem] py-[0.1rem] text-sm font-normal font-mono" data-prestyled="true">n</code> will always be a positive integer.</li>
</ul>
<h2>Example test cases</h2>
<pre><div style="color:#d4d4d4;font-size:13px;text-shadow:none;font-family:Menlo, Monaco, Consolas, &quot;Andale Mono&quot;, &quot;Ubuntu Mono&quot;, &quot;Courier New&quot;, monospace;direction:ltr;text-align:left;white-space:pre;word-spacing:normal;word-break:normal;line-height:1.5;-moz-tab-size:4;-o-tab-size:4;tab-size:4;-webkit-hyphens:none;-moz-hyphens:none;-ms-hyphens:none;hyphens:none;padding:1em;margin:.5em 0;overflow:auto;background:#1e1e1e"><code style="color:#d4d4d4;font-size:13px;text-shadow:none;font-family:Menlo, Monaco, Consolas, &quot;Andale Mono&quot;, &quot;Ubuntu Mono&quot;, &quot;Courier New&quot;, monospace;direction:ltr;text-align:left;white-space:pre;word-spacing:normal;word-break:normal;line-height:1.5;-moz-tab-size:4;-o-tab-size:4;tab-size:4;-webkit-hyphens:none;-moz-hyphens:none;-ms-hyphens:none;hyphens:none" class="language-js">getFibonacci(1); // Output: [0]
getFibonacci(2); // Output: [0, 1]
getFibonacci(5); // Output: [0, 1, 1, 2, 3]
getFibonacci(10); // Output: [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]</code></div></pre>
<h2>Hints</h2>
<ul>
<li>You should give special treatment for cases where <code class="rounded dark:bg-gray-800 dark:text-white text-black bg-gray-100 px-[0.25rem] py-[0.1rem] text-sm font-normal font-mono" data-prestyled="true">n</code> is equal to 1 or 2.</li>
<li>For cases when <code class="rounded dark:bg-gray-800 dark:text-white text-black bg-gray-100 px-[0.25rem] py-[0.1rem] text-sm font-normal font-mono" data-prestyled="true">n</code> is greater than 2, write a for loop that builds the output array.</li>
</ul>

Fibonacci sequence array

Instructions

Example test cases

Hints