LeetCode In Python 50 Algorithms Coding Interview Questions

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

4.5/5

LeetCode In Python 50 Algorithms Coding Interview Questions

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 python is preferred
If you want to submit the code yourself, you should be familiar with leetcode and have an account

Overview

Section 1: Introduction

Lecture 1 Introduction

Lecture 2 How to use this course

Lecture 3 What to do if you don’t understand an explanation or code video (Important)

Lecture 4 Utilize the video format of online courses

Section 2: Big O Notation (OPTIONAL)

Lecture 5 Big O Introduction

Lecture 6 Big O Exercises

Lecture 7 Formalizing Big O

Lecture 8 Big O Simplification

Lecture 9 Space complexity

Lecture 10 Logarithms

Section 3: ALGORITHM : Binary Search (OPTIONAL)

Lecture 11 Binary Search Algorithm

Lecture 12 Binary Search Implementation

Section 4: TECHNIQUE : Sliding Window (OPTIONAL)

Lecture 13 Sliding Window Technique

Lecture 14 Sliding Window Implementation

Section 5: INTERVIEW QUESTIONS: Arrays and Strings (Includes Google Questions)

Lecture 15 Explanation – Move Zeroes brute force Intuition – Easy #283

Lecture 16 Explanation – Move Zeroes brute force walkthrough – Easy #283

Lecture 17 Explanation – Move Zeroes better approach – Easy #283

Lecture 18 Explanation – Move Zeroes better approach walkthrough- Easy #283

Lecture 19 Code – Move Zeroes – Easy #283

Lecture 20 [Custom Input – NEW] – Move Zeroes

Lecture 21 Explanation – Boats to Save People intro- Medium #881

Lecture 22 Explanation – Boats to Save People intuition

Lecture 23 Explanation – Boats to Save People Walkthrough

Lecture 24 Code – Boats to Save People – Medium #881

Lecture 25 [Custom Input – NEW] – Boats to save people

Lecture 26 Explanation – Valid Mountain Array intro – Easy #941

Lecture 27 Explanation – Valid Mountain Array Intuition

Lecture 28 Explanation – Valid Mountain Array Walkthrough

Lecture 29 Code – Valid Mountain Array – Easy #941

Lecture 30 [Custom Input – NEW] – Valid Mountain Array

Lecture 31 Explanation – Container With Most Water – Medium #11

Lecture 32 Explanation – Container With Most Water Brute Force Intuition

Lecture 33 Explanation – Container With Most Water brute force walkthrough

Lecture 34 Explanation – Container With Most Water better approach intuition

Lecture 35 Explanation – Container With Most Water Better Approach walkthrough

Lecture 36 Code – Container With Most Water – Medium #11

Lecture 37 [Custom Input – NEW] – Container with most water

Lecture 38 Explanation – Longest Substring Without Repeating Characters – Medium #3

Lecture 39 Explanation – Longest Substring Without Repeating Characters – brute force

Lecture 40 Explanation – Longest Substring Without Repeating Characters – walkthrough

Lecture 41 Explanation – Longest Substring Without Repeating Characters – Approach 2

Lecture 42 Explanation – Longest Substring Without Repeating Characters – walkthrough

Lecture 43 Code – Longest Substring Without Repeating Characters – Medium #3

Lecture 44 [Custom Input – NEW] – Longest Substring Without repeating characters

Lecture 45 Explanation – Find First and Last Position of Element in Sorted Array-Medium #34

Lecture 46 Explanation – Find First and Last Position in a sorted array bruteforce pt 2

Lecture 47 Explanation – Find first and last position in a sorted array optimal solution

Lecture 48 Explanation – Find first and last position in a sorted array walkthrough pt1

Lecture 49 Explanation – Find first and last position in a sorted array walkthrough pt2

Lecture 50 Code – Find First and Last Position of Element in Sorted Array – Medium #34

Lecture 51 [Custom Input – NEW] – Find first and last position of element in sorted array

Lecture 52 Explanation – First Bad Version brute force – Easy #278

Lecture 53 Explanation – First Bad Version optimal solution – Easy #278

Lecture 54 Explanation – First Bad Version optimal solution walkthrough- Easy #278

Lecture 55 Code – First Bad Version – Easy #278

Lecture 56 [Custom Input – NEW] – First Bad Version – Easy #278

