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

# All Anagrams

### Instructions

Write a function that takes in an array of strings. Return true if all strings are anagrams of one another and false if even a single string is not an anagram of the others.

**Input**:  Array of Strings

**Output**: Boolean

### Examples

    allAnagrams(['abcd', 'bdac', 'cabd']); // true
    allAnagrams(['abcd', 'bdXc', 'cabd']); // false

### Hints

- Think about what it means for two strings to be anagrams. They should all have the same characters present in the same number, perhaps in a different order.
- It would make sense to express the time complexity in terms of two variables.

---

# All Anagrams

## Instructions

Write a function that takes in an array of strings. Return true if all strings are anagrams of one another and false if even a single string is not an anagram of the others.

**Input**:  Array of Strings

**Output**: Boolean

## Examples

    allAnagrams(['abcd', 'bdac', 'cabd']); // true
    allAnagrams(['abcd', 'bdXc', 'cabd']); // false

## Hints

- Think about what it means for two strings to be anagrams. They should all have the same characters present in the same number, perhaps in a different order.
- It would make sense to express the time complexity in terms of two variables.

---

Learn how to determine if multiple strings are all anagrams of each other. While it seems as if this would require a fairly poor time and space complexity, we can come up with clever solutions that make this problem tractable.

Introduction

Strings & Arrays

Advanced Strings & Arrays

Algorithms & Data Structures

JavaScript Mastery

Conclusion

All Anagrams

All Anagrams

Instructions

Examples

Hints