Mastering critical SKILLS in Algorithms using C++: Part 2

Almost all other courses focus on knowledge. In this course, we focus on gaining real skills. Overall:The course covers a good subset of algorthmic topicsLearn the inner details of the algorithms and their time & memory complexity analysisLearn how to code line-by-lineSource code and Slides and provided for all contentAn extensive amount of practice to master the taught algorithms (where most other content fails!)Content:Dynamic Programming: IntroDP: Pick or Leave PatternDP: Enumerating the choicesDP Range PatternsDP on Graph and GridsDP CountingDP: Printing SolutionDP TabulationDP Solving MarathonBacktrackingDivide and ConquerShortest Path Algorithm: Floyd-WarshalShortest Path Algorithm: Bellman-FordShortest Path Algorithm: DijkstraMinimum Spanning Tree: PrimMinimum Spanning Tree: KruskalTeaching Style:Instead of long theory then coding style, we follow a unique styleI parallelize the concepts with the codes as much as possibleUnless better for you to work on pseudocode firstGo Concrete as possibleUse Clear Simple VisualizationEngagement By the end of the journeySolid understanding of Algorithms topics in C++Mastering different skillsAnalytical and P