50 days of LEETCODE in C++:MAANG Algorithms Coding Interview

Course Curriculum

Chapter 1: Microsoft Array Question: Container with most water (Medium)

Lecture 1: Introduction to the problem

Lecture 2: Brute force solution intuition

Lecture 3: Pseudocode walkthrough

Lecture 4: Better Approach intuition

Lecture 5: Approach 2 Pseudocode walkthrough

Lecture 6: Implementing the code

Chapter 2: Google Array Question: Valid mountain array (Easy)

Lecture 1: Introduction to the problem

Lecture 2: How to think about this problem

Lecture 3: Pseudocode Walkthrough

Lecture 4: Implementing the code

Chapter 3: Google Array Question: Boats to save people (Medium)

Lecture 1: Problem Introduction

Lecture 2: How to intuitively think about this problem

Lecture 3: Pseudocode Walkthrough

Lecture 4: Implementing the code

Chapter 4: Facebook Array Question: Move Zeroes (Easy)

Lecture 1: Brute force Intuition

Lecture 2: Brute force pseudocode walkthrough

Lecture 3: Better Approach Intuition

Lecture 4: Better Approach Pseudocode walkthrough

Lecture 5: Implementing the code

Chapter 5: Amazon Array Question: Longest substring without repeating characters (Medium)

Lecture 1: Introduction to the problem

Lecture 2: Brute Force Intuition

Lecture 3: Pseudocode walkthrough

Lecture 4: Approach 2 Intuition

Lecture 5: Approach 2 pseudocode walkthrough

Lecture 6: Implementing the code

Chapter 6: Arrays Question:Find first and last position of element in sorted Array (Medium)

Lecture 1: Introduction to the problem and brute force approach

Lecture 2: Brute force Pseudocode walkthrough

Lecture 3: Approach 2: Optimal Approach intuition

Lecture 4: Pseudocode walkthrough part 1

Lecture 5: Pseudocode walkthrough part 2

Lecture 6: Implementing the code

Chapter 7: Google Array question: first bad version (Easy)

Lecture 1: Introduction To The Problem And Brute Force Approach

Lecture 2: Optimal Solution Intuition

Lecture 3: Optimal solution pseudocode walkthrough

Lecture 4: Implementing the code

Chapter 8: Microsoft Math Question: Missing Number (Easy-ish)

Lecture 1: Introduction to the problem

Lecture 2: Approach 1: Brute Force Approach

Lecture 3: Approach 2: A Better Approach Explanation

Lecture 4: PseudoCode Walkthrough For Approach 2

Lecture 5: Implementing the code

Lecture 6: Approach 3: Optimal Approach

Lecture 7: Implementing the optimal approach

Chapter 9: Amazon Math Question: Count Primes

Lecture 1: Problem Introduction And Brute Force Explanation

Lecture 2: Pseudocode Walkthrough For Brute Force Approach

Lecture 3: Approach 2: Optimal solution

Lecture 4: Pseudocode Walkthrough For Optimal Approach

Lecture 5: Code Implementation

Chapter 10: Airbnb Math Question: Single Number

Lecture 1: Introduction to the problem and brute force approach

Lecture 2: Pseudocode walkthrough for brute approach

Lecture 3: Approach 2: better Approach

Lecture 4: Implementing the code

Lecture 5: Approach 3: optimal approach

Lecture 6: Implementing the optimal approach

Chapter 11: Amazon Math Question: Robot return to origin (Easy)

Lecture 1: Explaining the problem

Lecture 2: Implementing the code

Chapter 12: Facebook Math Question: Add Binary (Easy)

Lecture 1: Introduction to the problem

Lecture 2: Examples of binary additions

Lecture 3: Pseudocode Implementation

Lecture 4: Pseudocode Walkthrough

Lecture 5: Implementing the code

Chapter 13: Google Hash Tables / Dictionaries question: Two Sum (Easy)

Lecture 1: Approach 1: Introduction to the problem and brute force approach

Lecture 2: Brute force Pseudocode Implementation

Lecture 3: Pseudocode Walkthrough

Lecture 4: Approach 2: Optimal Approach Explanation

Lecture 5: Pseudocode Walkthrough

Lecture 6: Code Implementation

Chapter 14: Google Hash Tables / Dictionaries question: Contains Duplicate

Lecture 1: Introduction to the problem and multiple approaches

Lecture 2: Optimal Approach

Lecture 3: Code Implementation

Chapter 15: Google Hash Tables / Dictionaries question: Majority Element

Lecture 1: Approach 1 Intuition

Lecture 2: Approach 1 Pseudocode Walkthrough

Lecture 3: Approach 2 – Majority Element Intuition

Lecture 4: Implementing Approach 2 code

Lecture 5: Approach 3 Intuition – Optimal solution

Lecture 6: Approach 3 Walkthrough – Optimal solution

Lecture 7: Implementing Approach 3 (optimal approach)

Chapter 16: Hash Tables / Dictionaries question: 4sum 2 (Medium)

Lecture 1: Brute force Explanation

Lecture 2: Brute Force Pseudocode Walkthrough

Lecture 3: Approach 2: Optimal approach

Lecture 4: Implementing the code

Chapter 17: Linkedin Hash Tables / Dictionaries question: Minimum Window Substring (Hard)

Lecture 1: Explanation – Minimum Window Substring – part 1

Lecture 2: Explanation – Minimum window substring – part 2

Lecture 3: Explanation – Minimum window substring – part 3