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

Mastering critical SKILLS in Algorithms using C++: Part 1, available at $84.99, has an average rating of 4.98, with 146 lectures, 5 quizzes, based on 482 reviews, and has 3669 subscribers.

You will learn about Practice 90 problems to sharpen problem-solving and algorthmic skills Expose yourself to many algorithmic techniques After the course, a smooth experience to prepare for coding interviews Short and well written codes This course is ideal for individuals who are People who want to master a critical CS component or People who want to prepare for interviews, then Algorithms is a must step before interviews preparations It is particularly useful for People who want to master a critical CS component or People who want to prepare for interviews, then Algorithms is a must step before interviews preparations.

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

Summary

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

Price: $84.99

Average Rating: 4.98

Number of Lectures: 146

Number of Quizzes: 5

Number of Published Lectures: 146

Number of Published Quizzes: 5

Number of Curriculum Items: 151

Number of Published Curriculum Objects: 151

Original Price: $199.99

Quality Status: approved

Status: Live

What You Will Learn

Practice 90 problems to sharpen problem-solving and algorthmic skills

Expose yourself to many algorithmic techniques

After the course, a smooth experience to prepare for coding interviews

Short and well written codes

Who Should Attend

People who want to master a critical CS component

People who want to prepare for interviews, then Algorithms is a must step before interviews preparations

Target Audiences

People who want to master a critical CS component

People who want to prepare for interviews, then Algorithms is a must step before interviews preparations

Almost all other courses focus on knowledge. In this course, we focus ongaining 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

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

Prerequisites

Programming Skills:

Strong Programming skills

Solving a lot of basic problem-solving problems on fundamentals

Good understanding for basic recursion (E.g. Fibonacci)

STL, especially Vectors, map/set, unordered map/set

Highly Preferred: 

Do programming projects

Finish a descent data structure course (extensive data structure practice)

Don’t miss such a unique learning experience!

Acknowledgement: “I’d like to extend my gratitude towards Robert Bogan for his help with proofreading the slides for this course”

Course Curriculum

Chapter 1: Getting Started

Lecture 1: Algorithms – What and Why

Lecture 2: Algorithms in practice

Lecture 3: Prerequisites

Lecture 4: Effective usage of the course

Chapter 2: Online Judges

Lecture 1: Online Judge

Lecture 2: LeetCode OJ

Lecture 3: SPOJ OJ

Lecture 4: Uva OJ

Lecture 5: CodeForces OJ

Chapter 3: Recursion: Basics Review

Lecture 1: Note

Lecture 2: Recursive Functions 1

Lecture 3: Recursive Functions 2

Lecture 4: Recursive Functions Practice 1

Lecture 5: Recursive Functions Practice 2

Lecture 6: Recursive Functions Practice 3

Lecture 7: Recursive Functions Homework 1

Lecture 8: Recursive Functions Homework 1 – Solutions p1

Lecture 9: Recursive Functions Homework 1 – Solutions p2 p3 p4 p5 p6 p7 p8

Lecture 10: Recursive Functions Homework 2

Lecture 11: Recursive Functions Homework 2 – Solutions p9

Lecture 12: Recursive Functions Homework 2 – Solutions p10 p11 p12

Lecture 13: Recursive Functions Homework 2 – Solutions p13

Lecture 14: Recursive Functions Homework 2 – Solutions p14

Lecture 15: Recursive Functions Homework 2 – Solutions p15

Lecture 16: Recursive Functions Homework 2 – Solutions p16

Lecture 17: Recursive Functions Homework 2 – Solutions p17

Chapter 4: Complexity Analysis

Lecture 1: Note

Lecture 2: Asymptotic Complexity 1 – Intro

Lecture 3: Asymptotic Complexity 2 – Time

Lecture 4: Asymptotic Complexity 3 – Some Math

Lecture 5: Asymptotic Complexity 4 – Space

Chapter 5: Sorting: Insertion, Selection and Count

Lecture 1: Insertion Sort 1

Lecture 2: Insertion Sort 2

Lecture 3: STL Sorting

Lecture 4: Selection Sort

