Open Projects

CSE/IT SERIES

Programming & Data Structure (English) (Part 3)

Tuesday, November 03, 2026

Starting a new Lecture Notes Series on Programming & Data Structure

Youtube Lecture Playlist Credits
Channel Name: IEMDaily - Video Lecture Notes (English)

So Let Us Start to This Journey of Learning

Programming & Data Structure By Lecture Notes together!

Lecture 133: 133. Counting Binary Search Trees

Lecture 134: 134. BST Search Logic

Lecture 135: 135. Visualizing BST Logic

Lecture 136: 136. Decoding Tree Traversals

Lecture 137: 137. The Unique BST

Lecture 138: 138. BST Node Deletion

Lecture 139: 139. Visual BST Replments

Lecture 140: 140. N ary Tree Leaf Formula

Lecture 141: 141. Ternary Tree Leaf Derivation

Lecture 142: 142. Validating Binary Trees

Lecture 143: 143. AVL Geometric Harmony

Lecture 144: 144. AVL Tree Balance

Lecture 145: 145. AVL Rotation Mechanics

Lecture 146: 146. AVL Tree Node Limits

Lecture 147: 147. The Binary Tree Plus One Rule

Lecture 148: 148. Binary Tree Anatomy

Lecture 149: 149. Minimal Constrained Binary Tree Nodes

Lecture 150: 150. Minimal Size Balanced Trees

Lecture 151: 151. BST Range Sum Analysis

Lecture 152: 152. The Botanical Code

Lecture 153: 153. Maximizing Expression Trees

Lecture 154: 154. Tree Architectures

Lecture 155: 155. Binary Tree Syntax Decoded

Lecture 156: 156. Deducing the BST Root

Lecture 157: 157. Mapping Array Trees

Lecture 158: 158. The Parent Index Mystery

Lecture 159: 159. The LCRS Tree Mystery

Lecture 160: 160. The Architecture of Connection

Lecture 161: 161. Graph Data Structures

Lecture 162: 162. Graph Search Mechanics

Lecture 163: 163. BFS Matrix Complexity

Lecture 164: 164. Beyond Graph Search

Lecture 165: 165. DFS Visualized

Lecture 166: 166. Graph Algorithm Anatomy

Lecture 167: 167. Decoding Graph Traversal

Lecture 168: 168. DFS Decoded

Lecture 169: 169. Decoding DFS Depth

Lecture 170: 170. Hidden Graphs Explained | Graph Representation and Algorithm Analysis

Lecture 171: 171. The Quest for Constant Time

Lecture 172: 172. Mastering Hashing

Lecture 173: 173. Chaining Visualized

Lecture 174: 174. Hash Chaining Architecture

Lecture 175: 175. Hashing and Probability

Lecture 176: 176. Collision Probability

Lecture 177: 177. Open Addressing Visualized

Lecture 178: 178. Linear Probing Visualized

Lecture 179: 179. Linear Probing Visualized

Lecture 180: 180. Linear Probing Visualized

Lecture 181: 181. Visualizing Hashing Collisions

Lecture 182: 182. Decoding Hash Table Permutations

Lecture 183: 183. The Quadratic Leap

Lecture 184: 184. Double Hashing Architecture

Lecture 185: 185. Disjoint Set Essentials

Lecture 186: 186. Visualizing Disjoint Sets

Lecture 187: 187. Linked List Disjoint Sets

Lecture 188: 188. Linked List Disjoint Sets

Lecture 189: 189. Amortized Disjoint Analysis

Lecture 190: 190 Visualizing Disjoint Set Forests

Lecture 191: 191. Union by Size

Lecture 192: 192. Visualizing Union by Rank

Lecture 193: 193. Optimizing Disjoint Sets

Lecture 194: 194. Disjoint Set Complexity Simplified

Lecture 195: 195. Kruskal s Algorithm Visualized

Lecture 196: 196. Visualizing Kruskal s Algorithm

Lecture 197: 197. Graph Connectivity with Disjoint Sets

Lecture 198: 198. Visualizing Disjoint Sets

CSE/IT SERIES

Programming & Data Structure (English) (Part 2)

Tuesday, November 03, 2026

