JavaScript Algorithms and Data Structures Masterclass

سرفصل های دوره

The Missing Computer Science and Coding Interview Bootcamp

01 - Introduction

001 Curriculum Walkthrough

002 Join The Community!.html

003 What Order Should You Watch In

004 How Im Running My Code

02 - Big O Notation

001 Intro to Big O

002 Timing Our Code

002 add-up-to-faster.zip

002 add-up-to-slower.zip

003 Counting Operations

004 Visualizing Time Complexities

005 Official Intro to Big O

006 Simplifying Big O Expressions

009 Space Complexity

011 Logs and Section Recap

external-links.txt

03 - Analyzing Performance of Arrays and Objects

001 PREREQUISITES.html

002 Section Introduction

003 The BIG O of Objects

005 When are Arrays Slow

006 Big O of Array Methods

external-links.txt

04 - Problem Solving Approach

001 PREREQUISITES.html

002 Introduction to Problem Solving

003 Step 1 Understand The Problem

004 Step 2 Concrete Examples

005 Step 3 Break It Down

006 Step 4 Solve Or Simplify

007 Step 5 Look Back and Refactor

008 Recap and Interview Strategies

external-links.txt

05 - Problem Solving Patterns

001 PREREQUISITES.html

002 Intro to Problem Solving Patterns

003 Frequency Counter Pattern

003 same-naive-solution.zip

003 same-refactored-solution.zip

004 Frequency Counter Anagram Challenge

006 Anagram Challenge Solution

006 anagram.zip

007 Multiple Pointers Pattern

007 sum-zero-naive.zip

008 Multiple Pointers Count Unique Values Challenge

010 Count Unique Values Solution

010 unique-values.zip

011 Sliding Window Pattern

011 max-sum-naive.zip

011 max-sum-refactored.zip

012 Divide And Conquer Pattern

external-links.txt

06 - 100% OPTIONAL Challenges

001 IMPORTANT NOTE!.html

004 SOLUTIONS PART 1.html

007 SOLUTIONS PART 2.html

011 SOLUTIONS PART 3.html

07 - Recursion

001 PREREQUISITES.html

002 Story Time Martin & The Dragon

003 Why Use Recursion

004 The Call Stack

004 callstack-example.zip

005 Our First Recursive Function

005 countdown.zip

007 Our Second Recursive Function

007 sumrange.zip

008 Writing Factorial Iteratively

008 factorial-iterative.zip

009 Writing Factorial Recursively

009 factorial-recursive.zip

010 Common Recursion Pitfalls

011 Helper Method Recursion

011 helper-method-recursion.zip

012 Pure Recursion

012 collect-odds-pure-recursion.zip

external-links.txt

08 - Recursion Problem Set

001 START HERE!.html

007 SOLUTIONS FOR THIS SECTION.html

09 - Bonus CHALLENGING Recursion Problems

001 NOTE ON THIS SECTION.html

006 SOLUTIONS PART 1.html

012 SOLUTIONS PART 2.html

10 - Searching Algorithms

001 PREREQUISITES.html

002 Intro to Searching

003 Intro to Linear Search

005 Linear Search Solution

005 linear-search.zip

006 Linear Search BIG O

007 Intro to Binary Search

008 Binary Search PseudoCode

010 Binary Search Solution

010 binary-search.zip

011 Binary Search BIG O

012 Naive String Search

013 Naive String Search Implementation

013 string-search.zip

external-links.txt

11 - Bubble Sort

001 PREREQUISITES.html

002 Introduction to Sorting Algorithms

003 Built-In JavaScript Sorting

004 Bubble Sort Overview

005 Bubble Sort Implementation

005 bubble-unoptimized.zip

006 Bubble Sort Optimization

006 optimized-bubble.zip

007 Bubble Sort BIG O Complexity

external-links.txt

12 - Selection Sort

001 PREREQUISITES.html

002 Selection Sort Introduction

003 Selection Sort Implementation

003 selection-sort.zip

004 Selection Sort Big O Complexity

external-links.txt

13 - Insertion Sort

001 PREREQUISITES.html

002 Insertion Sort Introduction

003 Insertion Sort Implementation

003 insertion-sort.zip

004 Insertion Sort BIG O Complexity

external-links.txt

14 - Comparing Bubble, Selection, and Insertion Sort

001 Comparing Bubble, Selection, and Insertion Sort