Lecture 5: Count Sort

Lecture 6: Sorting Homework 1 – 6 Medium to Hard Challenges

Lecture 7: Sorting Homework 1 – Solutions p1 p2 p3

Lecture 8: Sorting Homework 1 – Solutions p4 p5

Lecture 9: Sorting Homework 1 – Solutions p6

Lecture 10: Sorting Homework 2 – 6 Easy to Medium Challenges

Lecture 11: Sorting Homework 2 – Solutions p1 p2 p3

Lecture 12: Sorting Homework 2 – Solutions p4

Lecture 13: Sorting Homework 2 – Solutions p5

Lecture 14: Sorting Homework 2 – Solutions p6

Lecture 15: Sorting Homework 3 – 3 Hard Challenges

Lecture 16: Sorting Homework 3 – Solutions p1

Lecture 17: Sorting Homework 3 – Solutions p2

Lecture 18: Sorting Homework 3 – Solutions p3

Chapter 6: Searching: Binary Search

Lecture 1: Binary Search Basics 1

Lecture 2: Binary Search Basics 2

Lecture 3: Binary Search Homework 1 – 4 Medium Challenges

Lecture 4: Binary Search Homework 1 Solutions p1

Lecture 5: Binary Search Homework 1 Solutions p2

Lecture 6: Binary Search Homework 1 Solutions p3

Lecture 7: Binary Search Generalization 1

Lecture 8: Binary Search Generalization 2

Lecture 9: Binary Search Homework 2 – 3 Medium Challenges

Lecture 10: Binary Search Homework 2 – solutions p1

Lecture 11: Binary Search Homework 2 – solutions p2

Lecture 12: Binary Search Homework 2 – Solutions p3

Lecture 13: Binary Search Homework 3 – 2 Hard Challenges

Lecture 14: Binary Search Homework 3 – Solutions p1

Lecture 15: Binary Search Homework 3 – Solutions p2

Lecture 16: Binary Search on Real Values

Lecture 17: Binary Search Homework 4 – 3 Medium Challenges

Lecture 18: Binary Search Homework 4 Solutions p1

Lecture 19: Binary Search Homework 4 Solutions p2

Lecture 20: Binary Search Homework 4 Solutions p3

Lecture 21: Binary Search Thoughts

Chapter 7: Graph Representation

Lecture 1: Relationships Everywhere

Lecture 2: Graph Terminology

Lecture 3: Adjacency Matrix Representation

Lecture 4: Adjacency List Representation

Lecture 5: Graph Representation Homework 1 – 3 Easy Challenges

Lecture 6: Graph Representation Homework 1 – Solutions

Lecture 7: Graph Representation Homework 2 – 5 Medium Challenges

Lecture 8: Graph Representation Homework 2 – Solutions p1 p2

Lecture 9: Graph Representation Homework 2 – Solutions p3

Lecture 10: Graph Representation Homework 2 – Solutions p4 p5

Lecture 11: Graph Representation Homework 3 – 2 Hard Challenges

Lecture 12: Graph Representation Homework 3 – Solution p1

Lecture 13: Graph Representation Homework 3 – Solutions p2

Chapter 8: Graph Depth First Search

Lecture 1: Depth First Search 1

Lecture 2: Depth First Search 2

Lecture 3: DFS Homework 1 – 3 Easy Problems

Lecture 4: DFS Homework 1 – Solutions p1 p2

Instructors

Dr. Moustafa Saad Ibrahim
Educator, Software Engineer, Scientist, Competitive Coach

CSkilled Academy
High Quality With Intensive Practice CS Courses

Rating Distribution

1 stars: 2 votes

2 stars: 0 votes

3 stars: 7 votes

4 stars: 28 votes

5 stars: 445 votes

Frequently Asked Questions

How long do I have access to the course materials?

You can view and review the lecture materials indefinitely, like an on-demand channel.

Can I take my courses with me wherever I go?

Definitely! If you have an internet connection, courses on Udemy are available on any device at any time. If you don’t have an internet connection, some instructors also let their students download course lectures. That’s up to the instructor though, so make sure you get on their good side!