种子简介

种子名称： [11-2018] js-algorithms-and-data-structures-masterclass
文件类型： 视频
文件数目： 217个文件
文件大小： 6.43 GB
收录时间： 2023-10-2 15:50
已经下载： 3次
资源热度： 111
最近下载： 2024-5-24 05:29

下载BT种子文件

下载Torrent文件(.torrent) 立即下载

磁力链接下载

magnet:?xt=urn:btih:6fce5fdf0a3c971c94e8d69dbd7537b9b4eb7d3b&dn=[11-2018] js-algorithms-and-data-structures-masterclass 复制链接到迅雷、QQ旋风进行下载，或者使用百度云离线下载。

喜欢这个种子的人也喜欢

种子包含的文件

[11-2018] js-algorithms-and-data-structures-masterclass.torrent

28 Dijkstra's Algorithm!/238 Implementing Dijkstra's Algorithm.mp4209.62MB

01 Introduction/001 Curriculum Walkthrough.mp454.55MB

01 Introduction/002 What Order Should You Watch In_.mp415.1MB

01 Introduction/003 How I'm Running My Code.mp454.54MB

02 Big O Notation/004 Intro to Big O.mp420.33MB

02 Big O Notation/005 Timing Our Code.mp432.47MB

02 Big O Notation/006 Counting Operations.mp414.44MB

02 Big O Notation/007 Visualizing Time Complexities.mp415.84MB

02 Big O Notation/008 Official Intro to Big O.mp443.9MB

02 Big O Notation/009 Simplifying Big O Expressions.mp441.02MB

02 Big O Notation/010 Space Complexity.mp421.62MB

02 Big O Notation/011 Logs and Section Recap.mp423.37MB

03 Analyzing Performance of Arrays and Objects/013 Section Introduction.mp45.14MB

03 Analyzing Performance of Arrays and Objects/014 The BIG O of Objects.mp422.03MB

03 Analyzing Performance of Arrays and Objects/015 When are Arrays Slow_.mp417.62MB

03 Analyzing Performance of Arrays and Objects/016 Big O of Array Methods.mp430.54MB

04 Problem Solving Approach/018 Introduction to Problem Solving.mp437.04MB

04 Problem Solving Approach/019 Step 1_ Understand The Problem.mp463.28MB

04 Problem Solving Approach/020 Step 2_ Concrete Examples.mp422.16MB

04 Problem Solving Approach/021 Step 3_ Break It Down.mp436.84MB

04 Problem Solving Approach/022 Step 4_ Solve Or Simplify.mp480.61MB

04 Problem Solving Approach/023 Step 5_ Look Back and Refactor.mp466.26MB

04 Problem Solving Approach/024 Recap and Interview Strategies.mp411.49MB

05 Problem Solving Patterns/026 Intro to Problem Solving Patterns.mp48.45MB

05 Problem Solving Patterns/027 Frequency Counter Pattern.mp464.48MB

05 Problem Solving Patterns/028 Frequency Counter_ Anagram Challenge.mp411.92MB

05 Problem Solving Patterns/029 Anagram Challenge Solution.mp436.08MB

05 Problem Solving Patterns/030 Multiple Pointers Pattern.mp452.2MB

05 Problem Solving Patterns/031 Multiple Pointers_ Count Unique Values Challenge.mp419.88MB

05 Problem Solving Patterns/032 Count Unique Values Solution.mp423.08MB

05 Problem Solving Patterns/033 Sliding Window Pattern.mp4108.68MB

05 Problem Solving Patterns/034 Divide And Conquer Pattern.mp420.2MB

07 Recursion/040 Story Time_ Martin & The Dragon.mp417.37MB

07 Recursion/041 Why Use Recursion_.mp421.41MB

07 Recursion/042 The Call Stack.mp450.19MB

07 Recursion/043 Our First Recursive Function.mp420.71MB

07 Recursion/044 Our Second Recursive Function.mp437.34MB

07 Recursion/045 Writing Factorial Iteratively.mp48.78MB

07 Recursion/046 Writing Factorial Recursively.mp414.21MB

07 Recursion/047 Common Recursion Pitfalls.mp423.84MB

07 Recursion/048 Helper Method Recursion.mp427.25MB

07 Recursion/049 Pure Recursion.mp432.95MB

10 Searching Algorithms/056 Intro to Searching.mp421.51MB

10 Searching Algorithms/057 Intro to Linear Search.mp462.46MB

10 Searching Algorithms/058 Linear Search Solution.mp439.64MB

10 Searching Algorithms/059 Linear Search BIG O.mp43.93MB

10 Searching Algorithms/060 Intro to Binary Search.mp431MB

