Complete Python With DSA Bootcamp + LEETCODE Exercises

001 - Introduction

002 - Getting Started With Google Colab

003 - Getting Started With Github Codespace

004 - Anaconda And VS Code IDE Installation

005 - Getting Started With VS Code

006 - Python Basics Syntax and Semantics

007 - Variables In Python

008 - Basic Datatypes In Python

009 - Operators In Python

010 - Conditional Statements (if,elif,else)

011 - Loops In Python

012 - List And List Comprehrension In Python

013 - Sets In Python

014 - Dictionaries In Python

015 - Tuples In Python

016 - Real World Usecases Of List

017 - Getting Started With Functions

018 - More Coding Example With Functions

019 - Python Lambda Functions

020 - Map functions In Python

021 - Filter Function In Python

022 - Introduction to Flowcharts

023 - What is a Pseudocode

024 - Framework to Solve a Problem

025 - A Guide to attempting Coding Exercises

026 - Introduction to Arrays in Python

027 - Linear Search

028 - Binary Search Algorithm

029 - Bubble Sort - Explanation and visualisation

030 - Bubble Sort - Implementation

031 - Selection Sort - Explanation and Visualisation

032 - Selection Sort Implementation

033 - Insertion Sort Discussion and Visualization

034 - Insertion Sort Implementation

035 - Import Modules And Packages In Python

036 - Standard Library Overview

037 - File Operation In Python

038 - Working With File Paths

039 - Exception Handling With Try Except And Finally Blocks

040 - Classes And Objects In Python

041 - Inheritance In OOPS

042 - Polymorphism In OOPS

043 - Encapsulation In OOPS

044 - Abstraction In OOPS

045 - Magic Methods In Python

046 - Operator Overloading In Python

047 - Custom Exception Handling

048 - List as Dynamic Array

049 - Coding Custom List - Part 1

050 - Coding Custom List - Part 2

051 - Deep Dive Into Iterators In Python

052 - Generators With Practical Implementationn And Usecases

053 - Deep Dive Into Function Copy,Closures and Decorators

054 - Flow of Function

055 - Function Calling Itself

056 - Factorial of a number with Recursion

057 - Understanding PMI for recursion

058 - Question Sum of N numbers

059 - Solution - Sum of N Natural using Recursion

060 - Question - Number of Digits

061 - Fibonacci Series - Recursion

062 - Recursive Tree - Fibonacci

063 - Head vs Tail Recursion

064 - Print 1 to N

065 - Print N to 1

066 - Recursion on ListArrays

067 - Check if Array is Sorted

068 - Sum of an Array

069 - First Index of a Element in List

070 - First Index of a Element in List

071 - Print all Index of An Element

072 - Update All Indices in the List provided in Function

073 - Update Indices in a Global List

074 - Return List of all Indices

075 - Linear Search Using Recursion

076 - Binary Search Using Recursion - Part 1

077 - Binary Search Using Recursion - Part 2

078 - Merge Sort Intro

079 - Merge Sort - Solution

080 - Quick Sort introduction

081 - Quick Sort Solution

082 - Recursion and Strings

083 - Palindrome Check With Recursion

084 - String, Substring and Subsquence

085 - Return Subsequences of a string

086 - Print Subsequences of a string

087 - Print Permutations

088 - Return Permutations of a string

089 - Keypad Words - Google Interview Problem

090 - Return all Codes (HW)

091 - Tower of Hanoi (HW)

092 - Introduction to Complexity Analysis

093 - Intro To Time Complexity

094 - Quantifying the Time Complexity

095 - Asymptotic Notation and Analysis

096 - Asymptotic - Big O notation

097 - Big Omega and Theta

098 - Middle of a List

099 - Largest in an array

100 - Bubble Sort Time Complexity

101 - Insertion Sort - Time Complexity

102 - Selection Sort Time Complexity

103 - Time Complexity - Factorial Recursion

104 - Binary Search - Time Complexity

105 - Merge Sort - Time Complexity

106 - Fibonacci Number - Time Complexity

107 - Visualising Complexities

108 - Space Complexity Introduction

109 - Finding Space Complexity of Recursive Algorithm

110 - Fibonicci of a Number - Space Complexity

111 - Merge Sort - Space Complexity

112 - Introduction To Data Structure

113 - Intro To Linked List

114 - Create Linked List

115 - Print LL

116 - Take Input of Linked List - I

117 - Take Input of Linked List II

118 - Take input of Linked List Optimized

119 - Length Of Linked List

120 - Linked List Operations

121 - Insert at Head

122 - Insert at Tail mp4

123 - (HW) Insert at Tail - Recursive

124 - Insert at Index - Iteratively

125 - (HW) Insert at Index - Recursion

126 - Delete a Node - Head

127 - Delete a Tail Node

128 - (HW) Delete Tail Recursively

