Learning Algorithms In Javascript From Scratch

Make your code & programs faster and more efficient by using algorithms. Be very well prepared for technical interviews.

Last updated 2022-01-10 | 4.6

- Code out important algorithms in JavaScript
- Improve the efficiency
- performance
- and scalability of your code
- applications
- and programs
- Excel in technical engineering/programming interviews at both large companies and small companies

What you'll learn

Code out important algorithms in JavaScript
Improve the efficiency
performance
and scalability of your code
applications
and programs
Excel in technical engineering/programming interviews at both large companies and small companies
Create your own
custom
algorithms that can perform whatever functionality you may need

* Requirements

* Basic javascript knowledge - this course teaches algorithms from the ground up

Description

This course teaches algorithms in javascript from the ground up.  Using algorithms in your programming allows you to improve the efficiencyperformancespeed, and scalability of your code/applications/programs.  You will learn what algorithms are, why they are important, and how to code them out in JavaScript.  You will also learn other important programming concepts along the way such as functional programming, time complexity, recursion, and other important concepts, because you will be implementing them in the algorithms that you build throughout this course.  This course also heavily uses diagrams and animations to help make understanding the material easier.

This course is also very good for anyone who is interviewing for developer/engineering jobs at both large and small companies.  Interviewers will very often ask candidates to write algorithms out in code, and this course will prepare you very well to do that.  If you have recently graduated from a coding bootcamp or are currently looking for a job, you will find this course to be beneficial.  Knowing algorithms will absolutely help you to excel in technical interviews.

Who this course is for:

  • Anyone who wants to learn how to code out algorithms in JavaScript
  • Anyone who wants to learn how to implement algorithms in their applications
  • Anyone who is currently, or will be interviewing for engineering/developer roles and wants to be well prepared for technical interview questions
  • Anyone who already knows algorithms but needs a refresher
  • Anyone who wants to strengthen their computer science fundamentals

Course content

17 sections • 69 lectures

Introduction to Algorithms & Course Layout Preview 04:11

Fizz Buzz - Intro Preview 02:17

Modulus Operator Preview 01:57

Fizz Buzz - Code Preview 04:55

Fizz Buzz - Testing Preview 01:16

Fizz Buzz - Source Code Preview 00:07

Harmless Ransom Note - Intro Preview 02:11

Time Complexity & Big O Notation Preview 09:05

Harmless Ransom Note - Code Part 1 Preview 06:18

Harmless Ransom Note - Code Part 2 Preview 03:27

Harmless Ransom Note - Testing Preview 04:04

Harmless Ransom Note - Source Code Preview 00:32

Is Palindrome - Intro Preview 01:42

Is Palindrome - Code Preview 07:07

Is Palindrome - Testing Preview 01:01

Is Palindrome - Source Code Preview 00:05

Caesar Cipher - Intro Preview 01:59

Caesar Cipher - Code Preview 11:12

Caesar Cipher - Testing Preview 01:31

Caesar Cipher - Source Code Preview 00:15

Reverse Words - Intro Preview 02:16

Reverse Words - Code Preview 04:46

Reverse Words - Testing Preview 00:57

Reverse Words - Source Code Preview 00:06

Reverse Array In Place - Intro Preview 01:09

Reverse Array In Place - Code Preview 05:17

Reverse Array In Place - Testing Preview 00:57

Reverse Array In Place - Source Code Preview 00:07

Mean Median Mode - Intro Preview 01:37

Mean Median Mode - Code Part 1 Preview 08:02

Mean Median Mode - Code Part 2 Preview 08:17

Mean Median Mode - Testing Preview 01:31

Mean Median Mode - Source Code Preview 00:26

Two Sum - Intro Preview 02:58

Two Sum - Code Preview 05:05

Two Sum - Testing Preview 01:36

Two Sum - Source Code Preview 00:09

Binary Search - Intro Preview 03:27

Introduction to Recursion & the Call Stack Preview 09:36

Binary Search - Code Preview 08:40

Binary Search - Testing Preview 01:04

Binary Search - Source Code Preview 00:12

Fibonacci - Intro Preview 02:52

Fibonacci - Code Preview 03:37

Fibonacci - Testing Preview 03:08

Fibonacci - Source Code Preview 00:03

Memoized Fibonacci - Intro Preview 03:13

Memoized Fibonacci - Code Preview 05:27

Memoized Fibonacci - Testing Preview 02:16

Memoized Fibonacci - Source Code Preview 00:06

Sieve of Eratosthenes - Intro Preview 05:23

Sieve of Eratosthenes - Code Preview 06:13

Sieve of Eratosthenes - Testing Preview 01:25

Sieve of Eratosthenes - Source Code Preview 00:12

Bubble Sort - Intro Preview 06:13

Bubble Sort - Code Preview 05:20

Bubble Sort - Testing Preview 01:27

Bubble Sort - Source Code Preview 00:10

Merge Sort - Intro Preview 04:11

Merge Sort - Code Preview 11:26

Merge Sort - Animations Preview 05:00

Merge Sort - Testing Preview 01:10

Merge Sort - Source Code Preview 00:15

Max Stock Profit - Intro Preview 03:04

Max Stock Profit - Code Preview 07:26

Max Stock Profit - Testing Preview 01:28

Max Stock Profit - Source Code Preview 00:14