Back to courses

Master the Coding Interview: Big Tech (FAANG) Interviews

Get hired by Google, Amazon, Facebook, Microsoft, Apple, Netflix by acing their coding interview. This course gives you the step-by-step guide and framework for solving their toughest technical questions!

45 Days

Average time students take to complete this course.

Last updated: March 2024

Course overview

We guarantee you that this is the best FAANG interview prep course that you can find if you are serious about getting hired as a software engineer at the top tech companies in the world and making $150,000+.

What you'll learn

  • Ace the coding interview at top tech companies (Google, Amazon, Facebook/Meta, Apple, Microsoft, Netflix + others)
  • Step-by-step guide to solving common questions and how to best present them during the tech interview
  • The ultimate resource to prepare for coding interviews, tech interviews and programming interviews
  • Insider tips & tricks from instructors who have worked for big tech companies and actually gone through and aced the interview process
  • A mental framework on how to approach solving coding problems so that you can become a better problem solver and answer ANY question companies throw at you
  • Use the right Data Structures and Algorithms to pass coding interview questions that have the optimal solution
  • Become a better developer by mastering Computer Science fundamentals
  • Learn exactly what you need to answer the most difficult questions

This course is part of our Master the Coding Interview series. We give you the step-by-step guide and framework to ace big tech coding interviews and answer any coding question they throw at you.

And the results speak for themselves.

Graduates of this course are now working at Google, Tesla, Amazon, Apple, IBM, Uber, Facebook, Shopify + other top tech companies.

This can be you.

By enrolling today, you’ll also get to join our exclusive live online community classroom to learn alongside thousands of students, alumni, mentors, TAs and Instructors.

Active. Thriving. Supportive. Helpful. Friendly. Motivating. Essential.

These are just a few of the words students use to describe the ZTM Discord which is also one of the biggest and most active developer communities on Discord.

Most importantly, you will learn from industry experts that has actual real-world experience working for these companies (and aced their interviews) in both Silicon Valley and Toronto.

  • Want to land a job at a top tech company like Google, Microsoft, Facebook, Netflix, Amazon, Apple but you are intimidated by the interview process and the coding questions?
  • Do you find yourself feeling like you get "stuck" every time you get asked a coding question?
  • Feeling overwhelmed trying to answer questions on LeetCode?
  • Worried that you won't be able to compete with Compuer Science grads for top jobs?

This course is your answer.

Using the strategies, lessons, and exercises in this course, you will learn how to master the coding interview and land an offer from the company of your dreams.

This is the ultimate resource to prepare you for coding interviews. Everything you need in one place!

Unlike many courses, we aren’t going to tell you:

"Do these 100+ interview questions, memorize the answers and hope your interviewer asks one of them in your interview."

No! That's not a strategy. And it's a terrible use of your time.

