Это пробный урок. Оформите подписку, чтобы получить доступ ко всем материалам курса. Премиум

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