MP4 | Video: h264, 1280×720 | Audio: AAC, 44.1 KHz, 2 Ch
Genre: eLearning | Language: English + srt | Duration: 86 lectures (6h 54m) | Size: 3 GB
with problems and solutions
What you’ll learn
Understand the inner working of the most common algorithms used in coding interviews
Identify which algorithm is a better fit depending on the problem
Improve your problem solving skills
Improve your interviewing skills
Experience with any programming language
What will you learn from the course?
By the end of the course, you will have a better idea of the type of problems asked in coding interviews and how to approach them to implement a viable solution.
You will also learn the most common algorithms used in coding interviews, and more importantly, when to use them.
You will improve your problem-solving skills and interviewing skills.
About the Instructor
David has more than 10 years of experience teaching the Algorithms Design and Analysis course at Universidad Panamericana. He has been involved in the ACM-ICPC programming team of the university as a contestant, coach, and advisor.
David is a Principal Software Engineer with more than 10 years of experience in the industry, having worked at Amazon and Oracle. He also has worked at Karat as a contractor to interview engineers for companies such as Roblox, Indeed, Walmart, Palantir, and others. He has interviewed hundreds of candidates during his trajectory and has participated as a problem setter for questions used in recruitment processes.
He is the founder of dnd-learning, where he creates educational content related to algorithms. He provides guidance and mentorship for coding interviews and constantly publishes material about algorithms and interviews. He is co-author of the book “Algorithms for Competitive Programming”.
The slides of the course are available for download.
For each coding exercise in the course, it is provided the code with the implementation, and a document explaining the solution.
The coding questions are public to practice, and all of them have automated test cases.
Content of the Course
Tools that will be used during the course
Importance of identifying time and space complexity in an interview
Common types of complexities
Data Structures I
Linear data structures: Vector, list, queue, and stack
Tree data structures
Data Structures II
Hashing data structures
Types of graphs
Paths and cycles
Representation of a graph
How to approach a problem with dynamic programming
Examples of DP problems
How to implement a backtracking solution
When is a good idea to use backtracking
Who this course is for
New graduates and experienced engineers preparing for a coding interview