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 topics

Learn the inner details of the algorithms and their time & memory complexity analysis

Learn how to code line–by–line

Source code and Slides and provided for all content

An extensive amount of practice to master the taught algorithms (where most other content fails!)

Content:

Dynamic Programming: Intro

DP: Pick or Leave Pattern

DP: Enumerating the choices

Coming

DP Range Patterns

DP on Graph and Grids

DP Counting

DP: Printing Solution

DP Tabulation

DP Solving Marathon

Backtracking

Divide and Conquer

Greedy

Shortest Path Algorithm: Dijkstra

Shortest Path Algorithm: Bellman

Shortest Path Algorithm: Floyd Warshal

Minimum Spanning Tree

Teaching Style:

Instead of long theory then coding style, we follow a unique style

I parallelize the concepts with the codes as much as possible

Go Concrete as possible

Use Clear Simple Visualization

Engagement

By the end of the journey

Solid understanding of Algorithms topics in C++

Mastering different skills

Analytical and Problem–Solving skills

Clean coding for algorithms

With the administered problem–solving skills

You can start competitive programming smoothly

A strong step toward interviews preparation