Starting a new Lecture Notes Series on Programming & Data Structure

Youtube Lecture Playlist Credits
Channel Name: IEMDaily - Video Lecture Notes (English)

So Let Us Start to This Journey of Learning

Programming & Data Structure By Lecture Notes together!

Lecture 67: 67. Inside atoi

Lecture 68: 68. The Missing Zero

Lecture 69: 69. The Preprocessor Sneak Attack

Lecture 70: 70. C Loop Logic Decoded

Lecture 71: 71. The Illusion of Memory

Lecture 72: 72. Two-Pointer Technique Visualized | Array Manipulation and Memory Explained

Lecture 73: 73. Storage Class Arcitecture

Lecture 74: 74. Static Variable Persistence

Lecture 75: 75. Static Recursion Visualized

Lecture 76: 76. C Memory Architecture

Lecture 77: 77. C Dynamic Memory Management

Lecture 78: 78. C Structure Architecture

Lecture 79: 79. Visualizing C Pointers

Lecture 80: 80. Self Referential Structures

Lecture 81: 81. Dynamic Memory Mastery

Lecture 82: 82. Printf Deconstructed

Lecture 83: 83. Mastering C Input

Lecture 84: 84. The Bitwise Scanner

Lecture 85: 85. C File Handling

Lecture 86: 86. C File Navigation

Lecture 87: 87. Fluid String IO

Lecture 88: 88. C Data Streams

Lecture 89: 89. The Journey of a Byte

Lecture 90: 90. Dynamic C Memory

Lecture 91: 91. C Line Counting

Lecture 92: 92. Visualizing C File I O

Lecture 93: 93. Tracing Recursion Step by Step | Recursion Tree and Call Stack Explained

Lecture 94: 94. Visualizing Link List

Lecture 95: 95. Linked List Traversal

Lecture 96: 96. Visual Node Insertion

Lecture 97: 97. Linked List Deletion

Lecture 98: 98. SLL Pairwise Reordering

Lecture 99: 99. Tail to Head

Lecture 100: 100. Unwinding Recursion

Lecture 101: 101. Iterative List Reversal

Lecture 102: 102. Recursive List Reversal

Lecture 103: 103. Linked List Hacks

Lecture 104: 104. Circular Sentinel Architecture

Lecture 105: 105. Recursive Logic Decoded

Lecture 106: 106. Doubly Linked List Mastery

Lecture 107: 107. Understanding Stacks

Lecture 108: 108. Array Stack Mechanics

Lecture 109: 109. Dynamic Linked Stacks

Lecture 110: 110. Decoding Circular Queues

Lecture 111: 111. Single Pointer Circular Queues

Lecture 112: 112. Stack Permutation

Lecture 113: 113. Priority Queues Stacks

Lecture 114: 114. Average Stack Lifetime

Lecture 115: 115. Two Stack Queues

Lecture 116: 116. Stack Queue Logic

Lecture 117: 117. Infix to Postfix

Lecture 118: 118. Postfix Engine

Lecture 119: 119. Binary Tree Traversals

Lecture 120: 120. Visualizing Trersals

Lecture 121: 121. The Recursion Checklist

Lecture 122: 122. Triple Order Traversal

Lecture 123: 123. Indirect Tree Recurtion

Lecture 124: 124. Binary Tree Combinatorics

Lecture 125: 125. Decoding Tree Uniqueness

Lecture 126: 126. Binary Tree Recx Reconstruction

Lecture 127: 127. Recursive Node Counting

Lecture 128: 128. Visualizing Tree Recursion

Lecture 129: 129. The Full Node Algorithm

Lecture 130: 130. Visualizing Tree_Height

Lecture 131: 131. Binary Search Tree_Logic

Lecture 132: 132. Decoding the Binary_Search_Tree

CSE/IT SERIES

Programming & Data Structure (English) (Part 1)

Monday, November 02, 2026

Starting a new Lecture Notes Series on Programming & Data Structure

Youtube Lecture Playlist Credits
Channel Name: IEMDaily - Video Lecture Notes (English)

So Let Us Start to This Journey of Learning

Programming & Data Structure By Lecture Notes together!

Lecture 1: 01. Beginning C