10 Searching Algorithms/061 Binary Search PseudoCode.mp47.84MB

10 Searching Algorithms/062 Binary Search Solution.mp4139.32MB

10 Searching Algorithms/063 Binary Search BIG O.mp425.89MB

10 Searching Algorithms/064 Naive String Search.mp411.93MB

10 Searching Algorithms/065 Naive String Search Implementation.mp462.86MB

11 Bubble Sort/068 Introduction to Sorting Algorithms.mp453.43MB

11 Bubble Sort/069 Built-In JavaScript Sorting.mp425.38MB

11 Bubble Sort/070 Bubble Sort_ Overview.mp420.93MB

11 Bubble Sort/071 Bubble Sort_ Implementation.mp452.3MB

11 Bubble Sort/072 Bubble Sort_ Optimization.mp434.73MB

11 Bubble Sort/073 Bubble Sort_ BIG O Complexity.mp48.32MB

12 Selection Sort/075 Selection Sort_ Introduction.mp417.03MB

12 Selection Sort/076 Selection Sort_ Implementation.mp475.48MB

12 Selection Sort/077 Selection Sort_ Big O Complexity.mp45.94MB

13 Insertion Sort/079 Insertion Sort_ Introduction.mp47.11MB

13 Insertion Sort/080 Insertion Sort_ Implementation.mp464.37MB

13 Insertion Sort/081 Insertion Sort_ BIG O Complexity.mp411.12MB

14 Comparing Bubble, Selection, and Insertion Sort/082 Comparing Bubble, Selection, and Insertion Sort.mp419.29MB

15 Merge Sort/084 Intro to the _Crazier_ Sorts.mp438.82MB

15 Merge Sort/085 Merge Sort_ Introduction.mp414.58MB

15 Merge Sort/086 Merging Arrays Intro.mp415.8MB

15 Merge Sort/087 Merging Arrays_ Implementation.mp424.64MB

15 Merge Sort/088 Writing Merge Sort Part 1.mp45.74MB

15 Merge Sort/089 Writing Merge Sort Part 2.mp466.76MB

15 Merge Sort/090 Merge Sort BIG O Complexity.mp433.07MB

16 Quick Sort/092 Introduction to Quick Sort.mp418.54MB

16 Quick Sort/093 Pivot Helper Introduction.mp432.93MB

16 Quick Sort/094 Pivot Helper Implementation.mp441.13MB

16 Quick Sort/095 Quick Sort Implementation.mp436.8MB

16 Quick Sort/096 Quick Sort Call Stack Walkthrough.mp443.97MB

16 Quick Sort/097 Quick Sort Big O Complexity.mp49.91MB

17 Radix Sort/099 Radix Sort_ Introduction.mp463.34MB

17 Radix Sort/100 Radix Sort_ Helper Methods.mp445.2MB

17 Radix Sort/101 Radix Sort_ Pseudocode.mp421.31MB

17 Radix Sort/102 Radix Sort_ Implementation.mp4107.26MB

17 Radix Sort/103 Radix Sort_ BIG O Complexity.mp455.65MB

18 Data Structures Introduction/104 Which Data Structure Is The Best_.mp436.84MB

18 Data Structures Introduction/105 ES2015 Class Syntax Overview.mp432.04MB

18 Data Structures Introduction/106 Data Structures_ The Class Keyword.mp423.17MB

18 Data Structures Introduction/107 Data Structures_ Adding Instance Methods.mp449.46MB

18 Data Structures Introduction/108 Data Structures_ Adding Class Methods.mp455.05MB

19 Singly Linked Lists/110 Intro to Singly Linked Lists.mp420.76MB

19 Singly Linked Lists/111 Starter Code and Push Intro.mp423.74MB

19 Singly Linked Lists/112 Singly Linked List_ Push Solution.mp421.16MB

19 Singly Linked Lists/113 Singly Linked List_ Pop Intro.mp422.28MB

19 Singly Linked Lists/114 Singly Linked List_ Pop Solution.mp452.62MB

19 Singly Linked Lists/115 Singly Linked List_ Shift Intro.mp44.12MB

19 Singly Linked Lists/116 Singly Linked List_ Shift Solution.mp413.7MB

19 Singly Linked Lists/117 Singly Linked List_ Unshift Intro.mp44.65MB

19 Singly Linked Lists/118 Singly Linked List_ Unshift Solution.mp429.46MB

19 Singly Linked Lists/119 Singly Linked List_ Get Intro.mp45.81MB

19 Singly Linked Lists/120 Singly Linked List_ Get Solution.mp414.27MB

19 Singly Linked Lists/121 Singly Linked List_ Set Intro.mp43.54MB

