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

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 of this part

Online Judges and How to use

Recursion: Basics Review

Complexity Analysis (Part 1)

Sorting: Insertion, Selection and Count

Binary Search: Basic and generalised forms

Graph Representation

Graph DFS

Graph BFS

Graph Topological Order

Extensive practice on these subjects

Philosophy of the course 2 parts:

The first part focus on topics that are more common in interviews

The first part focus on topics that require less proving skills. This allow you to sharpen problem–solving skills more first

In the next part we proceed toward other important topics in the Algorithms field.

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