种子简介

种子名称： [Udemy] Algorithms in Java Live problem solving & Design Techniques (2021) [EN]
文件类型： 视频
文件数目： 163个文件
文件大小： 4.49 GB
收录时间： 2022-5-25 10:43
已经下载： 3次
资源热度： 203
最近下载： 2024-6-6 20:39

下载BT种子文件

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

磁力链接下载

magnet:?xt=urn:btih:481344b968c960e1a48600deab1e4d5da3a6e6cf&dn=[Udemy] Algorithms in Java Live problem solving & Design Techniques (2021) [EN] 复制链接到迅雷、QQ旋风进行下载，或者使用百度云离线下载。

喜欢这个种子的人也喜欢

种子包含的文件

[Udemy] Algorithms in Java Live problem solving & Design Techniques (2021) [EN].torrent

01 - Course Introduction/001 Course Introduction.mp424.89MB

02 - Introduction to Algorithms/001 Introduction to Algorithms.mp412.22MB

03 - Complexity Analysis/001 Section Introduction.mp43.68MB

03 - Complexity Analysis/002 Complexity Analysis 1.mp414.77MB

03 - Complexity Analysis/003 Complexity Analysis 2.mp425.18MB

03 - Complexity Analysis/004 Section Summary.mp42.15MB

04 - Recurrence Relation/001 Section Introduction.mp41.09MB

04 - Recurrence Relation/002 Recurrence Relation.mp48.37MB

04 - Recurrence Relation/003 Solving Recurrence Relation.mp416.99MB

04 - Recurrence Relation/004 Master's Theorem.mp48.52MB

04 - Recurrence Relation/005 Section Summary.mp4930.29KB

05 - Thinking Recursively/001 Section Introduction.mp43.11MB

05 - Thinking Recursively/002 Recursion.mp412.86MB

05 - Thinking Recursively/003 Identification.mp411.26MB

05 - Thinking Recursively/004 Approaching.mp48.1MB

05 - Thinking Recursively/005 Problem 01 FindingSubsequences - Logic.mp47.11MB

05 - Thinking Recursively/006 Problem 01 FindingSubsequences - Live Code Java.mp429.53MB

05 - Thinking Recursively/007 Problem 01 FindingSubsequences - Complexity Analysis.mp44.53MB

05 - Thinking Recursively/008 Problem 02 Tower of Hanoi - Logic.mp48.84MB

05 - Thinking Recursively/009 Problem 02 Tower of Hanoi - Live Code Java.mp422.88MB

05 - Thinking Recursively/010 Problem 02 Tower of Hanoi - Complexity Analysis.mp414.55MB

05 - Thinking Recursively/011 Problem 03 7.Array Product Sum - Logic.mp47.75MB

05 - Thinking Recursively/012 Problem 03 7.Array Product Sum - Live Code Java.mp423.6MB

05 - Thinking Recursively/013 Problem 03 Array Product Sum - Complexity Analysis.mp41.55MB

05 - Thinking Recursively/014 Problem 04 Binary Subtree - Logic.mp412.33MB

05 - Thinking Recursively/015 Problem 04 Binary Subtree - Live Code Java.mp451.24MB

05 - Thinking Recursively/016 Problem 04 Binary Subtree - Complexity Analysis.mp41.48MB

05 - Thinking Recursively/017 Why and Why not Recursion.mp41.96MB

05 - Thinking Recursively/018 Types Of Recursion.mp46.27MB

05 - Thinking Recursively/019 Tail Recursion.mp48.59MB

05 - Thinking Recursively/020 Section Summary.mp41.73MB

06 - Backtracking/001 Section Introduction.mp42.31MB

06 - Backtracking/002 Introduction to Backtracking.mp43.44MB

06 - Backtracking/003 Identify Backtracking.mp45.62MB

06 - Backtracking/004 Approching the Solution.mp416.27MB