Section 6: INTERVIEW QUESTIONS: Math (Includes Microsoft Questions)

Lecture 57 Explanation – Missing Number – Easy #268

Lecture 58 Explanation – Missing Number brute force – Easy #268

Lecture 59 Explanation – Missing Number better approach- Easy #268

Lecture 60 Explanation – Missing Number walkthrough- Easy #268

Lecture 61 Missing Number part 5- optimal solution

Lecture 62 Code – Missing Number – Easy #268

Lecture 63 [Custom Input – NEW] – Missing Number – Easy #268

Lecture 64 Explanation part 1 – Count Primes – Easy #204

Lecture 65 Explanation part 2 – count primes – easy #204

Lecture 66 Explanation part 3 – count primes – easy #204

Lecture 67 Explanation part 4 – count primes – easy #204

Lecture 68 Code – Count Primes – Easy #204

Lecture 69 [Custom Input – NEW] – Count Primes – Easy #204

Lecture 70 Explanation – Single Number brute force – Easy #136

Lecture 71 Explanation – Single Number brute force walkthrough- Easy #136

Lecture 72 Explanation – Single Number optimal approach intuition- Easy #136

Lecture 73 Explanation – Single Number optimal approach walkthrough- Easy #136

Lecture 74 Code – Single Number – Easy #136

Lecture 75 [Custom Input – NEW] – Single Number – Easy#136

Lecture 78 [Custom Input – NEW] – Robot Return to Origin – Easy #657

Lecture 79 Explanation – Add Binary – Easy #67

Lecture 80 Explanation – Add Binary example- Easy #67

Lecture 81 Explanation – Add Binary implementation – Easy #67

Lecture 82 Explanation – Add Binary Walkthrough – Easy #67

Lecture 83 Code – Add Binary – Easy #67

Lecture 84 [Custom Input – NEW] – Add Binary – Easy #67

Section 7: DATA STRUCTURE: Hash Tables (OPTIONAL)

Lecture 85 [ IMPORTANT ] – Hash tables section is getting major revampes and updates

Lecture 86 What are hash tables ?

Lecture 87 Collision handling

Lecture 88 Collision handling techniques comparison

Section 8: INTERVIEW QUESTIONS: Hash Tables / Maps (Includes Facebook Questions)

Lecture 89 Explanation – Two Sum – Easy #1

Lecture 90 Explanation – Two Sum brute force implementation – Easy #1

Lecture 91 Explanation – Two Sum brute force walkthrough – Easy #1

Lecture 92 Explanation – Two Sum optimal approach – Easy #1

Lecture 93 Explanation – Two Sum optimal approach walkthrough – Easy #1

Lecture 94 Code – Two Sum – Easy #1

Lecture 95 [Custom Input] – Two Sum – Easy #1

Lecture 96 Explanation – Contains Duplicate – Easy #217 – part 1

Lecture 97 Explanation – Contains Duplicate – Easy #217 – part 2

Lecture 98 Code – Contains Duplicate – Easy #217

Lecture 99 [Custom Input] – Contains Duplicate – Easy #217

Lecture 100 Explanation – Majority Element – Easy #169

Lecture 101 Code – Majority Element – Easy #169

Lecture 102 [Custom Input] – Majority Element – Easy #169

Lecture 103 Explanation – Group Anagrams – Medium #49

Lecture 104 Code – Group Anagrams – Medium #49

Lecture 105 [Custom Input] – Group Anagrams – Medium #49

Lecture 106 Explanation – 4Sum II – Medium #454

Lecture 107 Explanation – 4Sum II brute force walkthrough – Medium #454

Lecture 108 Explanation – 4Sum II optimal solution – Medium #454

Lecture 109 Code – 4Sum II – Medium #454

Lecture 110 [Custom Input] – 4Sum II – Medium #454

Lecture 111 Explanation – LRU Cache – Medium #146

Lecture 112 Explanation – LRU Cache IO interface – Medium #146

Lecture 113 Explanation – LRU Cache Intuition – Medium #146

Lecture 114 Explanation – LRU Cache Implementation – Medium #146

Lecture 115 Explanation – LRU Cache walkthrough – Medium #146

Lecture 116 Code – LRU Cache – Medium #146

Lecture 117 [Custom Input] – LRU Cache – Medium #146

Lecture 118 Explanation – Minimum Window Substring – Hard #76

