Ultimate JavaScript Interview Course

Course Curriculum

Chapter 1: Course Introduction

Lecture 1: Course Introduction

Lecture 2: Course Layout

Chapter 2: Introduction to Data Structures and Important Concepts

Lecture 1: What Are Data Structures And Why Are They Important

Lecture 2: Constructor Functions and the "this" Keyword

Lecture 3: The Prototype Object

Chapter 3: Linked Lists

Lecture 1: What Is A Linked List?

Lecture 2: Linked List and "Node" Constructor Functions

Lecture 3: Add To Head – Part 1

Lecture 4: Add To Head – Part 2

Lecture 5: Using Add To Head

Lecture 6: Add To Tail

Lecture 7: Testing Add To Tail and Add To Head

Lecture 8: Remove Head

Lecture 9: Remove Tail

Lecture 10: Search Method

Lecture 11: Testing Search

Lecture 12: Linked List – Independent Exercise

Lecture 13: Linked List – Exercise Review

Lecture 14: Big O Notation and Calculating the Runtime of a Function

Lecture 15: Big O Notation & Runtime Source Code

Lecture 16: Linked List – Wrap-Up

Lecture 17: Linked List Source Code

Chapter 4: Binary Search Trees

Lecture 1: What Is A Binary Search Tree?

Lecture 2: Recursion Part 1

Lecture 3: Recursion Part 2 and the Call Stack

Lecture 4: Insert Method

Lecture 5: Testing Insert

Lecture 6: Contains Method

Lecture 7: Testing Contains

Lecture 8: Depth First Traversal – In-Order

Lecture 9: Testing Depth First Traversal In-Order

Lecture 10: Refactoring Depth First Traversal Method

Lecture 11: Depth First Traversal – Pre-Order

Lecture 12: Testing Depth First Traversal Pre-Order

Lecture 13: Depth First Traversal – Post-Order

Lecture 14: Breadth First Traversal – Part 1

Lecture 15: Breadth First Traversal – Part 2

Lecture 16: Testing Breadth First Traversal

Lecture 17: Binary Search Tree – Independent Exercise

Lecture 18: Binary Search Tree – Exercise Review

Lecture 19: Binary Search Tree – Wrap-Up

Lecture 20: Binary Search Tree Source Code

Chapter 5: Hash Tables

Lecture 1: What Is A Hash Table?

Lecture 2: Hash Table and Hash Node Constructor Functions

Lecture 3: CharCodeAt Method and Modulus Operator

Lecture 4: Hash Method

Lecture 5: Insert Method

Lecture 6: Testing Insert Method

Lecture 7: Refactoring Insert Method

Lecture 8: Testing Refactored Insert Method

Lecture 9: Get Method

Lecture 10: Testing Get Method

Lecture 11: Hash Table – Independent Exercise

Lecture 12: Hash Table – Exercise Review

Lecture 13: Hash Table – Wrap-Up

Lecture 14: Hash Table Source Code

Chapter 6: JavaScript Algorithms Introduction

Lecture 1: Introduction To Algorithms & Course Layout

Chapter 7: Fizz Buzz

Lecture 1: Fizz Buzz – Intro

Lecture 2: Modulus Operator

Lecture 3: Fizz Buzz – Code

Lecture 4: Fizz Buzz – Testing

Lecture 5: Fizz Buzz – Source Code

Chapter 8: Harmless Ransom Note

Lecture 1: Harmless Ransom Note – Intro

Lecture 2: Time Complexity & Big O Notation

Lecture 3: Harmless Ransom Note – Code Part 1

Lecture 4: Harmless Ransom Note – Code Part 2

Lecture 5: Harmless Ransom Note – Testing

Lecture 6: Harmless Ransom Note – Source Code

Chapter 9: Is Palindrome

Lecture 1: Is Palindrome – Intro

Lecture 2: Is Palindrome – Code

Lecture 3: Is Palindrome – Testing

Lecture 4: Is Palindrome – Source Code

Chapter 10: Caesar Cipher

Lecture 1: Caesar Cipher – Intro

Lecture 2: Caesar Cipher – Code

Lecture 3: Caesar Cipher – Testing

Lecture 4: Caesar Cipher – Source Code

Chapter 11: Reverse Words

Lecture 1: Reverse Words – Intro

Lecture 2: Reverse Words – Code

Lecture 3: Reverse Words – Testing

Lecture 4: Reverse Words – Source Code

Chapter 12: Reverse Array In Place

Lecture 1: Reverse Array In Place – Intro

Lecture 2: Reverse Array In Place – Code

Lecture 3: Reverse Array In Place – Testing

Lecture 4: Reverse Array In Place – Source Code

Chapter 13: Mean Median Mode

Lecture 1: Mean Median Mode – Intro

Lecture 2: Mean Median Mode – Code Part 1

Lecture 3: Mean Median Mode – Code Part 2