Enhance your JavaScript and React skills, build a portfolio project, and understand the pathfinding algorithms on a deeper level in this project-based course!
Master the Pathfinding Algorithms with JavaScript and React
Build an Algorithms Visualizer that shows how the Breadth-First Search and Depth-First Search algorithms work and helps you understand them on a deeper level. Plus it'll serve as a standout project in your portfolio that will be a conversation starter in interviews!
Additional
About the Author: Zero To Mastery
Zero To Mastery (ZTM) is a Toronto-based online coding academy founded by Andrei Neagoie, originally a senior developer at large Canadian tech firms before turning to teaching full-time. The academy's signature is the cohort-based bootcamp track combined with a deep self-paced course library, all aimed at career-changers and self-taught developers preparing to land software-engineering roles at top companies.
The instructor roster has grown well beyond Andrei to include other senior practitioners: Daniel Bourke (machine learning), Aleksa Tešić (DevOps), Jacinto Wong, and others. Courses cover the full software-engineering career path: web development with React and Next.js, Python, machine learning and deep learning, DevOps and cloud, system design, mobile, and the algorithm / data-structure interview prep that gates engineering jobs.
The CourseFlix listing under this source carries over 120 ZTM courses spanning that full range. Material is paid; ZTM itself runs on a monthly / annual membership model. The teaching style favours long-form, project-based courses where students build complete portfolio-quality applications rather than disconnected feature tutorials.
Watch Online 23 lessons
| # | Lesson Title | Duration | Access |
|---|---|---|---|
| 1 | Introduction Demo | 02:29 | |
| 2 | Project Demo | 03:28 | |
| 3 | What Are Pathfinding Algorithms? | 05:28 | |
| 4 | Breadth-First Search (BFS) | 06:41 | |
| 5 | Depth-First Search (DFS) | 05:33 | |
| 6 | BFS vs. DFS | 02:49 | |
| 7 | Setting Up Our REPL | 06:08 | |
| 8 | Creating a Maze Using React | 10:36 | |
| 9 | Creating Maze Rows | 03:42 | |
| 10 | Making It Dynamic | 09:07 | |
| 11 | Adding a Maze Refresh Button | 08:35 | |
| 12 | Generating a Maze Matrix using Javascript | 05:03 | |
| 13 | Combining Maze Generation into Our Button | 05:09 | |
| 14 | Finalizing Our Maze Generation | 12:34 | |
| 15 | Applying BFS and DFS to Our Maze | 05:10 | |
| 16 | Breadth-First Search Implementation - Part 1 | 12:27 | |
| 17 | Breadth-First Search Implementation - Part 2 | 03:36 | |
| 18 | Depth-First Search Implementation | 05:36 | |
| 19 | Adding Buttons and Bug Fixing our Algorithms | 10:41 | |
| 20 | Combining the Algorithms to the Maze | 09:04 | |
| 21 | Delaying the Steps of Our Algorithms | 03:52 | |
| 22 | Fixing Refresh Maze | 06:30 | |
| 23 | The Final Touches | 05:46 |
Get instant access to all 22 lessons in this course, plus thousands of other premium courses. One subscription, unlimited knowledge.
Learn more about subscriptionCourse content
23 lessons · 2h 30m 4sShow all 23 lessons
- 1 Introduction 02:29
- 2 Project Demo 03:28
- 3 What Are Pathfinding Algorithms? 05:28
- 4 Breadth-First Search (BFS) 06:41
- 5 Depth-First Search (DFS) 05:33
- 6 BFS vs. DFS 02:49
- 7 Setting Up Our REPL 06:08
- 8 Creating a Maze Using React 10:36
- 9 Creating Maze Rows 03:42
- 10 Making It Dynamic 09:07
- 11 Adding a Maze Refresh Button 08:35
- 12 Generating a Maze Matrix using Javascript 05:03
- 13 Combining Maze Generation into Our Button 05:09
- 14 Finalizing Our Maze Generation 12:34
- 15 Applying BFS and DFS to Our Maze 05:10
- 16 Breadth-First Search Implementation - Part 1 12:27
- 17 Breadth-First Search Implementation - Part 2 03:36
- 18 Depth-First Search Implementation 05:36
- 19 Adding Buttons and Bug Fixing our Algorithms 10:41
- 20 Combining the Algorithms to the Maze 09:04
- 21 Delaying the Steps of Our Algorithms 03:52
- 22 Fixing Refresh Maze 06:30
- 23 The Final Touches 05:46
Related courses
-

Fabulous Adventures in Data Structures and Algorithms
By: Eric LippertDiscover unusual algorithms and data structures. Get inspired by practical examples in C#. Author: Eric Lippert. -

Parsing Algorithms
By: Udemy, Dmitry SoshnikovParsing Algorithms — top-down and bottom-up parsing techniques: LL(1), LR(1), LALR, recursive-descent. Implement them from scratch.4 hours 27 minutes 33 seconds -

Garbage Collection Algorithms
By: Udemy, Dmitry SoshnikovMemory leaks and dangling pointers are the main issues of the manual memory management. You delete a parent node in a linked list, forgetting to delete all its2 hours 13 minutes 20 seconds