Lecture 119 Explanation – Minimum window substring – part 2

Lecture 120 Explanation – Minimum window substring – part 3

Lecture 121 Explanation – Minimum window substring – part 4

Lecture 122 Explanation – Minimum window susbtring – part 5

Lecture 123 Code – Minimum Window Substring – Hard #76

Section 9: DATA STRUCTURES: Linked Lists (OPTIONAL)

Lecture 124 What are Linked Lists ?

Lecture 125 Singly linked list creation implementation

Lecture 126 Singly linked list insertion implementation

Lecture 127 Singly linked list deletion implementation

Lecture 129 Doubly linked lists creation implementation

Lecture 130 Doubly linked lists insertion implementation

Lecture 131 Doubly linked list deletion implementation

Section 10: INTERVIEW QUESTIONS: Linked Lists (Includes Amazon Questions)

Lecture 132 Explanation – Merge Two Sorted Lists – Easy #21

Lecture 133 Code – Merge Two Sorted Lists – Easy #21

Lecture 134 [Custom Input – NEW] – Merge Two Sorted Lists – Easy #21

Lecture 135 Explanation – Linked List Cycle – Easy #141

Lecture 136 Code – Linked List Cycle – Easy #141

Lecture 137 [Custom Input – NEW] – Linked List Cycle – Easy #141

Lecture 138 Explanation – Reverse Linked List – Easy #206

Lecture 139 Code – Reverse Linked List – Easy #206

Lecture 140 [Custom Input – NEW] – Reverse Linked List – Easy #206

Lecture 141 Explanation – Add Two Numbers – Medium #2

Lecture 142 Code – Add Two Numbers – Medium #2

Lecture 143 [Custom Input – NEW] – Add Two Numbers – Medium #2

Lecture 144 Explanation – Remove Nth Node From End of List – Medium #19

Lecture 145 Code – Remove Nth Node From End of List – Medium #19

Lecture 146 [Custom Input – NEW] – Remove Nth Node From End of List – Medium #19

Lecture 147 Explanation – Odd Even Linked List – Medium #328

Lecture 148 Code – Odd Even Linked List – Medium #328

Lecture 149 [Custom Input – NEW] – Odd Even Linked List – Medium #328

Lecture 150 Explanation – Merge K Sorted Lists – Hard #23

Lecture 151 Code – Merge K Sorted Lists – Hard #23

Section 11: INTERVIEW QUESTIONS: Backtracking / Recursion (Includes Uber Questions)

Lecture 152 Explanation – Subsets – Medium #78

Lecture 153 Code – Subsets – Medium #78

Lecture 154 Explanation – Letter Combinations of a Phone Number – Medium #17

Lecture 155 Code – Letter Combinations of a Phone Number – Medium #17

Lecture 156 Explanation – Word Search – Medium #79

Lecture 157 Code – Word Search – Medium #79

Lecture 158 Explanation – Combination Sum – Medium #39

Lecture 159 Code – Combination Sum – Medium #39

Lecture 160 [IMPORTANT] palindrome partitioning is getting revamped

Lecture 161 Explanation – Palindrome Partitioning – Medium #131

Lecture 162 Code – Palindrome Partitioning – Medium #131

Section 12: DATA STRUCTURES: Stacks and Queues (OPTIONAL)

Lecture 163 What are stacks ?

Lecture 164 Stacks Implementation

Lecture 165 What are Queues

Lecture 166 Queues Implementation

Lecture 167 Interview Questions section is section 20 (but still watch in order)

Section 13: DATA STRUCTURE: Graphs (OPTIONAL)

Lecture 168 What are Graphs ?

Lecture 169 Directed Graph Implementation – Adjacency List

Lecture 170 Directed Graph Implementation – Adjacency Matrix

Lecture 171 Undirected Graph Implementation – Adjacency List

Lecture 172 Undirected Graph Implementation – Adjacency Matrix

Section 14: ALGORITHM: Depth First Search (DFS) – OPTIONAL

Lecture 173 Depth First Search (DFS)

Lecture 174 DFS implementation

Section 15: ALGORITHM: Breadth First Search (BFS) – OPTIONAL

Lecture 175 Breadth First Search (BFS)

Lecture 176 BFS Implementation

Section 16: ALGORITHM: Dijkstra’s Algorithm (OPTIONAL)

