-
Урок 1.
00:04:08
Course Introduction
-
Урок 2.
00:03:50
Introduction to Algorithms
-
Урок 3.
00:01:15
Section Introduction
-
Урок 4.
00:07:42
Complexity Analysis 1
-
Урок 5.
00:14:04
Complexity Analysis 2
-
Урок 6.
00:01:14
Section Summary
-
Урок 7.
00:00:38
Section Introduction
-
Урок 8.
00:05:39
Recurrence Relation
-
Урок 9.
00:11:19
Solving Recurrence Relation
-
Урок 10.
00:05:36
Master's Theorem
-
Урок 11.
00:00:31
Section Summary
-
Урок 12.
00:01:57
Section Introduction
-
Урок 13.
00:07:01
Recursion
-
Урок 14.
00:06:10
Identification
-
Урок 15.
00:04:36
Approaching
-
Урок 16.
00:04:07
Problem 01 : FindingSubsequences - Logic
-
Урок 17.
00:05:40
Problem 01 : FindingSubsequences - Live Code Java
-
Урок 18.
00:02:21
Problem 01 : FindingSubsequences - Complexity Analysis
-
Урок 19.
00:05:39
Problem 02: Tower of Hanoi - Logic
-
Урок 20.
00:04:49
Problem 02 : Tower of Hanoi - Live Code Java
-
Урок 21.
00:11:11
Problem 02 : Tower of Hanoi - Complexity Analysis
-
Урок 22.
00:04:32
Problem 03 : 7.Array Product Sum - Logic
-
Урок 23.
00:05:00
Problem 03 : 7.Array Product Sum - Live Code Java
-
Урок 24.
00:01:08
Problem 03 : Array Product Sum - Complexity Analysis
-
Урок 25.
00:06:23
Problem 04 : Binary Subtree - Logic
-
Урок 26.
00:08:25
Problem 04 : Binary Subtree - Live Code Java
-
Урок 27.
00:00:58
Problem 04 : Binary Subtree - Complexity Analysis
-
Урок 28.
00:01:19
Why and Why not Recursion
-
Урок 29.
00:04:02
Types Of Recursion
-
Урок 30.
00:05:19
Tail Recursion
-
Урок 31.
00:01:01
Section Summary
-
Урок 32.
00:01:28
Section Introduction
-
Урок 33.
00:01:45
Introduction to Backtracking
-
Урок 34.
00:03:04
Identify Backtracking
-
Урок 35.
00:09:37
Approching the Solution
-
Урок 36.
00:08:41
Problem 01 : Rat In Maze - Logic
-
Урок 37.
00:08:45
Problem 01 : Rat In Maze - Code
-
Урок 38.
00:01:20
Problem 01 : Rat In Maze - Complexity Analysis
-
Урок 39.
00:08:44
Problem 02 : NQueen - Logic
-
Урок 40.
00:08:10
Problem 02 : NQueen - Live Code in Java
-
Урок 41.
00:02:09
Problem 02 : NQueen - Complexity Analysis
-
Урок 42.
00:05:02
Problem 03 : Knights Tour Problem - Logic
-
Урок 43.
00:07:01
Problem 03 : Knights Tour Problem - Live Code in Java
-
Урок 44.
00:00:52
Problem 03 : Knight Tour Problem - Complexity Analysis
-
Урок 45.
00:05:49
Problem 04 : Boggle | Word Search - Logic
-
Урок 46.
00:07:44
Problem 04 : Boggle | Word Search - Live Code in Java
-
Урок 47.
00:00:53
Problem 04 : Boggle | Word Search - Complexity Analysis
-
Урок 48.
00:01:10
Section Summary
-
Урок 49.
00:00:45
Section Introduction
-
Урок 50.
00:03:16
Introduction To Divide And Conquer
-
Урок 51.
00:03:33
Identification and Approaching
-
Урок 52.
00:09:34
Problem 01 : MergeSort - Logic
-
Урок 53.
00:08:43
Problem 01 : MergeSort - Live Java Code
-
Урок 54.
00:04:22
Problem 01 : MergeSort - Complexity Analysis
-
Урок 55.
00:11:06
Problem 02 : QuickSort - Logic
-
Урок 56.
00:06:13
Problem 02 : QuickSort - Live Java Code
-
Урок 57.
00:02:30
Problem 02 : QuickSort - Complexity Analysis
-
Урок 58.
00:09:01
Problem 03 : Median Of Medians - Logic
-
Урок 59.
00:14:53
Problem 03 : Median Of Medians - Live Java Code
-
Урок 60.
00:00:43
Section Summary
-
Урок 61.
00:00:57
Section Introduction
-
Урок 62.
00:05:23
Introduction to Greedy
-
Урок 63.
00:03:08
Identification & Approaching the Solution
-
Урок 64.
00:06:24
Problem 01 : Fractional Knapsack - Logic
-
Урок 65.
00:09:37
Problem 01 : Fractional Knapsack - Live Code Java
-
Урок 66.
00:00:58
Problem 01 : Fractional Knapsack - Complexity Analysis
-
Урок 67.
00:03:12
Problem 02 : IntervalScheduling - Logic
-
Урок 68.
00:07:48
Problem 02 : IntervalScheduling - Live Code Java
-
Урок 69.
00:01:39
Problem 02 : IntervalScheduling - Complexity Analysis
-
Урок 70.
00:12:27
Problem 03 : Huffman Code - Logic
-
Урок 71.
00:19:04
Problem 03 : Huffman Code - Live Code Java
-
Урок 72.
00:01:50
Problem 03 : Huffman Code - Complexity Analysis
-
Урок 73.
00:09:22
Problem 04 : Dijkstra - Logic
-
Урок 74.
00:08:59
Problem 04 : Dijkstra Logic - Live Code
-
Урок 75.
00:01:02
Problem 04 : Dijkstra - Complexity Analysis
-
Урок 76.
00:00:43
Summary
-
Урок 77.
00:02:16
Section Introduction
-
Урок 78.
00:05:25
Introduction to Dynamic Programming
-
Урок 79.
00:01:20
Identification
-
Урок 80.
00:03:15
Compare DP D&C and Greedy
-
Урок 81.
00:03:44
Approaching the Solution
-
Урок 82.
00:15:42
Example 01 : Staircase Problem Theory & Live Code
-
Урок 83.
00:03:05
Example 01 : Staircase Problem Complexity Analysis
-
Урок 84.
00:26:36
Example 02 - 0/1 Knapsack Theory & Live code
-
Урок 85.
00:02:46
Example 02 - 0/1 Knapsack Complexity Analysis
-
Урок 86.
00:25:35
Example 03 - Coin Change Problem Theory and Code
-
Урок 87.
00:03:57
Example 03 - Coin Change Problem Complexity Analysis
-
Урок 88.
00:27:55
Example 04 : Longest Decreasing Subsequence Explanation And Code
-
Урок 89.
00:01:37
Example 04 : Longest Decreasing Subsequence | Complexity Analysis
-
Урок 90.
00:23:29
Example 05 : Levenshtein problem
-
Урок 91.
00:01:54
Example 05 : Levenshtein Complexity Analysis
-
Урок 92.
00:18:16
Example 06 : Rod Cutting
-
Урок 93.
00:01:42
Example 06 : Rod Cutting - Complexity Analysis
-
Урок 94.
00:26:10
Example 07 : Matrix Chain Multiplication
-
Урок 95.
00:02:31
Example 07 : Matrix Chain Multiplication | Complexity Analysis
-
Урок 96.
00:00:44
Summary
-
Урок 97.
00:07:40
Kadane's Algo
-
Урок 98.
00:03:35
Kadane's Algo Live Code Java
-
Урок 99.
00:00:34
Kadane's Algo Complexity Analysis
-
Урок 100.
00:06:47
BellmanFord's Algo
-
Урок 101.
00:11:20
BellmanFord's Algo Live Code Java
-
Урок 102.
00:00:52
BellmanFord's Algo Complexity Analysis
-
Урок 103.
00:06:32
Topological Sort : Kahn's Algo
-
Урок 104.
00:13:54
Topological Sort Live Code Java
-
Урок 105.
00:01:48
Topological Sort Complexity Analysis
-
Урок 106.
00:26:35
Edmond's Karp/Ford-Fulkerson Algorithm
-
Урок 107.
00:20:16
Ford-Fulkerson Algorithm - Edmond's Karp Implementation
-
Урок 108.
00:23:28
Tree Overview
-
Урок 109.
00:02:02
Identification
-
Урок 110.
00:04:36
Approaching Tree Problems
-
Урок 111.
00:09:29
Problem 1: Sum Tree - Logic
-
Урок 112.
00:04:55
Problem 1: Sum Tree - Live Code
-
Урок 113.
00:02:20
Problem 2: Invert Binary Tree - Logic
-
Урок 114.
00:03:53
Problem 2: Invert Binary Tree - Live Code
-
Урок 115.
00:11:46
Problem 3: Binary Search Tree - Logic
-
Урок 116.
00:16:19
Problem 3: Binary Search Tree - Live Code
-
Урок 117.
00:03:47
Problem 4: Binary Tree from InOrder & LevelOrder - Logic
-
Урок 118.
00:07:50
Problem 4: Binary Tree from InOrder & LevelOrder - Live Code
-
Урок 119.
00:04:57
Graphs - In Real World
-
Урок 120.
00:11:54
Graphs - Overview
-
Урок 121.
00:03:54
Identification of Problem
-
Урок 122.
00:09:13
Approaching the Problem
-
Урок 123.
00:02:36
Mind-Map
-
Урок 124.
00:02:29
Type - Graph Traversal
-
Урок 125.
00:06:18
Depth First Search Traversal
-
Урок 126.
00:07:07
DFS - Implementation (Recursive)
-
Урок 127.
00:04:50
DFS - Implementation (Iterative)
-
Урок 128.
00:03:27
Breadth First Search Traversal
-
Урок 129.
00:04:59
BFS - Implementation
-
Урок 130.
00:05:30
Type - Minimum Spanning Tree
-
Урок 131.
00:09:29
Prim's Algorithm
-
Урок 132.
00:07:34
Prim's Algorithm - Implementation
-
Урок 133.
00:03:56
Kruskal's Algorithm
-
Урок 134.
00:08:10
Union-Find Algorithm
-
Урок 135.
00:13:15
Kruskal's Algorithm - Implementation
-
Урок 136.
00:01:17
Type - Shortest Path
-
Урок 137.
00:09:22
Dijkstra's Algorithm
-
Урок 138.
00:08:59
Dijkstra's Algorithm - Implementation
-
Урок 139.
00:06:47
BellmanFord's Algo
-
Урок 140.
00:11:20
BellmanFord's Algo Live Code
-
Урок 141.
00:06:46
Floyd Warshall Algorithm
-
Урок 142.
00:05:47
Floyd-Warshall Algorithm - Implementation
-
Урок 143.
00:15:41
Johnson's Algorithm
-
Урок 144.
00:20:23
Johnson's Algorithm - Implementation
-
Урок 145.
00:04:40
Type - Network Flow
-
Урок 146.
00:26:35
Ford-Fulkerson Algorithm
-
Урок 147.
00:20:16
Ford-Fulkerson Algorithm - Edmond's Karp Implementation
-
Урок 148.
00:05:46
Max-Flow Min-Cut Theorem
-
Урок 149.
00:02:50
Type - Strongly Connected Components
-
Урок 150.
00:09:55
Tarjan's Algorithm
-
Урок 151.
00:12:25
Tarjan's Algorithm - Implementation
-
Урок 152.
00:06:07
Kosaraju's Algorithm
-
Урок 153.
00:11:01
Kosaraju's Algorithm - Implementation
-
Урок 154.
00:01:20
Section Introduction
-
Урок 155.
00:13:14
Single Dimension Arrays
-
Урок 156.
00:12:43
Multi Dimension Arrays
-
Урок 157.
00:19:04
Declaration , Initialisation & Creation
-
Урок 158.
00:10:49
Playing With Arrays Syntax Java
-
Урок 159.
00:13:35
Traversing Arrays,Length of Array Java
-
Урок 160.
00:11:53
Types of Array - based on elements it holds
-
Урок 161.
00:13:17
Reassigning Array Objects to Array References
-
Урок 162.
00:03:50
Anonymous Arrays
-
Урок 163.
00:00:49
Arrays-Summay