Leetcode In C++: Algorithms Coding Interview Questions

Published 8/2023
MP4 | Video: h264, 1280x720 | Audio: AAC, 44.1 KHz
Language: English | Size: 5.46 GB | Duration: 22h 57m

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

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

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 guaranteeWhat 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 doesWe 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.

Overview
Section 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

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

Lecture 7 Introduction to the problem

Lecture 8 How to think about this problem

Lecture 9 Pseudocode Walkthrough

Lecture 10 Implementing the code

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

Lecture 11 Problem Introduction

Lecture 12 How to intuitively think about this problem

Lecture 13 Pseudocode Walkthrough

Lecture 14 Implementing the code

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

Lecture 15 Brute force Intuition

Lecture 16 Brute force pseudocode walkthrough

Lecture 17 Better Approach Intuition

Lecture 18 Better Approach Pseudocode walkthrough

Lecture 19 Implementing the code

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

Lecture 20 Introduction to the problem

Lecture 21 Brute Force Intuition

Lecture 22 Pseudocode walkthrough

Lecture 23 Approach 2 Intuition

Lecture 24 Approach 2 pseudocode walkthrough

Lecture 25 Implementing the code

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

Lecture 26 Introduction to the problem and brute force approach

Lecture 27 Brute force Pseudocode walkthrough

Lecture 28 Approach 2: Optimal Approach intuition

Lecture 29 Pseudocode walkthrough part 1

Lecture 30 Pseudocode walkthrough part 2

Lecture 31 Implementing the code

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

Lecture 32 Introduction To The Problem And Brute Force Approach

Lecture 33 Optimal Solution Intuition

Lecture 34 Optimal solution pseudocode walkthrough

Lecture 35 Implementing the code

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

Lecture 36 Introduction to the problem

Lecture 37 Approach 1: Brute Force Approach

Lecture 38 Approach 2: A Better Approach Explanation

Lecture 39 PseudoCode Walkthrough For Approach 2

Lecture 40 Implementing the code

Lecture 41 Approach 3: Optimal Approach

Lecture 42 Implementing the optimal approach

Section 9: Amazon Math Question: Count Primes

Lecture 43 Problem Introduction And Brute Force Explanation

Lecture 44 Pseudocode Walkthrough For Brute Force Approach

Lecture 45 Approach 2: Optimal solution

Lecture 46 Pseudocode Walkthrough For Optimal Approach

Lecture 47 Code Implementation

Section 10: Airbnb Math Question: Single Number

Lecture 48 Introduction to the problem and brute force approach

Lecture 49 Pseudocode walkthrough for brute approach

Lecture 50 Approach 2: better Approach

Lecture 51 Implementing the code

Lecture 52 Approach 3: optimal approach

Lecture 53 Implementing the optimal approach

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

Lecture 54 Explaining the problem

Lecture 55 Implementing the code

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

Lecture 56 Introduction to the problem

Lecture 57 Examples of binary additions

Lecture 58 Pseudocode Implementation

Lecture 59 Pseudocode Walkthrough

Lecture 60 Implementing the code

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

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

Lecture 62 Brute force Pseudocode Implementation

Lecture 63 Pseudocode Walkthrough

Lecture 64 Approach 2: Optimal Approach Explanation

Lecture 65 Pseudocode Walkthrough

Lecture 66 Code Implementation

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

Lecture 67 Introduction to the problem and multiple approaches

Lecture 68 Optimal Approach

Lecture 69 Code Implementation

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

Lecture 70 Approach 1 Intuition

Lecture 71 Approach 1 Pseudocode Walkthrough

Lecture 72 Approach 2 - Majority Element Intuition

Lecture 73 Implementing Approach 2 code

Lecture 74 Approach 3 Intuition - Optimal solution

Lecture 75 Approach 3 Walkthrough - Optimal solution

Lecture 76 Implementing Approach 3 (optimal approach)

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

Lecture 77 Brute force Explanation

Lecture 78 Brute Force Pseudocode Walkthrough

Lecture 79 Approach 2: Optimal approach

Lecture 80 Implementing the code

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

Lecture 81 Explanation - Minimum Window Substring - part 1

Lecture 82 Explanation - Minimum window substring - part 2

Lecture 83 Explanation - Minimum window substring - part 3

Lecture 84 Pseudocode Implementation

Lecture 85 Pseudocode Walkthrough

Lecture 86 Code Implementation - Minimum Window Substring

Section 18: Facebook Hash Tables / Dictionaries question: Group Anagrams (Medium)

