Python Variable Storage in Memory Explained

🐍 Day 2 of Learning Python Continuing my Python learning journey and today’s focus was on understanding how Python actually executes code behind the scenes, along with practicing some fundamental concepts. 🔎 What I explored today: ⚙️ How Python Executes Code I learned that Python does not directly run the code we write. Instead, the Python interpreter first converts the source code into Bytecode, which is then executed by the Python Virtual Machine (PVM). Understanding this process helped me see how Python translates human-readable instructions into something a computer can execute. 🧠 Variables in Python After that, I practiced working with variables, which are used to store data in memory. Python makes this simple since we don’t need to explicitly declare the data type — the interpreter handles it dynamically. 💻 Taking User Input To practice further, I wrote a small program where the user enters their name and age, and the program prints a formatted message. Example concept used: input() for user input. int() to convert age into an integer. f-strings for clean and readable output formatting. This small exercise helped me understand data types, variable assignment, and interaction with users through the terminal. Every day I’m trying to strengthen the fundamentals because strong basics make advanced topics like automation, AI, and machine learning easier to approach later. Looking forward to exploring more Python concepts tomorrow. 🚀 #Python #PythonProgramming #LearningPython #CodingJourney #100DaysOfCode #SoftwareDevelopment #ProgrammingBasics #TechLearning #Developers #FutureEngineer #LearnInPublic #PythonBeginner #SDE

Day 20 of My Python Learning Journey Today I learned about Shallow Copy and Deep Copy in Python. 📌 Shallow Copy A shallow copy creates a new object, but the nested objects inside it are still referenced from the original object. So, changes in nested elements will affect both copies. Example: import copy list1 = [[1,2,3],[4,5,6]] shallow = copy.copy(list1) shallow[0][0] = 100 print(list1) print(shallow) 📌 Deep Copy A deep copy creates a completely independent copy of the original object including all nested objects. Changes in one object will not affect the other. Example: import copy list1 = [[1,2,3],[4,5,6]] deep = copy.deepcopy(list1) deep[0][0] = 100 print(list1) print(deep) ✅ Key Difference Shallow Copy → Copies only the outer object Deep Copy → Copies outer object + all nested objects Learning these concepts helps in understanding memory handling and object references in Python #Python #PythonLearning #Day20 #CodingJourney #Programming #LearningEveryday

I’ve just published my first blog post on Medium, diving into a Python concept I recently explored: 👉 Mutable vs Immutable Objects Before this, I used to think variables simply “store values.” But in Python, they actually reference objects in memory. Having learned C previously really helped me grasp this concept more quickly, especially when it comes to understanding how memory and references work. In this post, I break down: • The difference between == and is • Mutable vs immutable objects (with clear examples) • Why l1 = l1 + [4] and l1 += [4] behave differently • How Python passes arguments to functions Writing about what I learn pushes me to go deeper and truly understand the concepts. If you’re learning Python or preparing for technical interviews, this is definitely a topic worth mastering. 📖 Read here: https://lnkd.in/guVnYN3Q #Python #SoftwareEngineering #Programming #LearningJourney #Tech