Lecture 2: 02. C Compiler Explained | How C Code Is Translated and Executed

Lecture 3: 03. Visualizing Form

Lecture 4: 04. C Character IO

Lecture 5: 05. C Operator Hierarchy

Lecture 6: 06. C Data Architecture

Lecture 7: 07. Enums for Humans

Lecture 8: 08. Type Fluidity

Lecture 9: 09. Compiler Constans

Lecture 10: 10. C String Mechanics

Lecture 11: 11. Assignment Shorthand

Lecture 12: 12. Visual Bitwise

Lecture 13: 13. Ternary Operator in C Explained | Conditional Expressions Made Simple

Lecture 14: 14. The Increment Dilemma

Lecture 15: 15. C Operator Spect

Lecture 16: 16. C Code Deconstrurm

Lecture 17: 17. Mastering Memory Geometry

Lecture 18: 18. The Logic of Choice

Lecture 19: 19. Mastering Control Flow

Lecture 20: 20. C If-Else Statements Explained | Conditional Logic in C Programming

Lecture 21: 21. Even or Odd in C

Lecture 22: 22. Optimizing Control Flow

Lecture 23: 23. Mastering C Switch Statements

Lecture 24: 24. Mastering the Switch

Lecture 25: 25. Visual C Calculator

Lecture 26: 26. C While Loop

Lecture 27: 27 Action Before Condition

Lecture 28: 28. The For Loop

Lecture 29: 29. Summing Natural Numbers in C

Lecture 30: 30. C do while Mastery

Lecture 31: 31. Mastering C Loop Flow

Lecture 32: 32. C Break Mastery

Lecture 33: 33. Prime Numbers in C Programming | Check Whether a Number Is Prime

Lecture 34: 34. Scaling Factorial Logic

Lecture 35: 35. Mastering C Nested Loops

Lecture 36: 36. Counting Digits in C

Lecture 37: 37. Armstrong Number Geometry

Lecture 38: 38. C Star Pyramid Logic

Lecture 39: 39. Visualizing C Palindromes

Lecture 40: 40. C Fibonacci Engine

Lecture 41: 41. Modular Functions in C Programming | Writing Reusable and Structured Code

Lecture 42: 42. Visualizing Pointer Swap

Lecture 43: 43. The C Power Engine

Lecture 44: 44. Visualizing Pointers

Lecture 45: 45. Visualizing C Pointers

Lecture 46: 46. Visualizing C Pointers

Lecture 47: 47. The Pointer Swap

Lecture 48: 48. Memory Doppelgängers

Lecture 49: 49. Spatial Pointer Mechanics

Lecture 50: 50. C Memory Mechanics

Lecture 51: 51. GATE 2008 Stringalized

Lecture 52: 52. Mastering C Poinerytax

Lecture 53: 53. The Pointer Labyrinth

Lecture 54: 54. Function Pointers in C Explained | Syntax, Working and Practical Examples

Lecture 55: 55. C Syntax Decoded

Lecture 56: 56. Visualizing Array Memory

Lecture 57: 57. Matrix Memory Mapping

Lecture 58: 58. Binary Array Architecture

Lecture 59: 59. Visual Array Mapping

Lecture 60: 60. Matrix Storage Optimization

Lecture 61: 61. Visualizing C String

Lecture 62: 62. Mastering strcpy

Lecture 63: 63. Visualizing strcT

Lecture 64: 64. Inside strcmp() in C C | String Comparison Explained

Lecture 65: 65. Two Pointer String

Lecture 66: 66. Integer to String

CSE/IT SERIES

Algorithms (English) (Part 3)

Monday, September 28, 2026

Starting a new Lecture Notes Series on Algorithms

Youtube Lecture Playlist Credits
Channel Name: IEMDaily - Video Lecture Notes (English)

So Let Us Start to This Journey of Learning

Algorithms By Lecture Notes together!

Lecture 85: 85. GATE 2009 DP Visualized

Lecture 86: 86. Multi Stage Graph Optimization

Lecture 87: 87. Dynamic Programming Essentials

Lecture 88: 88. Visual Bottom Up DP

Lecture 89: 89. The Knapsack Dilemma

Lecture 90: 90. The Greedy Trap

