Algorithms for Coding Interviews

在课程结束时，您将更好地了解编码面试中提出的问题类型以及如何处理这些问题以实施可行的解决方案。

您还将学习编码面试中最常用的算法，更重要的是，何时使用它们。

您将提高解决问题的能力和面试技巧。

关于导师

David 拥有 10 多年在泛美大学教授算法设计和分析课程的经验。他曾作为参赛者、教练和顾问参与了该大学的 ACM-ICPC 编程团队。

David 是一位在该行业拥有 10 多年经验的首席软件工程师，曾在亚马逊和甲骨文工作过。他还曾在 Karat 担任承包商，为 Roblox、Indeed、Walmart、Palantir 等公司面试工程师。在他的职业生涯中，他采访了数百名候选人，并作为问题制定者参与了招聘过程中使用的问题。

他是 dnd-learning 的创始人，在那里他创建了与算法相关的教育内容。他为编码面试提供指导和指导，并不断发布有关算法和面试的材料。他是《竞争性编程算法》一书的合著者。

Published 05/2022
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

Requirements
Experience with any programming language

Description
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”.

Material

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

Introduction

Objectives

Motivation

Tools that will be used during the course

Complexity Analysis

Importance of identifying time and space complexity in an interview

Common types of complexities

Interview tips

Coding exercises

Data Structures I

Linear data structures: Vector, list, queue, and stack

Tree data structures

Interview tips

Coding exercises

Data Structures II

Hashing data structures

Interview tips

Coding exercises

Graphs

Definition

Types of graphs

Paths and cycles

Representation of a graph

Graph traversal

Interview tips

Coding exercises

Dynamic Programming

Definition

How to approach a problem with dynamic programming

Examples of DP problems

Interview tips

Coding exercises

Backtracking

Definition

How to implement a backtracking solution

When is a good idea to use backtracking

Example: Sudoku

Interview tips

Coding exercises

Who this course is for
New graduates and experienced engineers preparing for a coding interview