Master the JavaScript interview with expertly curated questions and solutions. Strategies developed by FAANG engineers help you prep faster, boost confidence, and refine your problem-solving skills.

Master the JavaScript interview by practicing 20 carefully curated interview questions and solutions. These problems will provide the tools you need to tackle any question you find in an interview. Allow ~1 hour per question.

Most questions have multiple solutions presented. All solutions are thoroughly explained and time and space complexity are discussed. A passing familiarity with these ideas is expected. You'll learn how to tackle different types of problems so you can proceed with confidence in your interviews.

These questions go beyond the common problems that we've all seen. FizzBuzz and bubble sort? We start past those.

We'll discuss how to refine algorithms. We'll go over clever, advanced ways of manipulating data that interviewers are looking for. You'll walk away more skilled and confident in your problem solving and interviewing abilities.

This course is taught in ES2015.

Master the JavaScript Interview

# Fibonacci

We'll start with the simple version and create the advanced version further down.

### Instructions

Write a function that will take a positive integer *n* and return an array of length *n* containing the [Fibonacci sequence](https://en.wikipedia.org/wiki/Fibonacci_number).

**Input**: Integer > 0

**Output**: Array of Numbers

### Examples

    fibonacci(4); // -> [1, 1, 2, 3]
    fibonacci(6); // -> [1, 1, 2, 3, 5, 8]
    fibonacci(8); // -> [1, 1, 2, 3, 5, 8, 13, 21]


---

# Fibonacci

We'll start with the simple version and create the advanced version further down.

## Instructions

Write a function that will take a positive integer *n* and return an array of length *n* containing the [Fibonacci sequence](https://en.wikipedia.org/wiki/Fibonacci_number).

**Input**: Integer > 0

**Output**: Array of Numbers

## Examples

    fibonacci(4); // -> [1, 1, 2, 3]
    fibonacci(6); // -> [1, 1, 2, 3, 5, 8]
    fibonacci(8); // -> [1, 1, 2, 3, 5, 8, 13, 21]


---

We'll add yet another tool to our toolbelt in this lesson. We'll learn memoization, a technique of storing data that has already been computed for later use.

Introduction

Strings & Arrays

Advanced Strings & Arrays

Algorithms & Data Structures

JavaScript Mastery

Conclusion

Memoized Fibonacci

Fibonacci

Instructions

Examples