Mastering critical SKILLS in Algorithms using C++: Part 2
What you'll learn
- Master recursive techniques by solving MANY problems
- Expose yourself to many algorithmic techniques
- After the course, a smooth experience to prepare for coding interviews
- Short and well written codes
Requirements
- Strong programming background
- Solved several practice during a programming course
- STL, especially vector class. Others include: set, map and hash table
- Optional but recommended: Implement long programming projects
- Highly recommended: Attended a strong data structure course first and solved a lot
Description
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
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”
Who this course is for:
- 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
Instructor
![GetSkilled Org](data:image/svg+xml,%3Csvg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 64 64"%3E%3C/svg%3E){kind=avatar}
- 4.7 Instructor Rating
- 3,621 Reviews
- 39,541 Students
- 8 Courses
For discounts, please visit this website
The most critical difference between my courses and others is ... going beyond knowledge: With me, you get really skilled. The extensive amount of quizzes, practices, homework, and [real] projects ranging from easy to hard will reshape your skills.
In this profile, I will offer wide diversity of courses covering programming, OOP, Data Structures and Algorithms. Several languages will be covered such as C++, Python, Java, C# and Javascript
I have a huge passion to transfer many of what top experts know to the customers at cheap price!