JavaScript 算法和数据结构大师班
缺失的计算机科学和编码面试训练营
教程演示🔗
What you’ll learn 学习内容
-
Learn everything you need to ace difficult coding interviews
学习在困难的编码面试中取得优异成绩所需的一切 -
Master dozens of popular algorithms, including 6 sorting algorithms!
掌握数十种流行算法,包括6种排序算法! -
Implement 10+ data structures from scratch
从头开始实现 10+ 数据结构 -
Improve your problem solving skills and become a stronger developer
提高解决问题的能力,成为更强大的开发人员
Requirements 要求
-
Basic knowledge of JavaScript syntax
JavaScript 语法的基础知识 -
NO experience with data structures or computer science needed!
无需数据结构或计算机科学方面的经验!
Description 描述
Updated in November 2018 with brand new section on Dynamic Programming!
2018 年 11 月更新了关于动态编程的全新部分!
This course crams months of computer science and interview prep material into 20 hours of video. The content is based directly on last semester of my in-person coding bootcamps, where my students go on to land 6-figure developer jobs. I cover the exact same computer science content that has helped my students ace interviews at huge companies like Google, Tesla, Amazon, and Facebook. Nothing is watered down for an online audience; this is the real deal :) We start with the basics and then eventually cover “advanced topics” that similar courses shy away from like Heaps, Graphs, and Dijkstra’s Shortest Path Algorithm.
本课程将数月的计算机科学和面试准备材料塞进 20 小时的视频中。内容直接基于我上学期的面对面编码训练营,我的学生在那里找到了 6 位数的开发人员工作。我涵盖的计算机科学内容与帮助我的学生在谷歌、特斯拉、亚马逊和 Facebook 等大公司的面试中取得优异成绩完全相同的内容。对于在线观众来说,没有什么是淡化的;这是真正的交易:)我们从基础知识开始,然后最终涵盖类似课程回避的“高级主题”,例如堆、图形和 Dijkstra 的最短路径算法。
I start by teaching you how to analyze your code’s time and space complexity using Big O notation. We cover the ins and outs of Recursion. We learn a 5-step approach to solving any difficult coding problem. We cover common programming patterns. We implement popular searching algorithms. We write 6 different sorting algorithms: Bubble, Selection, Insertion, Quick, Merge, and Radix Sort. Then, we switch gears and implement our own data structures from scratch, including linked lists, trees, heaps, hash tables, and graphs. We learn to traverse trees and graphs, and cover Dijkstra’s Shortest Path Algorithm. The course also includes an entire section devoted to Dynamic Programming.
首先,我将教你如何使用 Big O 表示法分析代码的时间和空间复杂度。我们介绍了递归的来龙去脉。我们学习了解决任何困难编码问题的 5 步方法。我们介绍了常见的编程模式。我们实现了流行的搜索算法。我们编写了 6 种不同的排序算法:冒泡、选择、插入、快速、合并和基数排序。然后,我们切换方向,从头开始实现我们自己的数据结构,包括链表、树、堆、哈希表和图形。我们学习遍历树和图形,并介绍 Dijkstra 的最短路径算法。该课程还包括一个专门用于动态规划的整个部分。
Here’s why this course is worth your time:
这就是为什么这门课程值得您花时间的原因:
-
It’s interactive – I give you a chance to try every problem before I show you my solution.
它是互动的 – 在我向你展示我的解决方案之前,我给你一个机会尝试每一个问题。 -
Every single problem has a complete solution walkthrough video as well as accompanying solution file.
每个问题都有一个完整的解决方案演练视频以及随附的解决方案文件。 -
I cover helpful “tips and tricks” to solve common problems, but we also focus on building an approach to ANY problem.
我介绍了解决常见问题的有用“技巧和窍门”,但我们也专注于建立解决任何问题的方法。 -
It’s full of animations and beautiful diagrams!
它充满了动画和精美的图表!
Are you looking to level-up your developer skills? Sign up today!
您是否希望提升您的开发技能?立即注册!
Who this course is for:
本课程适用于谁:
- Anyone preparing for programming interviews
任何准备编程面试的人 - Anyone interested in improving their problem solving skills
任何有兴趣提高解决问题能力的人 - Anyone looking to become a better developer!
任何希望成为更好的开发人员的人!