🚀 **DSA with Python – Recursion Practice** Continuing my **Data Structures & Algorithms with Python** journey, today I practiced more **recursion-based problems** to strengthen my understanding of how recursive calls break problems into smaller subproblems. 📚 **Problems I Practiced** 🔹 **Count Number of Digits (Recursion)** Logic: Repeatedly divide the number by 10 until it reaches 0. Each recursive call counts one digit. 🔹 **Sum of Digits of a Number** Example: 5251 → 5 + 2 + 5 + 1 = 13 Using recursion: `sum(n) = (n % 10) + sum(n // 10)` 🔹 **Reverse a String using Recursion** Example: `"abcd"` → `"dcba"` Recursively reduce the string and build the reversed result step by step. 🔹 Palindrome Check using Recursion Compared characters from the start and end of the string recursively until the middle is reached. Works for both odd and even length strings. 🔹 Reverse a String using Recursion Example: "abcd" → "dcba" Recursively append characters from the end to build the reversed string. 🔹 Sum of All Elements in an Array using Recursion Logic: sum(arr, i) = arr[i] + sum(arr, i+1) Continue until the index reaches the length of the array. 💡 **Key Learnings** ✔ Importance of **base conditions** in recursion ✔ How recursive calls create a **call stack** ✔ Breaking complex problems into **smaller subproblems** ✔ Strengthening **algorithmic thinking** Step by step building stronger foundations in **DSA and problem solving**. #DSA #Python #Recursion #Algorithms #DataStructures #CodingPractice #ProblemSolving #CodingInterview #PythonDeveloper #SoftwareEngineering #BackendDevelopment #LearnInPublic #DeveloperJourney #ContinuousLearning #Programming #TechLearning #100DaysOfCode #CodingJourney

Entering Python Data Structures 🚀 Small update in my Python learning journey. After finishing the fundamentals, I’ve now started working with Python data structures. So far I’ve begun exploring: 📦 Lists 🧺 Tuples 🎯 Sets 🗂 Dictionaries What’s interesting is how these structures solve different problems. For example: 📦 Lists are great when order matters 🧺 Tuples are useful when data shouldn’t change 🎯 Sets remove duplicates automatically 🗂 Dictionaries let you map keys to values Right now I’m doing the same thing that helped me with the basics: generating practice exercises with AI. Each set of exercises forces me to write small functions and still include type hints, which helps reinforce both concepts at the same time. It’s amazing how much clearer things become once you start solving small problems instead of just reading explanations. 💬 For those further along in Python: Which data structure do you end up using the most in real projects? P.S. Repost if you find this useful or helpful for other Tags #Python #PythonProgramming #PythonDeveloper #PythonBeginner #CodingJourney #Programming #TechCareers #BeginnersMindset #Consistency #SelfTaught #CareerGrowth #Upskilling

Day 21 – List Methods in Python Lists are one of the most commonly used data structures in Python. Python provides built-in methods to easily modify and manage lists. 1. append() Adds an element to the end of the list. numbers = [10, 20, 30] numbers.append(40) print(numbers) Output : [10, 20, 30, 40] 2. insert() Adds an element at a specific position. numbers = [10, 20, 30] numbers.insert(1, 15) print(numbers) Output : [10, 15, 20, 30] 3. remove() Removes a specific value from the list. numbers = [10, 20, 30, 40] numbers.remove(20) print(numbers) Output : [10, 30, 40] 4. pop() Removes an element by index and returns it. numbers = [10, 20, 30] numbers.pop() print(numbers) Output : [10, 20] 5. sort() Sorts the list in ascending order. numbers = [30, 10, 20] numbers.sort() print(numbers) Output : [10, 20, 30] 6. reverse() Reverses the order of elements. numbers = [1, 2, 3, 4] numbers.reverse() print(numbers) Output: [4, 3, 2, 1] 7. count() Counts how many times an element appears. numbers = [1, 2, 2, 3, 2] print(numbers.count(2)) Output:3 8. index() Finds the position of an element. numbers = [10, 20, 30] print(numbers.index(20)) Output:1 #Python #Programming #LearnPython #CodingJourney