Lecture 91: 91. Knapsack Substructure

Lecture 92: 92. Optimizing the Knapsack

Lecture 93: 93. Bottom Up Knapsack

Lecture 94: 94. Visualizing Knapsack DP

Lecture 95: 95. Solving Subset Sum

Lecture 96: 96. Mapping Subset Sum

Lecture 97: 97. Solving the Traveling Salesman

Lecture 98: 98. Solving the Salesman

Lecture 99: 99. Solving TSP with Dynamic Programming

Lecture 100: 100. Scaling Shortest Paths

Lecture 101: 101. All Pairs Shortest Paths

Lecture 102: 102. Floyd-Warshall Algorithm Visualized | All-Pairs Shortest Path Explained

Lecture 103: 103. DP Matrix Complexity Explained | Time & Space Complexity of Dynamic Programming

Lecture 104: 104. Floyd-Warshall Algorithm Visualized | All-Pairs Shortest Path Explained

Lecture 105: 105. The Limits of Computation Explained What Can Computers Actually Solve

Lecture 106: 106. Algorithmic Boundaries Explained | Understanding the Limits of Algorithms

Lecture 107: 107. When Simple Code Hides Complex Time!

Lecture 108: 108. Optimization to Decision Explained | How Algorithms Choose the Best Solution

Lecture 109: 109. The Logical Mirror: Complement Problems Explained

Lecture 110: 110. How Computers Verify Solutions: Verification Algorithms Explained

Lecture 111: 111. The $1M Computer Mystery: P vs NP Explained

Lecture 112: 112. Polynomial Time Reduction

Lecture 113: 113. Mapping Complexity

Lecture 114: 114. NP Completeness Decoded

Lecture 115: 115. The Direction of Reduction

Lecture 116: 116. Deceptive Complexity

Lecture 117: 117. Complexity Deconstructed

Lecture 118: 118. Decoding NP Logic

Lecture 119: 119. Complexity Truths

Lecture 120: 120. Identifying the NP Hard Outlier

Lecture 121: 121. SH3 NP Completeness

Lecture 122: 122. The NPC Subset

Lecture 123: 122. The NPC Subset

Lecture 124: 124. Decoding NP Logic

Lecture 125: 125. NP Closure

CSE/IT SERIES

Algorithms (English) (Part 2)

Wednesday, September 23, 2026

Starting a new Lecture Notes Series on Algorithms

Youtube Lecture Playlist Credits
Channel Name: IEMDaily - Video Lecture Notes (English)

So Let Us Start to This Journey of Learning

Algorithms By Lecture Notes together!

Lecture 43: 43. Efficient Union by Size

Lecture 44: 44. Logarithmic Gravity

Lecture 45: 45. The Gravitational Root

Lecture 46: 46. Effectively Constant

Lecture 47: 47. Kruskal’s Algorithm

Lecture 48: 48. Disjoint Set Cycle Detection

Lecture 49: 49. Visualizing Disjoint Sets

Lecture 50: 50. Algorithmic Optimization Paradigms

Lecture 51: 51. Optimal Huffman Compression

Lecture 52: 52. Decoding Huffman

Lecture 53: 53. Optimal Job Sequencing

Lecture 54: 54. Optimal Merge Patterns

Lecture 55: 55. The Network Skeleton

Lecture 56: 56. Visualizing Prim s Algorithm

Lecture 57: 57. Visual Prim s Algorithm

Lecture 58: 58. Optimizing Prim s Algorithm

Lecture 59: 59. Mastering Kruskal s Algorithm

Lecture 60: 60. Dijkstra Visualized

Lecture 61: 61. Decoding Dijkstra

Lecture 62: 62. Dijkstra s Complexity Unlocked

Lecture 63: 63. Dijkstra s Negative Blind Spot

Lecture 64: 64. Dijkstra Unlocked

Lecture 65: 65. Visualizing Bellman Ford

Lecture 66: 66. Bellman Ford Visualized

Lecture 67: 67. Bellman Ford

Lecture 68: 68. The DAG Cheat Code

Lecture 69: 69. Algorithmic Memory

Lecture 70: 70. Matrix Multiplication Costs

Lecture 71: 71. Matrix Chain Optimization