19 Singly Linked Lists/122 Singly Linked List_ Set Solution.mp48.24MB

19 Singly Linked Lists/123 Singly Linked List_ Insert Intro.mp421.65MB

19 Singly Linked Lists/124 Singly Linked List_ Insert Solution.mp430.37MB

19 Singly Linked Lists/125 Singly Linked List_ Remove Intro.mp45.46MB

19 Singly Linked Lists/126 Singly Linked List_ Remove Solution.mp415.86MB

19 Singly Linked Lists/127 Singly Linked List_ Reverse Intro.mp412.69MB

19 Singly Linked Lists/128 Singly Linked List_ Reverse Solution.mp444.51MB

19 Singly Linked Lists/129 Singly Linked List_ BIG O Complexity.mp416.18MB

20 Doubly Linked Lists/131 Doubly Linked Lists Introduction.mp412.73MB

20 Doubly Linked Lists/132 Setting Up Our Node Class.mp411.98MB

20 Doubly Linked Lists/133 Push.mp46.29MB

20 Doubly Linked Lists/134 Push Solution.mp415.27MB

20 Doubly Linked Lists/135 Pop.mp48.72MB

20 Doubly Linked Lists/136 Pop Solution.mp432.27MB

20 Doubly Linked Lists/137 Shift.mp47.94MB

20 Doubly Linked Lists/138 Shift Solution.mp421.15MB

20 Doubly Linked Lists/139 Unshift.mp44.77MB

20 Doubly Linked Lists/140 Unshift Solution.mp414.16MB

20 Doubly Linked Lists/141 Get.mp49.54MB

20 Doubly Linked Lists/142 Get Solution.mp439.53MB

20 Doubly Linked Lists/143 Set.mp43.35MB

20 Doubly Linked Lists/144 Set Solution.mp48.74MB

20 Doubly Linked Lists/145 Insert.mp47.72MB

20 Doubly Linked Lists/146 Insert Solution.mp435.2MB

20 Doubly Linked Lists/147 Remove.mp46.83MB

20 Doubly Linked Lists/148 Remove Solution.mp438.74MB

20 Doubly Linked Lists/149 Comparing Singly and Doubly Linked Lists.mp412.46MB

21 Stacks + Queues/151 Intro to Stacks.mp422.73MB

21 Stacks + Queues/152 Creating a Stack with an Array.mp421.92MB

21 Stacks + Queues/153 Writing Our Own Stack From Scratch.mp455.43MB

21 Stacks + Queues/154 BIG O of Stacks.mp48.2MB

21 Stacks + Queues/155 Intro to Queues.mp412.18MB

21 Stacks + Queues/156 Creating Queues Using Arrays.mp413.01MB

21 Stacks + Queues/157 Writing Our Own Queue From Scratch.mp480.22MB

21 Stacks + Queues/158 BIG O of Queues.mp46.12MB

22 Binary Search Trees/160 Introduction to Trees.mp422.85MB

22 Binary Search Trees/161 Uses For Trees.mp475.32MB

22 Binary Search Trees/162 Intro to Binary Trees.mp420.31MB

22 Binary Search Trees/163 POP QUIZ!.mp43.1MB

22 Binary Search Trees/164 Searching A Binary Search Tree.mp411.06MB

22 Binary Search Trees/165 Our Tree Classes.mp49.23MB

22 Binary Search Trees/166 BST_ Insert.mp411.71MB

22 Binary Search Trees/167 BST_ Insert Solution.mp451.58MB

22 Binary Search Trees/168 BST_ Find.mp419.82MB

22 Binary Search Trees/169 BST_ Find Solution.mp425MB

22 Binary Search Trees/170 Big O of Binary Search Trees.mp424.51MB

23 Tree Traversal/172 Intro To Tree Traversal.mp412.61MB

23 Tree Traversal/173 Breadth First Search Intro.mp415.21MB

23 Tree Traversal/174 Breadth First Search Solution.mp429.17MB

23 Tree Traversal/175 Depth First PreOrder Intro.mp416.94MB

23 Tree Traversal/176 Depth First PreOrder Solution.mp460.12MB

23 Tree Traversal/177 Depth First PostOrder Intro.mp414.89MB

23 Tree Traversal/178 Depth First PostOrder Solution.mp49.98MB

23 Tree Traversal/179 Depth First InOrder Intro.mp46.19MB

23 Tree Traversal/180 Depth First InOrder Solution.mp49.86MB

23 Tree Traversal/181 When to Use BFS and DFS.mp423.02MB

24 Binary Heaps/183 Intro to Heaps.mp430.45MB

24 Binary Heaps/184 Storing Heaps.mp422.96MB

24 Binary Heaps/185 Heap_ Insert Intro.mp435.14MB