Lecture 87 Explanation - Group Anagrams - Medium #49

Section 19: Microsoft Hash Tables / Dictionaries question: LRU Cache (Medium)

Lecture 88 Introduction to the problem

Lecture 89 Input/Ouput for the problem

Lecture 90 Intuition behind the problem

Lecture 91 Pseudocode implementation

Lecture 92 Pseudocode Walkthrough

Section 20: Apple Linked list question: Merge Two Sorted Lists (Easy)

Lecture 93 Explanation - Merge Two Sorted Lists - Easy #21

Lecture 94 Pseudocode Implementation - Merge Two Sorted Lists - Easy #21

Lecture 95 Walkthrough - Merge Two Sorted Lists - Easy #21

Lecture 96 Code - Merge Two Sorted Lists - Easy #21

Section 21: Amazon Linked list question: Linked list cycle (Medium)

Lecture 97 Explanation - Linked List Cycle - Easy #141

Lecture 98 Intuition - Linked List Cycle - Easy #141

Lecture 99 Walkthrough - Linked List Cycle - Easy #141

Lecture 100 Code - Linked List Cycle - Easy #141

Section 22: Microsoft Linked list question: Reverse linked list (Medium)

Lecture 101 Explanation - Reverse Linked List

Lecture 102 Intuition - Reverse Linked List

Lecture 103 pseudocode Implementation & Walkthrough - Reverse Linked List

Lecture 104 Implementing the code - Reverse Linked List

Section 23: Adobe Linked list question: Add two numbers (Medium)

Lecture 105 Explanation - Add Two Numbers

Lecture 106 Intuition - Add Two Numbers

Lecture 107 Pseudocode Implementation - Add Two Numbers

Lecture 108 Walkthrough - Add Two Numbers

Lecture 109 Code - Add Two Numbers

Section 24: Linked list question: Remove Nth node from end of list (Medium)

Lecture 110 Explanation - Remove Nth Node From End of List

Lecture 111 Intuition - Remove Nth Node From End of List

Lecture 112 Walkthrough - Remove Nth Node From End of List

Lecture 113 Approach 2 Explanation - Remove Nth Node From End of List

Lecture 114 Approach 2 Walkthrough - Remove Nth Node From End of List

Lecture 115 Code - Remove Nth Node From End of List

Section 25: Linked list question: Odd Even linked list (Medium)

Lecture 116 Explanation - Odd Even Linked List

Lecture 117 Intuition - Odd Even Linked List

Lecture 118 Implementation - Odd Even Linked List

Lecture 119 Walkthrough - Odd Even Linked List

Lecture 120 Code - Odd Even Linked List

Section 26: Facebook Backtracking question: Subsets (Medium)

Lecture 121 Explanation - Subsets

Lecture 122 Cascading solution explanation - Subsets

Lecture 123 Cascading solution walkthrough - Subsets

Lecture 124 Backtracking Approach 2 explanation - Subsets

Lecture 125 Implementing the code

Section 27: Amazon Backtracking question: Letter Combination of a Phone Number (Medium)

Lecture 126 Explanation - Letter Combinations of a Phone Number

Lecture 127 Intuition - Letter Combinations of a Phone Number

Lecture 128 Walkthrough - Letter Combinations of a Phone Number

Lecture 129 Code - Letter Combinations of a Phone Number

Section 28: Microsoft Backtracking question: Word Search (Medium)

Lecture 130 Explanation - Word Search - Medium #79

Section 29: Uber Backtracking question: Combination Sum (Medium)

Lecture 131 Explanation the problem

Lecture 132 Intuition behind the problem

Lecture 133 Walkthrough over the pseudocode

Lecture 134 Implementing the code

Section 30: Bloomberg Backtracking question: Palindrome Partitioning (Medium)

Lecture 135 Explaining the problem

Lecture 136 Pseudocode implementation

Lecture 137 Walkthrough over pseudocode

Lecture 138 Implementing the code

Section 31: Microsoft Trees question: Symmetric Trees (Easy)

Lecture 139 Explaining the problem

Lecture 140 Intuition behind the problem

Lecture 141 Walkthrough over pseudocode

Lecture 142 Implementing the code

Section 32: Google Trees question: Maximum Depth of a Binary Tree (Easy)

Lecture 143 Explaining the problem

Lecture 144 Intuition and pseudocode implementation

Lecture 145 Walkthrough over pseudocode

Lecture 146 Implementing the real code

Section 33: Amazon Trees question: Path Sum (Easy)

Lecture 147 Explaining the problem

Lecture 148 Intuition behind the problem