06 - Backtracking/005 Problem 01 Rat In Maze - Logic.mp415.38MB

06 - Backtracking/006 Problem 01 Rat In Maze - Code.mp450.66MB

06 - Backtracking/007 Problem 01 Rat In Maze - Complexity Analysis.mp42.1MB

06 - Backtracking/008 Problem 02 NQueen - Logic.mp417.31MB

06 - Backtracking/009 Problem 02 NQueen - Live Code in Java.mp447.78MB

06 - Backtracking/010 Problem 02 NQueen - Complexity Analysis.mp44.2MB

06 - Backtracking/011 Problem 03 Knights Tour Problem - Logic.mp410.7MB

06 - Backtracking/012 Problem 03 Knights Tour Problem - Live Code in Java.mp443.31MB

06 - Backtracking/013 Problem 03 Knight Tour Problem - Complexity Analysis.mp41.32MB

06 - Backtracking/014 Problem 04 Boggle Word Search - Logic.mp411.92MB

06 - Backtracking/015 Problem 04 Boggle Word Search - Live Code in Java.mp442.92MB

06 - Backtracking/016 Problem 04 Boggle Word Search - Complexity Analysis.mp41.16MB

06 - Backtracking/017 Section Summary.mp41.85MB

07 - Divide and Conquer/001 Section Introduction.mp41.32MB

07 - Divide and Conquer/002 Introduction To Divide And Conquer.mp46.33MB

07 - Divide and Conquer/003 Identification and Approaching.mp46.1MB

07 - Divide and Conquer/004 Problem 01 MergeSort - Logic.mp419.14MB

07 - Divide and Conquer/005 Problem 01 MergeSort - Live Java Code.mp437.02MB

07 - Divide and Conquer/006 Problem 01 MergeSort - Complexity Analysis.mp46.72MB

07 - Divide and Conquer/007 Problem 02 QuickSort - Logic.mp421.36MB

07 - Divide and Conquer/008 Problem 02 QuickSort - Live Java Code.mp434.53MB

07 - Divide and Conquer/009 Problem 02 QuickSort - Complexity Analysis.mp43.85MB

07 - Divide and Conquer/010 Problem 03 Median Of Medians - Logic.mp416.64MB

07 - Divide and Conquer/011 Problem 03 Median Of Medians - Live Java Code.mp498.4MB

07 - Divide and Conquer/012 Section Summary.mp41.26MB

08 - Greedy Technique/001 Section Introduction.mp41.57MB

08 - Greedy Technique/002 Introduction to Greedy.mp48.52MB

08 - Greedy Technique/003 Identification & Approaching the Solution.mp45.81MB

08 - Greedy Technique/004 Problem 01 Fractional Knapsack - Logic.mp410.95MB

08 - Greedy Technique/005 Problem 01 Fractional Knapsack - Live Code Java.mp452.22MB

08 - Greedy Technique/006 Problem 01 Fractional Knapsack - Complexity Analysis.mp41.41MB

08 - Greedy Technique/007 Problem 02 IntervalScheduling - Logic.mp45.72MB

08 - Greedy Technique/008 Problem 02 IntervalScheduling - Live Code Java.mp442.55MB

08 - Greedy Technique/009 Problem 02 IntervalScheduling - Complexity Analysis.mp42.3MB

08 - Greedy Technique/010 Problem 03 Huffman Code - Logic.mp422.53MB

08 - Greedy Technique/011 Problem 03 Huffman Code - Live Code Java.mp4118.22MB

08 - Greedy Technique/012 Problem 03 Huffman Code - Complexity Analysis.mp43.75MB

08 - Greedy Technique/013 Problem 04 Dijkstra - Logic.mp421.1MB

08 - Greedy Technique/014 Problem 04 Dijkstra Logic - Live Code.mp454.92MB

08 - Greedy Technique/015 Problem 04 Dijkstra - Complexity Analysis.mp42.01MB

