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

th_Pb2J3uOkjraFJOiQceQj3WpgbxOzK0Uy

Master recursive based techniques, greedy and shortest-path algorithms

MP4 | Video: h264, 1280×720 | Audio: AAC, 44.1 KHz, 2 Ch
Genre: eLearning | Language: English + srt | Duration: 17 lectures (3h 10m) | Size: 1.25 GB

 

What you’ll learn
Practice many 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

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!)

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)

About the Instructor (relevant experience): I was ICPC Finalists in 2010 where algorithms and data structures are the key to success. Learning the exact inner details of these algorithms and how to build real experience compare to others is an important key. For more about me, visit my website.

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

资源下载此资源仅限VIP下载,请先
本站资源仅限VIP会员下载点击购买VIP会员

原创文章,作者:steven,如若转载,请注明出处:https://rr3d.cn/31286.html

赞 (0)
steven的头像steven
上一篇 2022年4月9日
下一篇 2022年4月9日

相关推荐

发表回复

登录后才能评论
分享本页
返回顶部