Lecture 149 Walkthrough over pseudocode

Lecture 150 Coding the solution

Section 34: Facebook Trees question: Lowest Common Ancestor of a Binary Tree (Medium)

Lecture 151 Explaining the problem

Lecture 152 Intuition behind the problem

Lecture 153 Pseudocode implementation

Lecture 154 Walkthrough over pseudocode

Section 35: Google Trees question: Kth Smallest Element In a BST (Medium)

Lecture 155 Explaining the problem and brute force approach

Lecture 156 Optimised Solution Explanation

Lecture 157 Implementing the code

Section 36: Microsoft Trees question: Serialise And Deserialise Binary Tree (Hard)

Lecture 158 Explaining the "Serialisation"

Lecture 159 Walkthrough over pseudocode (Serialisation)

Lecture 160 Explaining the "Deserialisation"

Lecture 161 Walkthrough over pseudocode (Deserialisation)

Section 37: Microsoft Trees question: Binary Tree Maximum Path Sum (Hard)

Lecture 162 Explaining the problem

Lecture 163 Intuition behind the problem

Lecture 164 Walkthrough over pseudocode

Lecture 165 Coding the solution

Section 38: Google Stack Question: Min Stack (Easy)

Lecture 166 Brute force explanation

Lecture 167 Walkthrough over pseudocode

Lecture 168 Optimal solution explanation

Section 39: Amazon Stack Question: Valid Parenthesis (Easy)

Lecture 169 Explaining the problem

Lecture 170 Intuition behind this problem

Lecture 171 Pseudocode Implementation

Lecture 172 Walkthrough over the pseudocode

Lecture 173 Implementing the code

Section 40: Apple Stack Question: Binary Tree Level Order Traversal (Medium)

Lecture 174 Explaining the problem

Lecture 175 Walkthrough over pseudocode

Lecture 176 Implementing the code

Section 41: Microsoft Queue Question: Binary Tree Zigzag Level Order Traversal (Medium)

Lecture 177 Explaining the problem

Lecture 178 Intuition behind the problem

Lecture 179 Walkthrough over pseudocode

Lecture 180 Optimal solution explanation

Lecture 181 Optimal solution pseudocode walkthrough

Lecture 182 Implementing the code

Section 42: Stack Question: Binary Tree Postorder Traversal (Medium)

Lecture 183 Explanation of the problem

Lecture 184 Implementing the code

Section 43: Google Dynamic Programming Question: House Robber (Easy)

Lecture 185 Explanation behind the problem

Lecture 186 Intuition behind the problem

Lecture 187 2nd Approach: Bottom Up dynamic programming

Lecture 188 Walkthrough behind pseudocode

Lecture 189 Implementing the code

Section 44: Facebook Dynamic Programming Question: Best Time To Buy And Sell Stocks (Easy)

Lecture 190 Explanation behind the problem

Lecture 191 Intuition behind the problem

Lecture 192 Walkthrough over pseudocode

Lecture 193 Optimal solution explanation

Lecture 194 Coding the solution

Section 45: Amazon Dynamic Programming Question: Climbing Stairs (Easy)

Lecture 195 Explaining the problem

Lecture 196 Intuition behind the problem

Lecture 197 Implementation the pseudocode

Lecture 198 Bottom up approach explanation

Lecture 199 Bottom up approach walkthrough

Lecture 200 Bottom up optimisation

Lecture 201 Code - Climbing Stairs

Section 46: Google Dynamic Programming Question: Coin Change (Medium)

Lecture 202 Explaining the problem

Lecture 203 Intuition behind the problem

Lecture 204 Pseudocode Implementation and optimisation

Lecture 205 Bottom up approach explanation

Lecture 206 Implementing the code

Section 47: Bloomberg Dynamic Programming Question: Unique Paths (Medium)

Lecture 207 Explaining the problem

Lecture 208 Pseudocode Implementation and walkthrough

Lecture 209 Implementing the code

Section 48: Microsoft Dynamic Programming Question: Longest Palindromic Substring (Medium)

Lecture 210 Explanation of the problem

Lecture 211 Initial Intuition behind the problem

Lecture 212 Optimising the previous solution

Lecture 213 Pseudocode Implementation

Lecture 214 Walkthrough over pseudocode

Lecture 215 Implementing the code

Section 49: Amazon Dynamic Programming Question: Trapping Rain Water (Hard)

Lecture 216 Explaining the problem

Lecture 217 Coding the implementation

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

Buy Premium Account From My Download Links & Get Fastest Speed.