08 - Greedy Technique/016 Summary.mp41.31MB

09 - Dynamic Programming/001 Section Introduction.mp44.31MB

09 - Dynamic Programming/002 Introduction to Dynamic Programming.mp49.48MB

09 - Dynamic Programming/003 Identification.mp42.49MB

09 - Dynamic Programming/004 Compare DP D&C and Greedy.mp45.85MB

09 - Dynamic Programming/005 Approaching the Solution.mp46.12MB

09 - Dynamic Programming/006 Example 01 Staircase Problem Theory & Live Code.mp455.15MB

09 - Dynamic Programming/007 Example 01 Staircase Problem Complexity Analysis.mp44.57MB

09 - Dynamic Programming/008 Example 02 - 01 Knapsack Theory & Live code.mp4101.57MB

09 - Dynamic Programming/009 Example 02 - 01 Knapsack Complexity Analysis.mp43.86MB

09 - Dynamic Programming/010 Example 03 - Coin Change Problem Theory and Code.mp493.03MB

09 - Dynamic Programming/011 Example 03 - Coin Change Problem Complexity Analysis.mp45.67MB

09 - Dynamic Programming/012 Example 04 Longest Decreasing Subsequence Explanation And Code.mp4206.25MB

09 - Dynamic Programming/013 Example 04 Longest Decreasing Subsequence Complexity Analysis.mp42.24MB

09 - Dynamic Programming/014 Example 05 Levenshtein problem.mp4207.76MB

09 - Dynamic Programming/015 Example 05 Levenshtein Complexity Analysis.mp43.04MB

09 - Dynamic Programming/016 Example 06 Rod Cutting.mp479.47MB

09 - Dynamic Programming/017 Example 06 Rod Cutting - Complexity Analysis.mp42.79MB

09 - Dynamic Programming/018 Example 07 Matrix Chain Multiplication.mp4109.27MB

09 - Dynamic Programming/019 Example 07 Matrix Chain Multiplication Complexity Analysis.mp44.83MB

09 - Dynamic Programming/020 Summary.mp41.71MB

10 - Famous Algorithms/001 Kadane's Algo.mp411.84MB

10 - Famous Algorithms/002 Kadane's Algo Live Code Java.mp416.42MB

10 - Famous Algorithms/003 Kadane's Algo Complexity Analysis.mp4708.98KB

10 - Famous Algorithms/004 BellmanFord's Algo.mp412.22MB

10 - Famous Algorithms/005 BellmanFord's Algo Live Code Java.mp456.34MB

10 - Famous Algorithms/006 BellmanFord's Algo Complexity Analysis.mp41.2MB

10 - Famous Algorithms/007 Topological Sort Kahn's Algo.mp49.43MB

10 - Famous Algorithms/008 Topological Sort Live Code Java.mp474.91MB

10 - Famous Algorithms/009 Topological Sort Complexity Analysis.mp42.33MB

10 - Famous Algorithms/010 Edmond's KarpFord-Fulkerson Algorithm.mp452.7MB

10 - Famous Algorithms/011 Ford-Fulkerson Algorithm - Edmond's Karp Implementation.mp4120.1MB

11 - Trees/001 Tree Overview.mp448.39MB

11 - Trees/002 Identification.mp43.55MB

11 - Trees/003 Approaching Tree Problems.mp48.42MB

11 - Trees/004 Problem 1 Sum Tree - Logic.mp417.03MB

11 - Trees/005 Problem 1 Sum Tree - Live Code.mp424.26MB

11 - Trees/006 Problem 2 Invert Binary Tree - Logic.mp44.99MB

11 - Trees/007 Problem 2 Invert Binary Tree - Live Code.mp420.92MB

11 - Trees/008 Problem 3 Binary Search Tree - Logic.mp426.34MB

11 - Trees/009 Problem 3 Binary Search Tree - Live Code.mp481.6MB