Lecture 72: 72. Matrix Chain Optimization

Lecture 73: 73. Matrix Chain Optimization

Lecture 74: 74. Optimizing Matrix Chains

Lecture 75: 75. Matrix Chain Optimization

Lecture 76: 76. Mastering Memoization

Lecture 77: 77. Optimal Matrix Chain Multiplication

Lecture 78: 78. Longest Common Subsequence

Lecture 79: 79. Visualizing LCS

Lecture 80: 80. LCS Optimization

Lecture 81: 81. Algorithmic Elegance

Lecture 82: 82. LCS Visualized

Lecture 83: 83. LCS Visual Decoder

Lecture 84: 84. Dynamic Programming Visualized

CSE/IT SERIES

Algorithms (English) (Part 1)

Tuesday, September 22, 2026

Starting a new Lecture Notes Series on Algorithms

Youtube Lecture Playlist Credits
Channel Name: IEMDaily - Video Lecture Notes (English)

So Let Us Start to This Journey of Learning

Algorithms By Lecture Notes together!

Lecture 1: 01. Visualizing Algorithmic Bounds

Lecture 2: 02. Geometries of Scale

Lecture 3: 03. Decoding Recursive Complexity

Lecture 4: 04. Mastering Asymptotic Growth

Lecture 5: 05. Mastering Recurrences

Lecture 6: 06. Memory Architecture

Lecture 7: 07. Amortized Analysis

Lecture 8: 08. Aggregate Analysis

Lecture 9: 09. Amortizing Expansion

Lecture 10: 10. Insertion Sort Mechanics

Lecture 11: 11. Merge Sort Deconstructed

Lecture 12: 12. Quick Sort Deconstructed

Lecture 13: 13. The Quick Sort Paradox

Lecture 14: 14. The Heap

Lecture 15: 15. Max Heap Mastery

Lecture 16: 16. Linear Max Heap Construction

Lecture 17: 17. Max Heap Mechanics

Lecture 18: 18. Visualizing Heap Sort

Lecture 19: 19. Advanced Heap Architecture

Lecture 20: 20. Deconstructing Radix Sort

Lecture 21: 21. Optimized Bubble Sort

Lecture 22: 22. Bucket Sort

Lecture 23: 23. Visual Counting Sort

Lecture 24: 24. Fluid Bubble Sort

Lecture 25: 25. Sorting Complexity Analysis

Lecture 26: 26. Max Heap Visualized

Lecture 27: 27. Max Heap Insertion Visualized

Lecture 28: 28. Max Heap Interchanges

Lecture 29: 29. Max Heap Visualized

Lecture 30: 30. Max Heapify Deconstructed

Lecture 31: 31. Visualizing Radix Sort

Lecture 32: 32. Bubble Sort Geometry

Lecture 33: 33. Binary Search Logic

Lecture 34: 34. Linear Search

Lecture 35: 35. Amortized Disjoint Set Analysis

Lecture 36: 36. Union by Rank Visualized

Lecture 37: 37. Amortized Growth Analysis

Lecture 38: 38. Disjoint Sets

Lecture 39: 39. Disjoint Set Linked Lists

Lecture 40: 40. Linked List Disjoint Sets

Lecture 41: 41. Disjoint Set Amortization

Lecture 42: 41. Disjoint Set Amortization

CSE/IT SERIES

Python for Beginners (Full Course) | #100DaysOfCode Programming Tutorial in Hindi (Part 2)

Saturday, September 12, 2026

Starting a new Lecture Notes Series on Python for Beginners (Full Course) | #100DaysOfCode Programming Tutorial in Hindi

Youtube Lecture Playlist Credits
Channel Name: CodeWithHarry

So Let Us Start to This Journey of Learning

Indian Polity for All Competitive Exams By Lecture Notes together!

Lecture 52: Lambda functions in Python | Python Tutorial - Day #52

Lecture 53: Map, Filter and Reduce in Python | Python Tutorial - Day #53

Lecture 54: 'is' vs '==' in Python | Python Tutorial - Day #54

Lecture 55: Exercise 5 - Snake Water Gun | Python Tutorial - Day #55

