Starting a new Lecture Notes Series on Algorithms
.png)
.png)
Youtube Lecture Playlist CreditsChannel Name: IEMDaily - Video Lecture Notes (English)
So Let Us Start to This Journey of Learning
Algorithms By Lecture Notes together!
Lecture 85: 85. GATE 2009 DP Visualized
Lecture 86: 86. Multi Stage Graph Optimization
Lecture 87: 87. Dynamic Programming Essentials
Lecture 88: 88. Visual Bottom Up DP
Lecture 89: 89. The Knapsack Dilemma
Lecture 90: 90. The Greedy Trap
Lecture 91: 91. Knapsack Substructure
Lecture 92: 92. Optimizing the Knapsack
Lecture 93: 93. Bottom Up Knapsack
Lecture 94: 94. Visualizing Knapsack DP
Lecture 95: 95. Solving Subset Sum
Lecture 96: 96. Mapping Subset Sum
Lecture 97: 97. Solving the Traveling Salesman
Lecture 98: 98. Solving the Salesman
Lecture 99: 99. Solving TSP with Dynamic Programming
Lecture 100: 100. Scaling Shortest Paths
Lecture 101: 101. All Pairs Shortest Paths
Lecture 107: 107. When Simple Code Hides Complex Time!
Lecture 111: 111. The $1M Computer Mystery: P vs NP Explained
Lecture 112: 112. Polynomial Time Reduction
Lecture 113: 113. Mapping Complexity
Lecture 114: 114. NP Completeness Decoded
Lecture 115: 115. The Direction of Reduction
Lecture 116: 116. Deceptive Complexity
Lecture 117: 117. Complexity Deconstructed
Lecture 118: 118. Decoding NP Logic
Lecture 119: 119. Complexity Truths
Lecture 120: 120. Identifying the NP Hard Outlier
Lecture 121: 121. SH3 NP Completeness
Lecture 122: 122. The NPC Subset
Lecture 123: 122. The NPC Subset
Lecture 124: 124. Decoding NP Logic
Lecture 125: 125. NP Closure