11 - Trees/010 Problem 4 Binary Tree from InOrder & LevelOrder - Logic.mp46.82MB

11 - Trees/011 Problem 4 Binary Tree from InOrder & LevelOrder - Live Code.mp447.94MB

12 - Graphs/001 Graphs - In Real World.mp419.2MB

12 - Graphs/003 Graphs - Overview.mp424.77MB

12 - Graphs/005 Identification of Problem.mp47.13MB

12 - Graphs/006 Approaching the Problem.mp418.76MB

12 - Graphs/007 Mind-Map.mp44.14MB

12 - Graphs/008 Type - Graph Traversal.mp45.21MB

12 - Graphs/009 Depth First Search Traversal.mp415.01MB

12 - Graphs/010 DFS - Implementation (Recursive).mp437.54MB

12 - Graphs/011 DFS - Implementation (Iterative).mp428.04MB

12 - Graphs/012 Breadth First Search Traversal.mp48.52MB

12 - Graphs/013 BFS - Implementation.mp429.56MB

12 - Graphs/014 Type - Minimum Spanning Tree.mp414.9MB

12 - Graphs/015 Prim's Algorithm.mp419.24MB

12 - Graphs/016 Prim's Algorithm - Implementation.mp437.5MB

12 - Graphs/017 Kruskal's Algorithm.mp49.39MB

12 - Graphs/018 Union-Find Algorithm.mp414.34MB

12 - Graphs/019 Kruskal's Algorithm - Implementation.mp479.57MB

12 - Graphs/020 Type - Shortest Path.mp45.75MB

12 - Graphs/021 Dijkstra's Algorithm.mp421.1MB

12 - Graphs/022 Dijkstra's Algorithm - Implementation.mp454.92MB

12 - Graphs/023 BellmanFord's Algo.mp412.22MB

12 - Graphs/024 BellmanFord's Algo Live Code.mp456.35MB

12 - Graphs/025 Floyd Warshall Algorithm.mp413.99MB

12 - Graphs/026 Floyd-Warshall Algorithm - Implementation.mp431.96MB

12 - Graphs/027 Johnson's Algorithm.mp430.17MB

12 - Graphs/028 Johnson's Algorithm - Implementation.mp4117.58MB

12 - Graphs/029 Type - Network Flow.mp410.01MB

12 - Graphs/030 Ford-Fulkerson Algorithm.mp452.7MB

12 - Graphs/031 Ford-Fulkerson Algorithm - Edmond's Karp Implementation.mp4120.07MB

12 - Graphs/032 Max-Flow Min-Cut Theorem.mp415.61MB

12 - Graphs/033 Type - Strongly Connected Components.mp44.35MB

12 - Graphs/034 Tarjan's Algorithm.mp422.51MB

12 - Graphs/035 Tarjan's Algorithm - Implementation.mp483.32MB

12 - Graphs/036 Kosaraju's Algorithm.mp413.44MB

12 - Graphs/037 Kosaraju's Algorithm - Implementation.mp477.17MB

13 - Bonus Arrays in Java/001 Section Introduction.mp44.37MB

13 - Bonus Arrays in Java/002 Single Dimension Arrays.mp495.98MB

13 - Bonus Arrays in Java/003 Multi Dimension Arrays.mp494.29MB

13 - Bonus Arrays in Java/004 Declaration , Initialisation & Creation.mp4112.48MB

13 - Bonus Arrays in Java/005 Playing With Arrays Syntax Java.mp497.88MB

13 - Bonus Arrays in Java/006 Traversing Arrays,Length of Array Java.mp487.05MB

13 - Bonus Arrays in Java/007 Types of Array - based on elements it holds.mp470.66MB

13 - Bonus Arrays in Java/008 Reassigning Array Objects to Array References.mp488.16MB

13 - Bonus Arrays in Java/009 Anonymous Arrays.mp425.75MB

13 - Bonus Arrays in Java/010 Arrays-Summay.mp43.05MB