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

50 days of LEETCODE in C++:MAANG Algorithms Coding Interview, available at $19.99, has an average rating of 4.75, with 218 lectures, based on 6 reviews, and has 81 subscribers.

You will learn about 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 This course is ideal for individuals who are Developers eager to pass the coding interview at huge companies like Google, Facebook, Microsoft, Amazon, etc. or People who want to develop their problem solving skills. or Developers getting ready for their technical interviews. or Students getting ready for their internship coding interviews. or People who want to get better at competitive coding It is particularly useful for Developers eager to pass the coding interview at huge companies like Google, Facebook, Microsoft, Amazon, etc. or People who want to develop their problem solving skills. or Developers getting ready for their technical interviews. or Students getting ready for their internship coding interviews. or People who want to get better at competitive coding.

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

Summary

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

Price: $19.99

Average Rating: 4.75

Number of Lectures: 218

Number of Published Lectures: 218

Number of Curriculum Items: 218

Number of Published Curriculum Objects: 218

Original Price: $199.99

Quality Status: approved

Status: Live

What You Will 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

Who Should Attend

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

Target Audiences

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

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 questionsasked 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.

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

Instructors

Bit Punch
Software Engineer ( Ex-Googler )

Rating Distribution

1 stars: 0 votes

2 stars: 0 votes

3 stars: 1 votes

4 stars: 0 votes

5 stars: 5 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!