Lecture 177 Dijkstra’s Algorithm

Lecture 178 Explanation – network delay time – Medium #743

Lecture 179 Code – network delay time – Medium #743

Section 17: DATA STRUCTURE: Trees (OPTIONAL)

Lecture 180 What are trees ?

Lecture 181 Trees Implementation

Lecture 182 In-order Traversal Technique

Lecture 183 In-order traversal implementation

Lecture 184 Pre-order Traversal Technique

Lecture 185 Pre-order traversal implementation

Lecture 186 Post-order Traversal Technique

Lecture 187 Post-order traversal implementation

Section 18: DATA STRUCTURE: Binary Search Trees (BST) – OPTIONAL

Lecture 188 [ IMPORTANT ] This Binary Search Tree section is getting revamped

Lecture 189 What is a binary search tree (BST)

Lecture 190 Binary Search tree creation and insertion implementation

Lecture 191 Binary search tree searching Implementation

Lecture 192 BInary search tree deletion implementation

Section 19: INTERVIEW QUESTIONS: Trees and Graphs (Includes Apple Questions)

Lecture 193 Explanation – Symmetric Trees – Easy #101

Lecture 194 Code – Symmetric Trees – Easy #101

Lecture 195 Explanation – Maximum Depth of Binary Tree – Easy #104

Lecture 196 Code – Maximum Depth of Binary Tree – Easy #104

Lecture 197 Explanation – Path Sum – Easy #112

Lecture 198 Code – Path Sum – Easy #112

Lecture 199 Explanation- Lowest Common Ancestor of a Binary Tree – Medium #236

Lecture 200 Code- Lowest Common Ancestor of a Binary Tree – Medium #236

Lecture 201 Explanation – Kth Smallest Element in a BST – Medium #230

Lecture 202 Code – Kth Smallest Element in a BST – Medium #230

Lecture 203 Explanation – Serialize and Deserialize Binary Tree – hard #297

Lecture 204 Code – Serialize and Deserialize Binary Tree – hard #297

Lecture 205 Explanation – Binary Tree Maximum Path Sum – Hard #124

Lecture 206 Code – Binary Tree Maximum Path Sum – Hard #124

Section 20: INTERVIEW QUESTIONS: Stacks and Queues (Includes Bloomberg Questions)

Lecture 207 This section previous location in the course

Lecture 208 Explanation – Min Stack – Easy #155

Lecture 209 Code – Min Stack – Easy #155

Lecture 210 Explanation – Valid Parenthesis – Easy #20

Lecture 211 Code – Valid Parenthesis – Easy #20

Lecture 212 Explanation – Binary Tree Level Order Traversal – Medium #102

Lecture 213 Code – Binary Tree Level Order Traversal – Medium #102

Lecture 214 Explanation – Binary Tree Zigzag Level Order Traversal – Medium #103

Lecture 215 Code – Binary Tree Zigzag Level Order Traversal – Medium #103

Lecture 216 Explanation – Binary Tree Postorder Traversal – Medium #145

Lecture 217 Code – Binary Tree Postorder Traversal – Medium #145

Section 21: INTERVIEW QUESTIONS: Dynamic Programming (Includes Google Questions)

Lecture 218 What is Dynamic Programming ?

Lecture 219 Explanation – House Robber – Easy #198

Lecture 220 Code – House Robber – Easy #198

Lecture 221 Explanation – Best Time to Buy and Sell Stock – Easy #121

Lecture 222 Code – Best Time to Buy and Sell Stock – Easy #121

Lecture 223 Explanation – Climbing Stairs – Easy #70

Lecture 224 Code – Climbing Stairs – Easy #70

Lecture 225 Explanation – Coin Change – Medium #322

Lecture 226 Code – Coin Change – Medium #322

Lecture 227 Explanation – Unique Paths – Medium #62

Lecture 228 Code – Unique Paths – Medium #62

Lecture 229 Explanation – Longest Palindromic Substring – Medium #5

Lecture 230 Code – Longest Palindromic Substring – Medium #5

Lecture 231 Explanation – Trapping Rain Water – Hard #42

Lecture 232 Code – Trapping Rain Water – Hard #42

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

Course Information:

Udemy | English | 25h 47m | 6.03 GB
Created by: Bit Punch

You Can See More Courses in the IT & Software >> Greetings from CourseDown.com

Scroll to Top