external-links.txt

15 - Merge Sort

001 PREREQUISITES.html

002 Intro to the Crazier Sorts

003 Merge Sort Introduction

004 Merging Arrays Intro

005 Merging Arrays Implementation

005 mergearrays.zip

006 Writing Merge Sort Part 1

007 Writing Merge Sort Part 2

007 mergesort.zip

008 Merge Sort BIG O Complexity

external-links.txt

16 - Quick Sort

001 PREREQUISITES.html

002 Introduction to Quick Sort

003 Pivot Helper Introduction

004 Pivot Helper Implementation

004 pivot.zip

005 Quick Sort Implementation

005 quicksort.zip

006 Quick Sort Call Stack Walkthrough

007 Quick Sort Big O Complexity

external-links.txt

17 - Radix Sort

001 PREREQUISITES.html

002 Radix Sort Introduction

003 Radix Sort Helper Methods

003 radix-helpers.zip

004 Radix Sort Pseudocode

005 Radix Sort Implementation

005 radix-sort.zip

006 Radix Sort BIG O Complexity

external-links.txt

18 - Data Structures Introduction

001 Which Data Structure Is The Best

002 ES2015 Class Syntax Overview

003 Data Structures The Class Keyword

003 class-keyword.zip

004 Data Structures Adding Instance Methods

004 instance-methods.zip

005 Data Structures Adding Class Methods

005 point-class.zip

005 student-class.zip

external-links.txt

19 - Singly Linked Lists

001 PREREQUISITES.html

002 Intro to Singly Linked Lists

003 Starter Code and Push Intro

003 singly-linked-list-structure.zip

004 Singly Linked List Push Solution

004 singly-linked-list-push.zip

005 Singly Linked List Pop Intro

006 Singly Linked List Pop Solution

006 singly-linked-list-pop.zip

007 Singly Linked List Shift Intro

008 Singly Linked List Shift Solution

008 singly-linked-list-shift.zip

009 Singly Linked List Unshift Intro

010 Singly Linked List Unshift Solution

010 singly-linked-list-unshift.zip

011 Singly Linked List Get Intro

012 Singly Linked List Get Solution

012 singly-linked-list-get.zip

013 Singly Linked List Set Intro

014 Singly Linked List Set Solution

014 singly-linked-list-set.zip

015 Singly Linked List Insert Intro

016 Singly Linked List Insert Solution

016 singly-linked-list-insert.zip

017 Singly Linked List Remove Intro

018 Singly Linked List Remove Solution

018 singly-linked-list-remove.zip

019 Singly Linked List Reverse Intro

020 Singly Linked List Reverse Solution

020 singly-linked-list-reverse.zip

021 Singly Linked List BIG O Complexity

external-links.txt

20 - Doubly Linked Lists

001 PREREQUISITES.html

002 Doubly Linked Lists Introduction

003 Setting Up Our Node Class

003 dll-classes.zip

004 Push

005 Push Solution

005 dll-push.zip

006 Pop

007 Pop Solution

007 dll-pop.zip

008 Shift

009 Shift Solution

009 dll-shift.zip

010 Unshift

011 Unshift Solution

011 dll-unshift.zip

012 Get

013 Get Solution

013 dll-get.zip

014 Set

015 Set Solution

015 dll-set.zip

016 Insert

017 Insert Solution

017 dll-insert.zip

018 Remove

019 Remove Solution

019 dll-remove.zip

020 Comparing Singly and Doubly Linked Lists

external-links.txt

21 - Stacks + Queues

001 PREREQUISITES.html

002 Intro to Stacks

003 Creating a Stack with an Array

004 Writing Our Own Stack From Scratch

004 stack.zip

005 BIG O of Stacks

006 Intro to Queues

007 Creating Queues Using Arrays

008 Writing Our Own Queue From Scratch

008 queue.zip

009 BIG O of Queues

external-links.txt

22 - Binary Search Trees

001 PREREQUISITES.html

002 Introduction to Trees

003 Uses For Trees

004 Intro to Binary Trees

005 POP QUIZ!

006 Searching A Binary Search Tree

007 Our Tree Classes

007 bst-classes.zip

008 BST Insert

009 BST Insert Solution

009 bst-insert.zip

010 BST Find

011 BST Find Solution

011 bst-find.zip

012 Big O of Binary Search Trees