Throughout this course, you will learn a problem solving framework so that you can answer ANY interview question that these companies may throw at you (vs. hoping they ask one you've memorized).

You will then practice using this framework to answer common interview questions from these big tech companies.

We also teach you the principles and fundamentals that you can use to start recognizing certain common patterns in questions. So any question you get, you can use the framework to answer the question confidently in your programming interview.

Here is what you will learn to use in this course while answering coding interview questions step-by-step with us:

  1. Big O Notation

  2. Data Structures:

    • Arrays
    • Hash Tables
    • Singly Linked Lists
    • Doubly Linked Lists
    • Queues
    • Stacks
    • Binary Trees
    • Binary Search Trees
    • Tries
    • N-ary Trees
    • Min/Max Heaps
    • Priority Queues
    • 2-D Arrays/ Matrices
    • Graphs
    • Adjacency List
    • Adjacency Matrix
    • Interface Design
  3. Algorithmic Paradigms Used:

    • Recursion
    • Sorting
    • Searching
    • Tree Traversals
    • Graph Traversals
    • Breadth First Search
    • Depth First Search
    • Divide and Conquer
    • Greedy Method
    • Dynamic Programming
    • Backtracking
  4. Specific Algorithms Used:

    • Hoare's Quickselect Algorithm
    • Floyd's Tortoise and Hare Cycle Detection Algorithm
    • Bellman-Ford Algorithm
    • Dijkstra's Algorithm
    • Topological Sort

What's the bottom line?

We (Yihua and Andrei) are Senior Engineers and Programmers who have worked and managed teams of engineers. We've been in these interviews both as an interviewee as well as the interviewer.

Our job as instructors will be successful if we are able to help you get your dream job that you never thought was possible.

This course isn’t just about helping you master the coding interview (which you will!).

You will also become a better problem solver which will help you throughout your entire career, making you a better programmer and helping you level-up in your career faster.

Mastering the FAANG coding interview can really change the course of your career and life. We’re excited to help you make that happen.

When's the best time to get started? Today!

There's never a bad time to learn in-demand skills. But the sooner, the better. So take your first step to landing your dream job today by joining the ZTM Academy. You'll have a clear roadmap to developing the skills to build your own projects, ace your coding interviews, get hired, and advance your career.

Join Zero To Mastery Now

Don't just take our word for it

Our courses and community have helped 1,000s of Zero To Mastery students go from zero to getting hired to levelling up their skills and advancing their careers to new heights.

Johan Andres Ochoa Quiroz

The explanations of every technique using DS&A to solve Leetcode problems are extremely good. I gained a lot of confidence and now I'm not afraid to go for medium, or even hard problems on Leetcode. Thank you Yihua and Andrei for this amazing course.

Johan Andres Ochoa Quiroz

Christina Emerson

I've learned a ton from this course. I'm not a traditional CS student and I lacked Data Structure / Algorithm knowledge. This course saved me several thousand dollars as I was close to choosing a bootcamp. Thank you!

Christina Emerson

Best course to study for a technical interview. You get 2-4 questions per data structure and you will learn how to solve specific problems. By the end of the course, solving questions will become way easier because you know the problem solving framework.

Alex Brylov

Yihua explains the toughest concepts in such a way that it becomes 100x easier to understand. This one course seems more helpful to me compared to my 4 years of college. I'd definitely recommend it to anybody who wants to become a Software Engineer.

Nikhil Choudhary

Course curriculum

To make sure this course is a good fit for you, you can start learning for free right now by clicking any of the PREVIEW links below.

Introduction

6 lectures

Master The Coding Interview: Big Tech (FAANG) Interview2:34

PREVIEW

Course Breakdown11:04

PREVIEW

Exercise: Meet Your Classmates and Instructor

BEGIN

Download All Code + Solutions

BEGIN

How-to's: Speed up videos, Downloading videos, Subtitles

BEGIN

Unlimited Updates

BEGIN

Arrays - Question #1 Google Interview Question Two Sum (Easy)

11 lectures

Interview Question #1 Two Sum7:14

BEGIN

How To Approach Our Problem11:45

BEGIN

Writing Our Brute Force Solution6:40

BEGIN

Testing Our Solution With Our Test Cases9:23

BEGIN

Submitting To Leetcode1:49

BEGIN

Analyzing Space and Time Complexity10:37

BEGIN

Optimizing Our Solution8:06

BEGIN

Coding Our Optimal Solution5:21

BEGIN

Testing Our Optimal Solution With Our Test Cases8:02

BEGIN

Checking Performance On LeetCode3:24

BEGIN

Solution In Other Languages

BEGIN

Arrays - Questions #2 - Container With Most Water (Medium)

7 lectures

Interview Question #2 - Container With Most Water4:46

PREVIEW

Coming Up With Test Cases4:19

PREVIEW

Thinking Through A Logical Brute Force Solution12:49

BEGIN

Coding Out Our Brute Force Solution7:20

BEGIN

Stepping Through Our Code4:44

BEGIN

Thinking About Our Optimal Solution13:52

PREVIEW

Coding Our Optimal Solution And Testing On LeetCode9:50

PREVIEW

Arrays - Questions #3 - Trapping Rainwater (Hard)

6 lectures

Interview Question #3 - Trapping Rainwater7:19

PREVIEW

Thinking About A Logical Solution12:45

BEGIN

Coding Our Brute Force Solution8:52

BEGIN

Figuring Out Our Optimization Strategy24:26

BEGIN

Coding Our Optimal Solution13:26

BEGIN

Optimal Code And Testing On LeetCode2:09

BEGIN

Strings - Question #4 - Typed Out Strings (Easy)

7 lectures

Interview Question #4 -Typed Out Strings7:08

PREVIEW

Logic Of Our Brute Force Solution8:02

BEGIN

Coding Our Brute Force Solution9:37

BEGIN

Space And Time Complexity7:22

BEGIN

Coming Up With Optimal Solution11:52

BEGIN

Coding Our Optimal Solution12:35

BEGIN

Submitting To LeetCode5:51

BEGIN

Strings - Question #5 - Longest Substring Without Repeating Characters (Medium)

10 lectures

Interview Question #5 - Longest Substring Without Repeating Characters6:39

PREVIEW

Coming Up With A Brute Force Approach6:34

BEGIN

Coding Our Brute Force Solution9:57

BEGIN

Space And Time Complexity3:16

BEGIN

Sliding Window Technique5:18

BEGIN

Hints For Optimizing Our Solution2:15

BEGIN

Thinking About Optimal Solution9:09

BEGIN

Coding Our Optimal Solution8:30

BEGIN

Note: Correction for explanation of +1

BEGIN

Optimal Code And Testing On LeetCode3:18

BEGIN

Strings - Question #6 - Valid Palindrome & Almost Palindrome

5 lectures

Intro To Palindromes9:41

BEGIN

Interview Question #6 - Valid Palindrome8:39

BEGIN

Almost A Palindrome10:15

BEGIN

Figuring Out Our Solution6:50

BEGIN

Coding Our Solution9:46

BEGIN

Introducing Linked Lists - Basics and Reverse A Linked List

4 lectures

Linked List Introduction3:58

BEGIN

Basic Algorithm: Reverse a Linked List8:21

BEGIN

Thinking About Our Solution10:55

BEGIN

Coding Reverse A Linked List Solution7:07

BEGIN

Linked List - Question #7 - M, N Reversals (Medium)

3 lectures

Interview Question #7 - M, N Reversals6:50

BEGIN

Coming Up With A Logical Solution16:33

BEGIN

Coding Our Solution15:38

BEGIN

Linked List - Question #8 - Merge Multi-Level Doubly Linked List (Medium)

4 lectures

Interview Question #8 - Merge Multi-Level Doubly Linked List8:52

BEGIN

Figuring Out Our Test Cases8:34

BEGIN

Thinking About Our Approach16:47

BEGIN

Coding Out Our Solution14:37

BEGIN

Linked List - Question #9 - Cycle Detection (Medium)

4 lectures

Interview Question #9 - Cycle Detection11:39

BEGIN

Floyd's Tortoise And Hare3:04

BEGIN

Coding Floyd's Algorithm8:54

BEGIN

Optional: Proof Of How Floyd's Algorithm Works25:51

BEGIN

Stacks - Question #10 - Valid Parentheses (Easy)

4 lectures

Intro to Stacks and Queues3:11

BEGIN

Interview Question #10 - Valid Parentheses9:23

BEGIN

Walking Through Our Problem - Identifying The Need For A Stack8:15

BEGIN

Coding Our Solution With A Stack9:18

BEGIN

Stacks - Question #11 - Minimum Brackets To Remove (Medium)

3 lectures

Interview Question #11 - Minimum Brackets To Remove7:38

BEGIN

Thinking About Our Solution12:45

BEGIN

Coding Our Solution10:53

BEGIN

Queues - Question #12 - Implement Queue With Stacks (Easy)

3 lectures

Question #12 - Implement Queue With Stacks4:10

BEGIN

Figuring Out Our Solution10:19

BEGIN

Coding Our Solution8:27

BEGIN

Recursion (Sorting and Hoare's QuickSelect) - Question #13 - Kth Largest Element

10 lectures

Introducing Recursion3:07

BEGIN

Optional: Tail Recursion19:54

BEGIN

Sorting2:23

BEGIN

Interview Question #13 - Kth Largest Element6:50

BEGIN

Insights From Quick Sort12:36

BEGIN

Understanding Divide And Conquer8:17

BEGIN

Coding Quicksort Into Our Solution14:53

BEGIN

Understanding Hoare's Quickselect Algorithm6:55

BEGIN

Coding Our Solution With Quickselect11:47

BEGIN

Correction About Time Complexity!

BEGIN

Recursion (Binary Search) - Question #14 - Start And End Of Target (Medium)

5 lectures

Understanding Binary Search9:32

BEGIN

How To Code Binary Search6:22

BEGIN

Question #14 - Start And End Of Target In A Sorted Array5:05

BEGIN

Walking Through Our Solution10:48

BEGIN

Coding Our Solution12:55

BEGIN

Binary Trees - Question #15 - Maximum Depth Of Binary Tree (Easy)

4 lectures

Intro to Binary Trees1:52

BEGIN

Question #15 - Maximum Depth of Binary Tree6:54

BEGIN

Learning The Process For Solving Binary Tree Problems19:12

BEGIN

Coding Our Solution6:11

BEGIN

Binary Trees - Question #16 - Level Order Of Binary Tree (Medium)

3 lectures

Question #16 - Level Order Of Binary Tree5:28

BEGIN

Walking Through Our Solution17:27

BEGIN

Coding Out Level Order Traversal11:38

BEGIN

Binary Trees - Question #17 - Right Side View of Tree (Medium)

6 lectures

Question #17 - Right Side View of Tree6:43

BEGIN

Understanding The Breadth First Search Approach8:26

BEGIN

Understanding The Depth First Search Approach9:22

BEGIN

Thinking About Pre-Order, In-Order, and Post-Order Traversals For Our Solution12:23

BEGIN

Completing Our DFS Solution7:41

BEGIN

Coding Our Final DFS Solution11:55

BEGIN

Full & Complete Binary Trees - Question #18 - Number Of Nodes In Complete Tree

4 lectures

Question #18 - Number Of Nodes In Complete Tree8:31

BEGIN

Thinking Deeply About A Full Binary Tree10:26

BEGIN

Figuring Out Number Of Nodes At Last Level15:28

BEGIN

Coding Out Our Full Solution20:39

BEGIN

Binary Search Tree - Question #19 - Validate Binary Search Tree (Medium)

4 lectures

Question #19 - Validate Binary Search Tree8:47

BEGIN

Thinking About Our Logical Solution15:04

BEGIN

Figuring Out Our Boundaries6:53

BEGIN

Coding Our Our Full Solution7:58

BEGIN

Heaps & Priority Queues

6 lectures

Introducing Heaps8:45

BEGIN

Insertion In Heaps - Understanding Sift Up7:35

BEGIN

Deletion In Heaps - Understanding Sift Down10:48

BEGIN

Starting To Code Our Priority Queue Class10:48

BEGIN

Coding Our Insertion And Sift Up Methods5:49

BEGIN

Coding Our Deletion And Sift Down Methods13:00

BEGIN

Intro To 2D-Arrays - Basics & Traversal Algorithms

7 lectures

Introducing 2D Arrays - What Are They?7:23

BEGIN

Depth First Search In 2D-Arrays7:24

BEGIN

Coding DFS - Setting Up For DFS9:43

BEGIN

Coding DFS - Implementing Recursive DFS8:40

BEGIN

Breadth First Search In 2D-Arrays7:48

BEGIN

Coding BFS10:05

BEGIN

Exercise: Imposter Syndrome2:55

BEGIN

2D-Arrays - Question #20 Number Of Islands (Medium)

6 lectures

A General Approach To Thinking About Most Graph Questions9:09

BEGIN

Question #20 Number Of Islands7:50

BEGIN

Approaching Our Problem - Thinking Deeply About The Values16:11

BEGIN

Approaching Our Problem - Thinking About Traversals8:55

BEGIN

Coding Our Solution19:08

BEGIN

Thinking About Space And Time Complexity14:38

BEGIN

2D-Arrays - Question #21 Rotting Oranges (Medium)

4 lectures

Question #21 Rotting Oranges6:57

BEGIN

Figuring Out Our Initial Logic11:04

BEGIN

Figuring Out The Rest Of Our Solution14:27

BEGIN

Coding Out Our Solution14:47

BEGIN

2D-Arrays - Question #22 - Walls And Gates (Medium)

3 lectures

Question #22 - Walls And Gates6:19

BEGIN

Figuring Out Our Logical Solution12:16

BEGIN

Coding Out Our Solution11:45

BEGIN

Intro to Graphs - Representation & Traversal Algorithms

6 lectures

Introduction To The Types Of Graphs11:06

BEGIN

Representing Our Graphs - Adjacency List & Adjacency Matrix7:19

BEGIN

Breadth First Search In Graphs4:39

BEGIN

Coding BFS7:53

BEGIN

Depth First Search In Graphs3:03

BEGIN

Coding DFS7:03

BEGIN

Graphs - Question #23 - Time Needed to Inform All Employees (Medium)

5 lectures

Question #23 - Time Needed to Inform All Employees12:51

BEGIN

Verifying Our Constraints And Thinking About Test Cases8:12

BEGIN

How To Represent Our Graph As An Adjacency List9:37

BEGIN

Solving Our Problem Logically Using DFS Traversal7:48

BEGIN

Coding Our DFS Solution10:01

BEGIN

Graphs - Question #24 - Course Scheduler (Medium)

6 lectures

Question #24 - Course Scheduler10:24

BEGIN

Thinking About Our Initial Solution - BFS7:56

BEGIN

Coding Out Our Initial BFS Solution15:28

BEGIN

What is Topological Sort?7:55

BEGIN

Thinking About A Solution With Topological Sort4:49

BEGIN

Coding Our Final Solution15:47

BEGIN

Graphs - Question #25 - Network Time Delay (Medium)

10 lectures

Question #25 - Network Time Delay12:39

PREVIEW

Thinking About How To Approach The Problem8:37

BEGIN

Greedy Method & What Is Dijkstra's Algorithm?15:30

BEGIN

Thinking About A Solution With Dijkstra's Algorithm8:55

BEGIN

Coding Our Solution With Dijkstra17:32

BEGIN

Time And Space Complexity Of Our Solution13:08

BEGIN

Thinking About Negative Weights7:41

BEGIN

What is The Bellman-Ford Algorithm? - Conceptualizing Dynamic Programming16:22

BEGIN

What is The Bellman-Ford Algorithm? - The Algorithm Itself16:17

BEGIN

Coding Our Solution With Bellman-Ford9:19

BEGIN

Dynamic Programming - Question #26 - Minimum Cost Of Climbing Stairs (Easy)

8 lectures

Question #26 - Minimum Cost Of Climbing Stairs & How To Approach DP9:38

BEGIN

Understanding & Identifying Recurrence Relation15:48

BEGIN

First Step - Recursive Solution From Recurrence Relation5:34

BEGIN

Second Step - Memoizing Our Redundant Recursive Calls7:49

BEGIN

Coding Our Memoization Optimization7:50

BEGIN

Understanding The Bottom Up Approach (Tabulation)6:29

BEGIN

Third Step - Bottom Up Tabulation5:24

BEGIN

Fourth Step - Bottom Up Optimization6:52

BEGIN

Dynamic Programming - Question #27 - Knight Probability In Chessboard (Medium)

9 lectures

Question #27 - Knight Probability In Chessboard10:09

BEGIN

Thinking About Test Cases To Help Us3:51

BEGIN

Identifying The Recurrence Relation15:29

BEGIN

First Step - Recursive Solution From Recurrence Relation5:10

BEGIN

Second Step - Memoizing Our Redundant Recursive Calls14:13

BEGIN

Figuring Out The Logic For Our Bottom Up Solution13:59

BEGIN

Third Step - Bottom Up Tabulation8:31

BEGIN

Fourth Step - Bottom Up Optimization6:55

BEGIN

Dynamic Programming Question List

BEGIN

Backtracking - Question #28 - Sudoku Solver (Hard)

8 lectures

Understanding The Basics Of Backtracking7:06

BEGIN

Question #28 - Sudoku Solver4:19

BEGIN

Learning The Backtracking Template11:18

BEGIN

Applying Our Backtracking Template To Sudoku Solver Logic6:42

BEGIN

Coding How To Get Box ID7:49

BEGIN

Setting Up Our Solution Code7:05

BEGIN

Coding The Recursive Backtracking Portion Of Our Solution19:18

BEGIN

Thinking About The Space And Time Complexity6:58

BEGIN

Interface Design - Question #29 - Monarchy

4 lectures

Understanding Interface Design & Question #29 - Monarchy10:52

BEGIN

Figuring Out Our Test Cases5:57

BEGIN

Thinking About The Logical Of The Monarchy9:41

BEGIN

Coding Our Monarchy Solution14:57

BEGIN

Tries - Question #30 - Implement Prefix Trie (Medium)

4 lectures

Introducing Tries1:07

BEGIN

Question #30 - Implement Prefix Trie9:49

BEGIN

Understanding The Logic For Our Methods3:54

BEGIN

Implementing Our Prefix Trie Data Structure Solution15:15

BEGIN

Where To Go From Here?

6 lectures

Thank You!1:17

BEGIN

Review This Course!

BEGIN

LinkedIn Endorsements

BEGIN

Become An Alumni

BEGIN

Coding Challenges

BEGIN

Learning Guideline

BEGIN

Appendix: Big O

24 lectures

Note About Appendix Videos

BEGIN

Section Overview2:24

BEGIN

What Is Good Code?6:57

BEGIN

Big O and Scalability11:08

BEGIN

O(n)5:39

BEGIN

O(1)6:10

BEGIN

Exercise: Big O Calculation

BEGIN

Solution: Big O Calculation5:54

BEGIN

Exercise: Big O Calculation 2

BEGIN

Solution: Big O Calculation 22:29

BEGIN

Simplifying Big O1:50

BEGIN

Big O Rule 14:28

BEGIN

Big O Rule 26:36

BEGIN

Big O Rule 33:13

BEGIN

O(n^2)7:13

BEGIN

Big O Rule 46:47

BEGIN

Big O Cheat Sheet3:18

BEGIN

What Does This All Mean?5:32

BEGIN

O(n!)1:18

BEGIN

3 Pillars Of Programming3:32

BEGIN

Space Complexity2:22

BEGIN

Exercise: Space Complexity6:24

BEGIN

Exercise: Twitter7:13

BEGIN

Section Summary4:43

BEGIN

Appendix: Arrays

3 lectures

Arrays Introduction13:51

BEGIN

Static vs Dynamic Arrays6:40

BEGIN

Optional: Implementing An Array17:19

BEGIN

Appendix: Hash Tables

4 lectures

Hash Tables Introduction4:10

BEGIN

Hash Function5:56

BEGIN

Hash Collisions9:43

BEGIN

Hash Tables VS Arrays2:01

BEGIN

Appendix: Linked Lists

8 lectures

Linked Lists Introduction2:26

BEGIN

What Is A Linked List?4:36

BEGIN

Exercise: Why Linked Lists?2:05

BEGIN

Solution: Why Linked Lists?5:35

BEGIN

What Is A Pointer?5:45

BEGIN

Doubly Linked Lists3:18

BEGIN

Singly VS Doubly Linked Lists2:40

BEGIN

Linked Lists Review5:07

BEGIN

Appendix: Stacks + Queues

6 lectures

Stacks + Queues Introduction2:58

BEGIN

Stacks3:28

BEGIN

Queues3:30

BEGIN

Exercise: Stacks VS Queues3:06

BEGIN

Solution: Stacks VS Queues3:39

BEGIN

Stacks + Queues Review2:19

BEGIN

Appendix: Trees

7 lectures

Trees Introduction6:23

BEGIN

Binary Trees5:45

BEGIN

O(log n)7:00

BEGIN

Binary Search Tree6:12

BEGIN

Balanced VS Unbalanced BST3:42

BEGIN

BST Pros and Cons2:26

BEGIN

Trie3:16

BEGIN

Appendix: Searching + BFS + DFS

9 lectures

Graph + Tree Traversals3:56

BEGIN

BFS Introduction2:44

BEGIN

DFS Introduction3:23

BEGIN

BFS vs DFS3:20

BEGIN

Exercise: BFS vs DFS0:44

BEGIN

Solution: BFS vs DFS3:16

BEGIN

breadthFirstSearch()9:15

BEGIN

PreOrder, InOrder, PostOrder5:21

BEGIN

depthFirstSearch()12:03

BEGIN

Appendix: Recursion

6 lectures

Recursion Introduction5:36

BEGIN

Stack Overflow6:17

BEGIN

Anatomy Of Recursion10:27

BEGIN

Recursive VS Iterative4:16

BEGIN

When To Use Recursion4:00

BEGIN

Recursion Review2:47

BEGIN

Appendix: Sorting

17 lectures

Sorting Introduction7:01

BEGIN

The Issue With sort()6:51

BEGIN

Sorting Algorithms3:37

BEGIN

Bubble Sort3:45

BEGIN

Exercise: Bubble Sort

BEGIN

Solution: Bubble Sort5:06

BEGIN

Selection Sort2:39

BEGIN

Exercise: Selection Sort

BEGIN

Solution: Selection Sort2:23

BEGIN

Dancing Algorithms1:36

BEGIN

Exercise: Insertion Sort

BEGIN

Insertion Sort2:38

BEGIN

Solution: Insertion Sort2:06

BEGIN

Merge Sort and O(n log n)8:59

BEGIN

Exercise: Merge Sort

BEGIN

Solution: Merge Sort4:44

BEGIN

Quick Sort7:40

BEGIN

Meet your instructors

Your instructors aren’t just experts with years of real-world professional experience. They have been in your shoes. They make learning fun. They make complex topics feel simple. They will motivate you. They will push you. And they go above and beyond to help you succeed.

Yihua Zhang

Hi, I'm Yihua Zhang!

Yihua, an instructor of Zero To Mastery Academy, has been teaching students how to code for over a decade and has worked as a Senior Software Developer for numerous years for some of the largest tech companies in the world.

SEE MY BIO & COURSES

Yihua Zhang

Senior Software Developer

Andrei Neagoie

Hi, I'm Andrei Neagoie!

Andrei, lead instructor of Zero To Mastery Academy, has taught 1,000,000+ students worldwide how to code and get hired. ZTM grads work for world-class companies like Apple, Google, Amazon, Tesla, IBM, Facebook, Shopify and many more.

SEE MY BIO & COURSES

Andrei Neagoie

Senior Software Engineer

Frequently asked questions

Are there any prerequisites for this course?

  • No previous Computer Science knowledge necessary
  • Basic understanding of one programming language
  • If you have the ambition to learn and put in the effort required to get hired by one of these companies, we will make it achievable for you!

Who is this course for?

  • You want to work at Google, Amazon, Facebook, Microsoft, Apple, Netflix or other top tech companies earning $200K+
  • Any Engineer, Developer, or Programmer who wants to improve their interviewing skills and ace the technical interviews at big tech companies
  • Anyone interested in improving their whiteboard coding skills
  • Anyone who wants to become a better Developer
  • Anyone who wants to improve their problem solving skills
  • Self-taught programmers without a Computer Science degree

Do you provide a certificate of completion?

We definitely do and they are quite nice. You will also be able to add Zero To Mastery Academy to the education section of your LinkedIn profile as well.

Are there subtitles?

Yes! We have high quality subtitles in 11 different languages: English, Spanish, French, German, Dutch, Romanian, Arabic, Hindi, Portuguese, Indonesian, and Japanese.

You can even adjust the text size, color, background and more so that the subtitles are perfect just for you!

Still have more questions about the Academy?

Still have more questions specific to the Academy membership? No problem, we answer some more here.

Invest in a better you. For less than a coffee a day.

Choose your currency:
$ USD US Dollar
Lifetime
100% OFF$999
$999
Only pay once, ever
You're serious about advancing your career and never getting left behind
Start Learning Now

MOST POPULAR

Save 40% vs. monthly (that's $189 a year)
Annual
100% OFF$279 / year
$23 / month
$279 / year
You're committed to getting hired and starting a career in tech
Start Learning Now
Monthly
100% OFF$39 / month
$39 / month
You're ready to upskill and advance your career
Start Learning Now

Every ZTM membership includes:

Unlimited access to all courses, projects + workshops, and career paths
Access to our private Discord with 400,000+ members
Access to our private LinkedIn networking group
Custom ZTM course completion certificates
Live career advice sessions with mentors, every month
Full access to all future courses, content, and features
100% RISK FREE

We know you'll love ZTM. That's why we provide a no hassle, 30-day money back guarantee.