JavaScript Algorithms and Data Structures Masterclass
JavaScript Algorithms and Data Structures Masterclass, available at $109.99, has an average rating of 4.6, with 250 lectures, 91 quizzes, based on 28485 reviews, and has 155143 subscribers.
You will learn about Learn everything you need to ace difficult coding interviews Master dozens of popular algorithms, including 6 sorting algorithms! Implement 10+ data structures from scratch Improve your problem solving skills and become a stronger developer This course is ideal for individuals who are Anyone preparing for programming interviews or Anyone interested in improving their problem solving skills or Anyone looking to become a better developer! It is particularly useful for Anyone preparing for programming interviews or Anyone interested in improving their problem solving skills or Anyone looking to become a better developer!.
Enroll now: JavaScript Algorithms and Data Structures Masterclass
Summary
Title: JavaScript Algorithms and Data Structures Masterclass
Price: $109.99
Average Rating: 4.6
Number of Lectures: 250
Number of Quizzes: 91
Number of Published Lectures: 249
Number of Published Quizzes: 91
Number of Curriculum Items: 341
Number of Published Curriculum Objects: 340
Original Price: $99.99
Quality Status: approved
Status: Live
What You Will Learn
- Learn everything you need to ace difficult coding interviews
- Master dozens of popular algorithms, including 6 sorting algorithms!
- Implement 10+ data structures from scratch
- Improve your problem solving skills and become a stronger developer
Who Should Attend
- Anyone preparing for programming interviews
- Anyone interested in improving their problem solving skills
- Anyone looking to become a better developer!
Target Audiences
- Anyone preparing for programming interviews
- Anyone interested in improving their problem solving skills
- Anyone looking to become a better developer!
Updated in November 2018 with brand new section on Dynamic Programming!
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.
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.
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!
Course Curriculum
Chapter 1: Introduction
Lecture 1: Curriculum Walkthrough
Lecture 2: Join The Community!
Lecture 3: What Order Should You Watch In?
Lecture 4: How I'm Running My Code
Chapter 2: Big O Notation
Lecture 1: Intro to Big O
Lecture 2: Timing Our Code
Lecture 3: Counting Operations
Lecture 4: Visualizing Time Complexities
Lecture 5: Official Intro to Big O
Lecture 6: Simplifying Big O Expressions
Lecture 7: Space Complexity
Lecture 8: Logs and Section Recap
Chapter 3: Analyzing Performance of Arrays and Objects
Lecture 1: PREREQUISITES
Lecture 2: Section Introduction
Lecture 3: The BIG O of Objects
Lecture 4: When are Arrays Slow?
Lecture 5: Big O of Array Methods
Chapter 4: Problem Solving Approach
Lecture 1: PREREQUISITES
Lecture 2: Introduction to Problem Solving
Lecture 3: Step 1: Understand The Problem
Lecture 4: Step 2: Concrete Examples
Lecture 5: Step 3: Break It Down
Lecture 6: Step 4: Solve Or Simplify
Lecture 7: Step 5: Look Back and Refactor
Lecture 8: Recap and Interview Strategies
Chapter 5: Problem Solving Patterns
Lecture 1: PREREQUISITES
Lecture 2: Intro to Problem Solving Patterns
Lecture 3: Frequency Counter Pattern
Lecture 4: Frequency Counter: Anagram Challenge
Lecture 5: Anagram Challenge Solution
Lecture 6: Multiple Pointers Pattern
Lecture 7: Multiple Pointers: Count Unique Values Challenge
Lecture 8: Count Unique Values Solution
Lecture 9: Sliding Window Pattern
Lecture 10: Divide And Conquer Pattern
Chapter 6: 100% OPTIONAL Challenges
Lecture 1: IMPORTANT NOTE!
Lecture 2: SOLUTIONS PART 1
Lecture 3: SOLUTIONS PART 2
Lecture 4: SOLUTIONS PART 3
Chapter 7: Recursion
Lecture 1: PREREQUISITES
Lecture 2: Story Time: Martin & The Dragon
Lecture 3: Why Use Recursion?
Lecture 4: The Call Stack
Lecture 5: Our First Recursive Function
Lecture 6: Our Second Recursive Function
Lecture 7: Writing Factorial Iteratively
Lecture 8: Writing Factorial Recursively
Lecture 9: Common Recursion Pitfalls
Lecture 10: Helper Method Recursion
Lecture 11: Pure Recursion
Chapter 8: Recursion Problem Set
Lecture 1: START HERE!
Lecture 2: SOLUTIONS FOR THIS SECTION
Chapter 9: Bonus CHALLENGING Recursion Problems
Lecture 1: NOTE ON THIS SECTION
Lecture 2: SOLUTIONS PART 1
Lecture 3: SOLUTIONS PART 2
Chapter 10: Searching Algorithms
Lecture 1: PREREQUISITES
Lecture 2: Intro to Searching
Lecture 3: Intro to Linear Search
Lecture 4: Linear Search Solution
Lecture 5: Linear Search BIG O
Instructors
-
Colt Steele
Developer and Bootcamp Instructor
Rating Distribution
- 1 stars: 128 votes
- 2 stars: 183 votes
- 3 stars: 1195 votes
- 4 stars: 7022 votes
- 5 stars: 19957 votes
Frequently Asked Questions
How long do I have access to the course materials?
You can view and review the lecture materials indefinitely, like an on-demand channel.
Can I take my courses with me wherever I go?
Definitely! If you have an internet connection, courses on Udemy are available on any device at any time. If you don’t have an internet connection, some instructors also let their students download course lectures. That’s up to the instructor though, so make sure you get on their good side!
You may also like
- Top 10 Video Editing Courses to Learn in November 2024
- Top 10 Music Production Courses to Learn in November 2024
- Top 10 Animation Courses to Learn in November 2024
- Top 10 Digital Illustration Courses to Learn in November 2024
- Top 10 Renewable Energy Courses to Learn in November 2024
- Top 10 Sustainable Living Courses to Learn in November 2024
- Top 10 Ethical AI Courses to Learn in November 2024
- Top 10 Cybersecurity Fundamentals Courses to Learn in November 2024
- Top 10 Smart Home Technology Courses to Learn in November 2024
- Top 10 Holistic Health Courses to Learn in November 2024
- Top 10 Nutrition And Diet Planning Courses to Learn in November 2024
- Top 10 Yoga Instruction Courses to Learn in November 2024
- Top 10 Stress Management Courses to Learn in November 2024
- Top 10 Mindfulness Meditation Courses to Learn in November 2024
- Top 10 Life Coaching Courses to Learn in November 2024
- Top 10 Career Development Courses to Learn in November 2024
- Top 10 Relationship Building Courses to Learn in November 2024
- Top 10 Parenting Skills Courses to Learn in November 2024
- Top 10 Home Improvement Courses to Learn in November 2024
- Top 10 Gardening Courses to Learn in November 2024