external-links.txt

23 - Tree Traversal

001 PREREQUISITES.html

002 Intro To Tree Traversal

003 Breadth First Search Intro

004 Breadth First Search Solution

004 breadth-first-tree.zip

005 Depth First PreOrder Intro

006 Depth First PreOrder Solution

006 depth-first-tree.zip

007 Depth First PostOrder Intro

008 Depth First PostOrder Solution

008 depth-first-tree.zip

009 Depth First InOrder Intro

010 Depth First InOrder Solution

010 depth-first-tree.zip

011 When to Use BFS and DFS

external-links.txt

24 - Binary Heaps

001 PREREQUISITES.html

002 Intro to Heaps

003 Storing Heaps

004 Heap Insert Intro

005 Heap Insert Solution

005 max-binary-heap-insert.zip

006 Heap ExtractMax Intro

007 Heap ExtractMax Solution

007 max-binary-heap-insert.zip

008 Priority Queue Intro

009 Priority Queue Pseudocode

010 Priority Queue Solution

010 priority-queue.zip

011 BIG O of Binary Heaps

external-links.txt

25 - Hash Tables

001 PREREQUISITES.html

002 Intro to Hash Tables

003 More About Hash Tables

004 Intro to Hash Functions

005 Writing Our First Hash Function

005 basic-hash.zip

006 Improving Our Hash Function

006 improved-hash.zip

007 Handling Collisions

008 Hash Table Set and Get

009 Hash Table Set Solution

009 hash-table-set-and-get.zip

010 Hash Table Get Solution

010 hash-table-set-and-get.zip

011 Hash Table Keys and Values

012 Hash Table Keys and Values Solution

012 hash-table-keys-and-values.zip

013 Hash Table Big O Complexity

external-links.txt

26 - Graphs

001 PREREQUISITES.html

002 Intro to Graphs

003 Uses for Graphs

004 Types of Graphs

005 Storing Graphs Adjacency Matrix

006 Storing Graphs Adjacency List

007 Adjacency Matrix Vs. List BIG O

008 Add Vertex Intro

009 Add Vertex Solution

009 graph-add-vertex.zip

010 Add Edge Intro

011 Add Edge Solution

011 graph-add-edge.zip

012 Remove Edge Intro

013 Remove Edge Solution

013 graph-remove-edge.zip

014 Remove Vertex Intro

015 Remove Vertex Solution

015 graph-remove-vertex.zip

external-links.txt

27 - Graph Traversal

001 PREREQUISITES.html

002 Intro to Graph Traversal

003 Depth First Graph Traversal

004 DFS Recursive Intro

005 DFS Recursive Solution

005 graph-dfs-recursive.zip

006 DFS Iterative Intro

007 DFS Iterative Solution

007 graph-dfs-iterative.zip

008 Breadth First Graph Traversal

009 BFS Intro

010 BFS Solution

010 graph-bfs.zip

external-links.txt

28 - Dijkstras Algorithm!

001 PREREQUISITES.html

002 Intro to Dijkstras and Prerequisites

003 Who was Dijkstra and what is his Algorithm

004 Writing a Weighted Graph

004 weightedgraph.zip

005 Walking through the Algorithm

006 Introducing Our Simple Priority Queue

006 simplepriorityqueue.zip

007 Dijkstras Pseudo-Code

008 Implementing Dijkstras Algorithm

008 dijkstra-version1.zip

009 Upgrading the Priority Queue

009 dijkstras-version2.zip

external-links.txt

29 - Dynamic Programming

001 Intro to Dynamic Programming

002 Overlapping Subproblems

003 Optimal Substructure

004 Writing A Recursive Solution

005 Time Complexity of Our Solution

006 The Problem With Our Solution

007 Enter Memoization!

008 Time Complexity of Memoized Solution

009 Tabulation A Bottom Up Approach

external-links.txt

30 - The Wild West

001 VERY IMPORTANT NOTE! PLEASE READ!.html

45,900 تومان

خرید اشتراک افزودن به سبد خرید

خرید دانلودی فوری

در این روش نیاز به افزودن محصول به سبد خرید و تکمیل اطلاعات نیست و شما پس از وارد کردن ایمیل خود و طی کردن مراحل پرداخت لینک های دریافت محصولات را در ایمیل خود دریافت خواهید کرد.

تولید کننده: Udemy