FAANG Coding Interview Roadmap

Annual Subscription

Get instant access to all current and upcoming courses for one year.

OR

Lifetime Access - This Bundle

Get lifetime access to this bundle only.

Discounted Prices for Your Region

Certification on completing the course.

Learning Objectives

Comprehensive Coverage: The roadmap covers all essential topics required for FAANG coding interviews.

Practical Exercises: The roadmap offers numerous coding challenges to provide hands-on experience and reinforce learning.

Flexibility: Learn at your own pace with this online roadmap, which you can access anytime, anywhere.

Community Support: Join a community of like-minded learners, share your doubts, discuss ideas, and learn together.

Path Contents

• 20 Chapters • 495 Lessons

Grokking Meta Coding Interview

Crack the Meta Coding Interview: The Ultimate Guide to Master the Top 45 Most Frequently Asked Coding Interview Questions.

• 4 Chapters • 91 Lessons

Hide Contents

1.

Introduction

1 lesson

Who Should Take This Course?

2.

Meta Easy Problems

20 lessons

Toeplitz Matrix (easy)

Solution: Toeplitz Matrix

Remove All Adjacent Duplicates In String (easy)

Solution: Remove All Adjacent Duplicates In String

Minimum Depth of a Binary Tree (easy)

Solution: Minimum Depth of a Binary Tree

Tree Diameter (easy)

Solution: Tree Diameter

Hidden Document

3.

Meta Medium Problems

50 lessons

Diagonal Traverse (medium)

Solution: Diagonal Traverse

Shortest Path in Binary Matrix (medium)

Solution: Shortest Path in Binary Matrix

Maximum Swap (medium)

Solution: Maximum Swap

Custom Sort String (medium)

Solution: Custom Sort String

Binary Tree Vertical Order Traversal (medium)

Solution: Binary Tree Vertical Order Traversal

Buildings With an Ocean View (medium)

Solution: Buildings With an Ocean View

Hidden Document

4.

Meta Hard Problems

20 lessons

Sliding Window Median (hard)

Solution: Sliding Window Median

Alien Dictionary (hard)

Solution: Alien Dictionary

Minimum Window Substring (hard)

Solution: Minimum Window Substring

Best Meeting Point (hard)

Solution: Best Meeting Point

Hidden Document

Grokking Microsoft Coding Interview

Crack the Microsoft Coding Interview: The Ultimate Guide to Master the Top 50 Most Frequently Asked Coding Questions From Microsoft Interviews.

• 4 Chapters • 101 Lessons

Hide Contents

1.

Introduction

1 lesson

Who Should Take This Course?

2.

Microsoft Easy Problems

30 lessons

Buddy Strings (easy)

Solution: Buddy Strings

Can Place Flowers (easy)

Solution: Can Place Flowers

Reverse a LinkedList (easy)

Solution: Reverse a LinkedList

Maximum Number of Balloons (easy)

Solution: Maximum Number of Balloons

Hidden Document

3.

Microsoft Medium Problems

50 lessons

Nth Digit (medium)

Solution: Nth Digit

Restore IP Addresses (medium)

Solution: Restore IP Addresses

Find Original Array From Doubled Array (medium)

Solution: Find Original Array From Doubled Array

Reverse Words in a String II (medium)

Solution: Reverse Words in a String II

Longest Arithmetic Subsequence (medium)

Solution: Longest Arithmetic Subsequence

Matchsticks to Square (medium)

Solution: Matchsticks to Square

Hidden Document

4.

Microsoft Hard Problems

20 lessons

Regular Expression Matching (hard)

Solution: Regular Expression Matching

First Missing Positive (hard)

Solution: First Missing Positive

Largest Rectangle in Histogram (hard)

Solution: Largest Rectangle in Histogram

Sliding Window Maximum (hard)

Solution: Sliding Window Maximum

Hidden Document

Grokking Amazon Coding Interview

Crack the Amazon Coding Interview: The Ultimate Guide to Master the Top 50 Most Frequently Asked Coding Questions From Amazon Interviews.

• 4 Chapters • 101 Lessons

Hide Contents

1.

Introduction

1 lesson

Who Should Take This Course?

2.

Amazon Easy Problems

30 lessons

Redistribute Characters to Make All Strings Equal (easy)

Solution: Redistribute Characters to Make All Strings Equal

Longest Common Prefix (easy)

Solution: Longest Common Prefix