🔹 Python Tip: sort() vs sorted() When working with lists in Python, we often need to sort data. There are two common ways to do this: list.sort() and sorted(). Let’s look at a simple example: lst1 = [20, 10, 50, 30, 40] Suppose we want to sort the elements in ascending order. 1️⃣ Using list.sort() lst1 = [20, 10, 50, 30, 40] lst1.sort() print(lst1) ➡️ Output: [10, 20, 30, 40, 50] Here, sort() modifies the original list directly. This is called in-place sorting, meaning the existing list itself gets reordered. 2️⃣ Using sorted() lst1 = [20, 10, 50, 30, 40] new_list = sorted(lst1) print(new_list) ➡️ Output: [10, 20, 30, 40, 50] The key difference is that sorted() does not change the original list. Instead, it returns a new sorted list, so we store it in another variable. So now we have: new_list = [10, 20, 30, 40, 50] lst1 = [20, 10, 50, 30, 40] 🔹 Summary • Use sort() when you want to modify the list itself and don’t need the original order. • Use sorted() when you want to keep the original data unchanged and create a new sorted sequence. • Another advantage of sorted() is that it works with other iterable types such as tuples, strings, and sets. #Python #Programming #Coding #DataScience #LearnPython

Consider the following code in Python: def add_item(lst): lst.append(100) a = [1, 2, 3] add_item(a) print(a) What happens here? The correct explanation is: ✅ An in-place modification occurs on the list. Lists in Python are mutable objects, which means they can be modified after they are created. Let’s break it down step by step. 1️⃣ Creating the list When we write: a = [1, 2, 3] Python creates a list object in memory, and the variable a references it: a → [1, 2, 3] 2️⃣ Calling the function When the function is called: add_item(a) The parameter lst inside the function now references the same list object: a → [1, 2, 3] lst → ↑ (same list) ➡️ Both variables point to the same object in memory. 3️⃣ Inside the function Inside the function we execute: lst.append(100) The append() method modifies the list itself. This is called in-place modification, meaning the original list object is updated instead of creating a new one. The list now becomes: [1, 2, 3, 100] 4️⃣ Printing the result Since both a and lst reference the same list, the change is visible through a. Now when we execute: print(a) Output: [1, 2, 3, 100] 📌 Final thought Understanding how variables reference objects in memory is essential when working with mutable data types like lists in Python. #Python #PythonProgramming #Coding #LearnPython #SoftwareDevelopment

Quick Python Challenge What will be the output of this code? a = [1, 2] b = a b.append(3) print(len(a)) Options: A) 2 B) 3 C) 1 D) Error 💡 At first glance, many people think the answer is 2. But the correct answer is actually 3. Why? Because in Python: b = a does not create a new list. It simply makes b reference the same object in memory as a. So when we run: b.append(3) we are modifying the same list that both a and b point to. The list becomes: [1, 2, 3] So: len(a) = 3 📌 Key Insight: In Python, variables can reference the same mutable object, which means modifying one reference affects the other. 🔥 Lesson of the day: Understanding mutable objects and references is essential when writing reliable Python code—especially in data analysis and AI pipelines. 💬 Curious: Did you get it right on the first try? #Python #AI #DataAnalytics #LearningInPublic #30DayChallenge #PythonTips

🚀 Day 16/30 – Python OOPs Challenge 💡 Operator Overloading in Python We learned that polymorphism means: 👉 Same name 👉 Different behaviour Today we’ll see how Python allows operators to behave differently. This is called Operator Overloading. 🔹 What is Operator Overloading? In Python: - + adds numbers - + also joins strings Same operator → different behaviour. We can also define how operators work for our own classes. 🔹 Example: ``` class Point: def __init__(self, x, y): self.x = x self.y = y def __add__(self, other): return Point(self.x + other.x, self.y + other.y) def display(self): print(self.x, self.y) p1 = Point(2, 3) p2 = Point(4, 5) p3 = p1 + p2 # Using overloaded + operator p3.display() ``` 🔹 What happened here? - We defined __add__() method - Now + works for Point objects - Python calls __add__() automatically 📌 Key takeaway: Special methods like __add__() allow operator overloading. 👉 Day 17: Method Overloading concept in Python (coming tomorrow) 👍 Like | 💬 Comment | 🔁 Share 📍 Follow me to learn Python OOP step by step #Python #OOP #LearningInPublic #30DaysOfPython #CodingJourney