Teach on Udemy

Turn what you know into an opportunity and reach millions around the world.

Learn More

Your cart is empty.

Keep shopping

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

Name: 50 days of LEETCODE in C++:MAANG Algorithms Coding Interview
Rating: 4.8 (20 reviews)

Practice data structure and algorithms questions for interviews at MAANG companies like Google, Facebook, Apple & Amazon

Created byInterview Temple

Last updated 11/2024

English

What you'll learn

Solve Easy to Hard Difficulty problems using different data structures and algorithms
How to solve some of the most popular interview questions asked by major tech companies
Breaking down the coding interview problems in a step by step, systematic manner
Popular problems patterns
Algorithms and data structures
Strengthen your problem solving and programming skills

Course content

49 sections • 218 lectures • 23h 1m total length

Introduction to the problem10:42
We examine the container with the most water problem by treating the array as vertical lines and picking two walls to maximize area. Area equals width times the minimum height.
Brute force solution intuition6:15
Pseudocode walkthrough7:36
Better Approach intuition10:34
Apply the two-pointer technique to optimize the container with the most water problem, moving the pointer at the smaller wall to maximize area and reduce time complexity.
Approach 2 Pseudocode walkthrough8:16
Implementing the code2:47
Implement a two-pointer solution in C++ to maximize the container area by updating max area with min(height[L], height[R])*(R-L) and moving the smaller height pointer until left and right pointers meet.

Brute force Intuition6:38
Move zeros to the end while preserving the relative order of non-zero elements, then explore a brute-force approach using an auxiliary array and zero padding.
Brute force pseudocode walkthrough3:56
Explore a brute force approach that builds an output array of non-zero elements in order, then appends zeros, with linear time and O(n) space.
Better Approach Intuition7:01
Better Approach Pseudocode walkthrough3:44
Implementing the code3:04
implement the move zeros function to relocate non-zero elements to the front of the array, preserving their order, and fill the remainder with zeros in place, with no extra space.

Introduction to the problem4:08
Brute Force Intuition13:11
Pseudocode walkthrough16:23
Walk through the pseudocode to learn a brute-force method for the longest substring without repeating characters, then apply sliding window optimization with left and right pointers and a seen map.
Approach 2 Intuition12:56
Approach 2 pseudocode walkthrough5:44
Implementing the code4:46
Implement a function that returns the length of the longest unique substring using a sliding window and a hash map, updating left and right pointers and answer as you traverse.

Introduction to the problem and brute force approach6:13
Brute force Pseudocode walkthrough4:43
Explore a brute force pseudocode walkthrough that uses forward and backward scans to locate first and last indices of a target in an array, with O(n) time and O(1) space.
Approach 2: Optimal Approach intuition11:27
Pseudocode walkthrough part 17:18
Pseudocode walkthrough part 26:58
Implementing the code7:31
Learn to locate the first and last occurrences of a target in a sorted array using binary search, with precise boundary checks and returning [first, last] indices.

Introduction to the problem4:19
Approach 1: Brute Force Approach4:14
Explore the brute force approach to find the missing number in a range by sorting the input and inspecting consecutive elements to detect a gap, then return the missing value.
Approach 2: A Better Approach Explanation5:40
Present a better approach to find the missing number from 0 to n in a distinct array by using a hash map for constant-time lookups, achieving O(n) time.
PseudoCode Walkthrough For Approach 23:18
Implementing the code0:24
Approach 3: Optimal Approach7:13
Implementing the optimal approach1:29
Compute the missing number by summing the input and comparing to Gauss's formula for zero to n. Subtract to reveal and return the missing value; full code is in repository.

Requirements

Basic Knowledge of fundamental data structures and algorithms is preferred
Basic Knowledge of c++ is preferred
If you want to submit the code yourself, you should be familiar with leetcode and have an account

Description

Want to master popular problem-solving techniques, data structures, and algorithms that interviewers love? Dive right in!
Crave step-by-step explanations for the industry's hottest interview questions? We've got you covered.
Looking to up your game in competitive programming? Buckle up for a thrilling journey!

Welcome to the course!

In this course, you'll have a detailed, step by step explanation of hand-picked LeetCode questions where you'll learn about the most popular techniques and problems used in the coding interview, This is the course I wish I had when I was doing my interviews. and it comes with a 30-day money-back guarantee

What is LeetCode?

LeetCode is essentially a huge repository of real interview questions asked by the most popular tech companies ( Google, Amazon, Facebook, Microsoft, and more ).

The problem with LeetCode is also its advantage, IT'S HUGE, so huge in fact that interviewers from the most popular companies often directly ask questions they find on LeetCode, So it's hard to navigate through the huge amount of problems to find those that really matter, this is what this course is for.

I spent countless hours on LeetCode and I'm telling you that you don't have to do the same and still be able to get a job at a major tech company.

Course overview :

In this course, I compiled the most important and the most popular interview questions asked by these major companies and I explain them, in a true STEP BY STEP fashion to help you understand exactly how to solve these types of questions.

The problems are handpicked to ensure complete coverage of the most popular techniques, data structures, and algorithms used in interviews so you can generalise the patterns you learn here on other problems.

Each problem gets multiple videos :

Explanation and intuition video(s): we do a detailed explanation of the problems and its solution, this video will be longer because we will do a step by step explanation for the problems.
Coding video(s): where we code the solution discussed in the explanation video together.
Walkthrough video(s): where we go over each line of code and see what it does

We will use basic c++ for this course to code our solutions, previous knowledge in c++ is preferred but NOT required for the coding part of the course.

The problems are categorised for easier navigation and will be regularly updated with more popular and interesting problems.

Some of the stuff this course will cover are :

Arrays and Strings interview questions.
Searching interview questions and algorithms.
Dynamic Programming interview questions.
Backtracking interview questions ( With step by step visualisation ).
Trees and Graphs interview questions and algorithms.
Data structures Like Stacks, Queues, Maps, Linked Lists, and more.

In other words, this course is your one-stop-shop for your dream job.

Who this course is for:

Developers eager to pass the coding interview at huge companies like Google, Facebook, Microsoft, Amazon, etc.
People who want to develop their problem solving skills.
Developers getting ready for their technical interviews.
Students getting ready for their internship coding interviews.
People who want to get better at competitive coding

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

What you'll learn

Explore related topics

Course content

Microsoft Array Question: Container with most water (Medium)6 lectures • 46min

Google Array Question: Valid mountain array (Easy)4 lectures • 19min

Google Array Question: Boats to save people (Medium)4 lectures • 26min

Facebook Array Question: Move Zeroes (Easy)5 lectures • 24min

Amazon Array Question: Longest substring without repeating characters (Medium)6 lectures • 57min

Arrays Question:Find first and last position of element in sorted Array (Medium)6 lectures • 44min

Google Array question: first bad version (Easy)4 lectures • 23min

Microsoft Math Question: Missing Number (Easy-ish)7 lectures • 27min

Amazon Math Question: Count Primes5 lectures • 32min

Airbnb Math Question: Single Number6 lectures • 31min

Requirements

Description

Who this course is for: