2019 JavaScript Algorithmic Scripting: Intermediate Level

2019 JavaScript Algorithmic Scripting: Intermediate Level

English | MP4 | AVC 1280×720 | AAC 44KHz 2ch | 6 Hours | 2.05 GB

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

This course teaches algorithms in javascript from the ground up. Using algorithms in your programming allows you to improve the efficiency, performance, speed, 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.

What Will I 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
Table of Contents

Introduction
1 Introduction

Sum All Numbers in a Range
2 Sum All Numbers in a Range Pt.1
3 Sum All Numbers in a Range Pt.2
4 Sum All Numbers in a Range Pt.3

Diff Two Arrays
5 Difference Two Arrays Pt.1
6 Difference Two Arrays Pt.2
7 Difference Two Arrays Pt.3
8 Difference Two Arrays Pt.4

Roman Numeral Converter
9 Roman Numeral Converter Pt.1
10 Roman Numeral Converter Pt.2
11 Roman Numeral Converter Pt.3

Wherefore Art Thou
12 Wherefore art thou Pt.1
13 Wherefore art thou Pt.2
14 Wherefore art thou Pt.3
15 Wherefore art thou Pt.4

Search and Replace
16 Search and Replace Pt.1
17 Search and Replace Pt.2
18 Search and Replace Pt.3

Pig Latin
19 Pig Latin Pt.1
20 Pig Latin Pt.2
21 Pig Latin Pt.3
22 Pig Latin Pt.4

DNA Pairing
23 DNA Pairing Pt.1
24 DNA Pairing Pt.2

Missing Letters
25 Missing Letters Pt.1
26 Missing Letters Pt.2
27 Missing Letters Pt.3

Boo Who
28 Boo Who

Sorted Union
29 Sorted Union Pt.1
30 Sorted Union Pt.2
31 Sorted Union Pt.3
32 Sorted Union Pt.4
33 Sorted Union Pt.5
34 Sorted Union Pt.6

Convert HTML Entities
35 Convert HTML Entities Pt.1
36 Convert HTML Entities Pt.2
37 Convert HTML Entities Pt.3

Spinal Tap Case
38 Spinal Tap Case Pt.1
39 Spinal Tap Case Pt.2
40 Spinal Tap Case Pt.3
41 Spinal Tap Case Pt.4

Sum All Odd Fibonacci Numbers
42 Sum All Odd Fibonacci Numbers Pt.1
43 Sum All Odd Fibonacci Numbers Pt.2

Sum All Primes
44 Sum All Primes Pt.1
45 Sum All Primes Pt.2
46 Sum All Primes Pt.3

Smallest Common Multiple
47 Smallest Common Multiple Pt.1
48 Smallest Common Multiple Pt.2
49 Smallest Common Multiple Pt.3

Finders Keepers
50 Finders Keepers Pt.1
51 Finders Keepers Pt.2

Drop It
52 Drop It Pt.1
53 Drop It Pt.2
54 Drop It Pt.3

Steamroller
55 Steamroller Pt.1
56 Steamroller Pt.2
57 Steamroller Pt.3
58 Steamroller Pt.4

Binary Agents
59 Binary Agents Pt.1
60 Binary Agents Pt.2
61 Binary Agents Pt.3

Everything Be True
62 Everything Be True Pt.1
63 Everything Be True Pt.2
64 Everything Be True Pt.3

Arguments Optional
65 Arguments Optional Pt.1
66 Arguments Optional Pt.2
67 Arguments Optional Pt.3

Validate US Telephone Numbers
68 Validate US Telephone Numbers Pt.1
69 Validate US Telephone Numbers Pt.2