24 Binary Heaps/186 Heap_ Insert Solution.mp476.9MB

24 Binary Heaps/187 Heap_ ExtractMax Intro.mp436.98MB

24 Binary Heaps/188 Heap_ ExtractMax Solution.mp472.49MB

24 Binary Heaps/189 Priority Queue Intro.mp489.41MB

24 Binary Heaps/190 Priority Queue Pseudocode.mp410.45MB

24 Binary Heaps/191 Priority Queue Solution.mp474.6MB

24 Binary Heaps/192 BIG O of Binary Heaps.mp426.84MB

25 Hash Tables/194 Intro to Hash Tables.mp418.24MB

25 Hash Tables/195 More About Hash Tables.mp410.81MB

25 Hash Tables/196 Intro to Hash Functions.mp443.58MB

25 Hash Tables/197 Writing Our First Hash Function.mp426.1MB

25 Hash Tables/198 Improving Our Hash Function.mp453.87MB

25 Hash Tables/199 Handling Collisions.mp49.61MB

25 Hash Tables/200 Hash Table Set and Get.mp411.71MB

25 Hash Tables/201 Hash Table Set Solution.mp431.64MB

25 Hash Tables/202 Hash Table Get Solution.mp426.17MB

25 Hash Tables/203 Hash Table Keys and Values.mp44.15MB

25 Hash Tables/204 Hash Table Keys and Values Solution.mp485.96MB

25 Hash Tables/205 Hash Table Big O Complexity.mp415.1MB

26 Graphs/207 Intro to Graphs.mp427.28MB

26 Graphs/208 Uses for Graphs.mp4148.13MB

26 Graphs/209 Types of Graphs.mp453.95MB

26 Graphs/210 Storing Graphs_ Adjacency Matrix.mp435.63MB

26 Graphs/211 Storing Graphs_ Adjacency List.mp47.99MB

26 Graphs/212 Adjacency Matrix Vs. List BIG O.mp429.03MB

26 Graphs/213 Add Vertex Intro.mp46.84MB

26 Graphs/214 Add Vertex Solution.mp49.5MB

26 Graphs/215 Add Edge Intro.mp46.4MB

26 Graphs/216 Add Edge Solution.mp410.14MB

26 Graphs/217 Remove Edge Intro.mp44.47MB

26 Graphs/218 Remove Edge Solution.mp413.36MB

26 Graphs/219 Remove Vertex Intro.mp48.02MB

26 Graphs/220 Remove Vertex Solution.mp425.67MB

27 Graph Traversal/222 Intro to Graph Traversal.mp433.92MB

27 Graph Traversal/223 Depth First Graph Traversal.mp421.75MB

27 Graph Traversal/224 DFS Recursive Intro.mp464.54MB

27 Graph Traversal/225 DFS Recursive Solution.mp482.4MB

27 Graph Traversal/226 DFS Iterative Intro.mp416.79MB

27 Graph Traversal/227 DFS Iterative Solution.mp466.64MB

27 Graph Traversal/228 Breadth First Graph Traversal.mp47.99MB

27 Graph Traversal/229 BFS Intro.mp47.4MB

27 Graph Traversal/230 BFS Solution.mp433.92MB

28 Dijkstra's Algorithm!/232 Intro to Dijkstra's and Prerequisites.mp47.96MB

28 Dijkstra's Algorithm!/233 Who was Dijkstra and what is his Algorithm_.mp439.27MB

28 Dijkstra's Algorithm!/234 Writing a Weighted Graph.mp421.45MB

28 Dijkstra's Algorithm!/235 Walking through the Algorithm.mp463.64MB

28 Dijkstra's Algorithm!/236 Introducing Our Simple Priority Queue.mp419.94MB

28 Dijkstra's Algorithm!/237 Dijkstra's Pseudo-Code.mp445.28MB

28 Dijkstra's Algorithm!/239 Upgrading the Priority Queue.mp425.9MB

29 Dynamic Programming/240 Intro to Dynamic Programming.mp441.56MB

29 Dynamic Programming/241 Overlapping Subproblems.mp422.9MB

29 Dynamic Programming/242 Optimal Substructure.mp420.47MB

29 Dynamic Programming/243 Writing A Recursive Solution.mp417.61MB

29 Dynamic Programming/244 Time Complexity of Our Solution.mp446.11MB

29 Dynamic Programming/245 The Problem With Our Solution.mp414.06MB

29 Dynamic Programming/246 Enter Memoization!.mp439.75MB

29 Dynamic Programming/247 Time Complexity of Memoized Solution.mp411.64MB

29 Dynamic Programming/248 Tabulation_ A Bottom Up Approach.mp433.63MB