Lecture 56: Introduction to OOPs in Python | Python Tutorial - Day #56

Lecture 57: Classes and Objects in Python | Python Tutorial - Day #57

Lecture 58: Constructors in Python | Python Tutorial - Day #58

Lecture 59: Decorators in Python | Python Tutorial - Day #59

Lecture 60: Getters and Setters in Python | Python Tutorial - Day #60

Lecture 61: Inheritance in Python | Python Tutorial - Day #61

Lecture 62: Access Modifiers in Python | Python Tutorial - Day #62

Lecture 63: Snake Water Gun Game in Python - Exercise 5 - Solution | Python Tutorial - Day #63

Lecture 64: Exercise 6 - Library Management System in Python | Python Tutorial - Day #64

Lecture 65: Static Methods in Python | Python Tutorial - Day #65

Lecture 66: Instance variables vs Class variables in Python | Python Tutorial - Day #66

Lecture 67: Exercise 6 Solution - Library Management Software in Python | Python Tutorial - Day #67

Lecture 68: Exercise 7 - Clear the Clutter | Python Tutorial - Day #68

Lecture 69: Class Methods in Python | Python Tutorial - Day #69

Lecture 70: Class Methods as Alternative Constructors in Python | Python Tutorial - Day #70

Lecture 71: dir, __dict__ and help method in Python | Python Tutorial - Day #71

Lecture 72: super keyword in Python | Python Tutorial - Day #72

Lecture 73: Magic/Dunder Methods in Python | Python Tutorial - Day #73

Lecture 74: Method Overriding in Python | Python Tutorial - Day #74

Lecture 75: Exercise 7 Solution + Shoutouts | Python Tutorial - Day #75

Lecture 76: Exercise 8 - Merge the PDF | Python Tutorial - Day #76

Lecture 77: Operator Overloading in Python | Python Tutorial - Day #77

Lecture 78: Single Inheritance in Python | Python Tutorial - Day #78

Lecture 79: Multiple Inheritance in Python | Python Tutorial - Day #79

Lecture 80: Multilevel Inheritance in Python | Python Tutorial - Day #80

Lecture 81: Hybrid and Hierarchical Inheritance in Python | Python Tutorial - Day #81

Lecture 82: Exercise 8 - Merge the Pdf Solution in Python | Python Tutorial - Day #82

Lecture 83: Exercise 9 - Shoutouts to Everyone | Python Tutorial - Day #83

Lecture 84: Time Module in Python | Python Tutorial - Day #84

Lecture 85: Creating command line utility in python | Python Tutorial - Day #85

Lecture 86: Walrus Operator in Python | Python Tutorial - Day #86

Lecture 87: Shutil Module in Python | Python Tutorial - Day #87

Lecture 88: Exercise 9: Solution - Shoutouts to Everyone | Python Tutorial - Day #88

Lecture 89: Requests Module in Python | Python Tutorial - Day #89

Lecture 90: Exercise 10: News App in Python | Python Tutorial - Day #90

Lecture 91: Generators in Python | Python Tutorial - Day #91

Lecture 92: Function Caching in Python | Python Tutorial - Day #92

Lecture 93: Exercise 10 - News App Solution & Shoutout | Python Tutorial - Day #93

Lecture 94: Exercise 11 - Drink Water Reminder | Python Tutorial - Day #94

Lecture 95: Regular Expressions in Python | Python Tutorial - Day #95

Lecture 96: AsyncIO in Python | Python Tutorial - Day #96

Lecture 97: Multithreading in Python | Python Tutorial - Day #97

Lecture 98: MultiProcessing in Python | Python Tutorial - Day #98

Lecture 99: Exercise 11: Solution + Shoutouts - Desktop Notification System | Python Tutorial - Day #99

Lecture 100: Conclusion and Where to go from here | Python Tutorial - Day #100

CSE/IT SERIES

Python for Beginners (Full Course) | #100DaysOfCode Programming Tutorial in Hindi (Part 1)

Monday, September 07, 2026

Starting a new Lecture Notes Series on Python for Beginners (Full Course) | #100DaysOfCode Programming Tutorial in Hindi

Youtube Lecture Playlist Credits
Channel Name: CodeWithHarry