Make Array Zero by Subtracting Equal Amounts (easy)

Solution: Make Array Zero by Subtracting Equal Amounts

Leaf-Similar Trees (easy)

Solution: Leaf-Similar Trees

Hidden Document

3.

Amazon Medium Problems

50 lessons

Maximum Length of Subarray With Positive Product (medium)

Solution: Maximum Length of Subarray With Positive Product

Largest Submatrix With Rearrangements (medium)

Solution: Largest Submatrix With Rearrangements

Count the Number of Good Subarrays (medium)

Solution: Count the Number of Good Subarrays

Minimum Suffix Flips (medium)

Solution: Minimum Suffix Flips

Minimum Number of Operations to Make Array Empty (medium)

Solution: Minimum Number of Operations to Make Array Empty

Next Greater Element II (medium)

Solution: Next Greater Element II

Hidden Document

4.

Amazon Hard Problems

20 lessons

Constrained Subsequence Sum (hard)

Solution: Constrained Subsequence Sum

Number of Valid Subarrays (hard)

Solution: Number of Valid Subarrays

Count Vowels Permutation (hard)

Solution: Count Vowels Permutation

Concatenated Words (hard)

Solution: Concatenated Words

Hidden Document

Grokking Google Coding Interview

Crack the Google Coding Interview: The Ultimate Guide to Master the Top 50 Most Frequently Asked Coding Questions From Google Interviews.

• 4 Chapters • 101 Lessons

Hide Contents

1.

Introduction

1 lesson

Who Should Take This Course?

2.

Google Easy

30 lessons

Add Binary (easy)

Solution: Add Binary

Valid Mountain Array (easy)

Solution: Valid Mountain Array

Set Mismatch (easy)

Solution: Set Mismatch

Is Subsequence (easy)

Solution: Is Subsequence

Hidden Document

3.

Google Medium

50 lessons

Gray Code (medium)

Solution: Gray Code

2 Keys Keyboard (medium)

Solution: 2 Keys Keyboard

Arithmetic Slices (medium)

Solution: Arithmetic Slices

Unique Length-3 Palindromic Subsequences (medium)

Solution: Unique Length-3 Palindromic Subsequences

Minimum Difference Between Largest and Smallest Value in Three Moves (medium)

Solution: Minimum Difference Between Largest and Smallest Value in Three Moves

Letter Combinations of a Phone Number (medium)

Solution: Letter Combinations of a Phone Number

Hidden Document

4.

Google Hard

20 lessons

Shortest Subarray with Sum at Least K (hard)

Solution: Shortest Subarray with Sum at Least K

Reverse Pairs (hard)

Solution: Reverse Pairs

Nth Magical Number (hard)

Solution: Nth Magical Number

Candy (hard)

Solution: Candy

Hidden Document

Grokking Oracle Coding Interview

Crack the Oracle Coding Interview: The Ultimate Guide to Master the Top 50 Most Frequently Asked Coding Questions From Oracle Interviews.

• 4 Chapters • 101 Lessons

Hide Contents

1.

Introduction

1 lesson

Who Should Take This Course?

2.

Oracle Easy

20 lessons

Count Number of Pairs With Absolute Difference K (easy)

Solution: Count Number of Pairs With Absolute Difference K

Degree of an Array (easy)

Solution: Degree of an Array

Find Subsequence of Length K With the Largest Sum (easy)

Solution: Find Subsequence of Length K With the Largest Sum

Rectangle Overlap (easy)

Solution: Rectangle Overlap

Hidden Document

3.

Oracle Medium

60 lessons

Longest Palindromic Substring (medium)

Solution: Longest Palindromic Substring

Single Element in a Sorted Array (medium)

Solution: Single Element in a Sorted Array

Pairs of Songs With Total Durations Divisible by 60 (medium)

Solution: Pairs of Songs With Total Durations Divisible by 60

Search a 2D Matrix II (medium)

Solution: Search a 2D Matrix II

Minimize Maximum of Array (medium)

Solution: Minimize Maximum of Array

Asteroid Collision (medium)

Solution: Asteroid Collision

Hidden Document

4.

Oracle Hard

20 lessons

Integer to English Words (hard)

Solution: Integer to English Words

Trapping Rain Water (hard)

Solution: Trapping Rain Water

First Missing Positive (hard)

Solution: First Missing Positive

Merge K Sorted Lists (hard)

Solution: Merge K Sorted Lists

Hidden Document