129 - Delete Node at Given Index

130 - (HW) Delete a Node Recursively

131 - Delete Node by Value

132 - Delete a Node in LL

133 - Search in LL By Value

134 - (HW) Search by Index

135 - Array vs Linked List

136 - Linked List Class

137 - Middle of LL

138 - Middle of LL - 2 pointer method

139 - Merge two Sorted Linked List

140 - Reverse a LL (Recursive)

141 - Reverse LL Optimized (Recursion)

142 - Reverse Linked List (Iteration)

143 - Merge Sort Linked List

144 - Types of Linked List

145 - Introduction To Stack

146 - Stack - LIFO Principle

147 - Operations on Stack

148 - Stack Implementation using List

149 - Visualizing Stack Using List

150 - Stack using Linked List

151 - Stack Using LL - Optimized

152 - Stack Using LL Implementation

153 - Introduction To Queue

154 - Operations in Queue

155 - Queue with Inbuilt List

156 - Queue using List - Implementation

157 - Queue Using Linked list

158 - Queue Using LL (Implementation)

159 - Types Of Queue

160 - Introduction To Trees

161 - Tree Examples and Applications

162 - Terminologies in a Tree

163 - Defining a TreeNode

164 - Print Tree

165 - Print Tree Detailed

166 - Take Input (Recursively)

167 - Take Input Level Wise

168 - Count Nodes in a Tree

169 - Height of a Tree

170 - Traversal in a Tree

171 - Introduction To Binary Tree

172 - Binary Tree Node

173 - Print Binary Tree

174 - Take Input Binary Trees

175 - Take Input level Wise

176 - Diameter of Tree

177 - Diameter of Tree - Optimised

178 - IsBalanced binary Tree

179 - Traversals in Binary Tree

180 - Construct Tree from Preorder and Inorder

181 - Construct Tree from Preorder and Inorder - Solution

182 - Construct a tree from inorder and postorder

183 - Types of Binary Tree

184 - Introduction To BST

185 - BST Node and Print

186 - Search in a BST

187 - Sorted List to BST

188 - Check BST

189 - Check BST Optimized

190 - Print Elements in a range

191 - Check BST using Limits

192 - BST Class - Search

193 - BST Class - Insert Function

194 - BST Class - Delete Method

195 - BST Class - Complexity

196 - Balancing a Tree

197 - Introduction to Hashmaps

198 - Why Hashmaps

199 - Inbuilt Hashmap in Python

200 - HashmapDictionaries Questions

201 - Implementing our own hashmap - Hashing

202 - Collision Handing

203 - Open Addressing - Insert and Search

204 - Open Addressing - Delete

205 - Hashmap Implementation - Chaining (Linked List Class)

206 - Hashmap Chaining Implementation

207 - Complexity Analysis of our Implemented Hashmap

208 - Implementing Rehashing in our Hashmap

209 - Introduction to Graphs

210 - Graph Terminologies

211 - Types Of Graphs

212 - Graph Implementation - Edge List

213 - Graph using Adjacency List

214 - Graph using AdjacencyMatrix

215 - Visualising Graph

216 - Graph Traversal - DFS

217 - Graph Traversal - BFS

218 - Traversal on Disconnected Graph

219 - Number of Components Problem

220 - Has Path using BFS and DFS

221 - Introduction To Dynamic Programming

222 - Fibonacci with DP - Memoization

223 - Time Complexity - Fibonacci (Memoized)

224 - Fibonacci with DP - Tabulation

225 - Time Complexity - Tabulation Approach

226 - Minimum Steps to 1 - Question Discussion

227 - Solution - Minimum Steps to 1

228 - Count of Balance Binary Tree of height h

229 - Count of Balanced Binary Tree of Height H - Solution

230 - Min Cost Path - Question

231 - Min Cost path - Recursive Solution

232 - Min Cost Path - Memoization Approach

233 - Min Cost Path - Tabulation Approach

234 - Working With Numpy With Python

235 - Pandas Dataframe And Series

236 - Data Analysis And Manipulation

237 - Read Data From Various Data Scources

238 - Data Visualization With Matplotlib

239 - Data Visualization With Seaborn

240 - Sqlite With Python

241 - What is Process And Threads

242 - MultiThreading Practical Impelemntation

243 - Multiprocessing With Python

244 - Thread Pool Executor And Process Pool

245 - Webscraping Usecases With Multithread

246 - Factorial Usecase With Multi Processing

247 - Logging In Python

248 - Loggign With Multiple Loggers

249 - Logging Implementation With a real World Example

250 - Introduction To Flask Framework

251 - Understanding A Simple Flask Web Application

252 - Integrating HTML With Flask

253 - HTTP Verbs GET And Post

254 - Building Dynamically Url Jinja 2

255 - Put Delete And API's In Flask