So Let Us Start to This Journey of Learning

Indian Polity for All Competitive Exams By Lecture Notes together!

Lecture 1: Introduction to Programming & Python | Python Tutorial - Day #1

Lecture 2: Some Amazing Python Programs - The Power of Python | Python Tutorial - Day #2

Lecture 3: Modules and Pip | Python Tutorial - Day #3

Lecture 4: Our First Python Program | Python Tutorial - Day #4

Lecture 5: Comments, Escape Sequences & Print Statement | Python Tutorial - Day #5

Lecture 6: Variables and Data Types | Python Tutorial - Day #6

Lecture 7: Exercise 1: Calculator using Python | Python Tutorial - Day #7

Lecture 8: Exercise 1: Calculator using Python (Solution) | Python Tutorial - Day #8

Lecture 9: Typecasting in Python | Python Tutorial - Day #9

Lecture 10: Taking User Input in Python | Python Tutorial - Day #10

Lecture 11: Strings in Python | Python Tutorial - Day #11

Lecture 12: Strings Slicing and Operations on Strings in Python | Python Tutorial - Day #12

Lecture 13: String Methods in Python | Python Tutorial - Day #13

Lecture 14: If Else Conditional Statements in Python | Python Tutorial - Day #14

Lecture 15: Exercise 2: Good Morning Sir | Python Tutorial - Day #15

Lecture 16: Match Case Statements in Python | Python Tutorial - Day #16

Lecture 17: For Loops in Python | Python Tutorial - Day #17

Lecture 18: While Loops in Python | Python Tutorial - Day #18

Lecture 19: break and continue in Python | Python Tutorial - Day #19

Lecture 20: Functions in Python | Python Tutorial - Day #20

Lecture 21: Function Arguments in Python | Python Tutorial - Day #21

Lecture 22: Introduction to Lists in Python | Python Tutorial - Day #22

Lecture 23: List Methods in Python | Python Tutorial - Day #23

Lecture 24: Tuples in Python | Python Tutorial - Day #24

Lecture 25: Operations on Tuples in Python | Python Tutorial - Day #25

Lecture 26: Exercise 2: Solution & Shoutouts | Python Tutorial - Day #26

Lecture 27: Exercise 3: Kaun Banega Crorepati (KBC) | Python Tutorial - Day #27

Lecture 28: f-strings in Python | Python Tutorial - Day #28

Lecture 29: Docstrings in Python | Python Tutorial - Day #29

Lecture 30: Recursion in Python | Python Tutorial - Day #30

Lecture 31: Sets in Python | Python Tutorial - Day #31

Lecture 32: Set Methods in Python | Python Tutorial - Day #32

Lecture 33: Dictionaries in Python | Python Tutorial - Day #33

Lecture 34: Dictionary Methods in Python | Python Tutorial - Day #34

Lecture 35: for Loop with else in Python | Python Tutorial - Day #35

Lecture 36: Exception Handling in Python | Python Tutorial - Day #36

Lecture 37: Finally keyword in Python | Python Tutorial - Day #37

Lecture 38: Raising custom errors in Python | Python Tutorial - Day #38

Lecture 39: Kaun Banega Crorepati: Exercise 3 - Solution & Shoutouts | Python Tutorial - Day #39

Lecture 40: Exercise 4: Secret Code Language | Python Tutorial - Day #40

Lecture 41: Short hand if else statements | Python Tutorial - Day #41

Lecture 42: Enumerate Function in Python | Python Tutorial - Day #42

Lecture 43: Virtual Environment in Python | Python Tutorial - Day #43

Lecture 44: How import works in Python | Python Tutorial - Day #44

Lecture 45: if __name__ == "__main__" in Python | Python Tutorial - Day #45

Lecture 46: os Module in Python | Python Tutorial - Day #46

Lecture 47: Exercise 4: Solutions and Shoutouts | Python Tutorial - Day #47

Lecture 48: Local vs Global Variables in Python| Python Tutorial - Day #48

Lecture 49: File IO in Python | Python Tutorial - Day #49

Lecture 50: read(), readlines() and other methods | Python Tutorial - Day #50

Lecture 51: seek(), tell() and other functions | Python Tutorial - Day #51