Chained Indexing in Python

Python Clarity Series – Episode 24 Topic: Late Binding in Loops (Functions) ⚠️ Advanced pitfall: Late binding in loops funcs = [] for i in range(3): funcs.append(lambda: i) for f in funcs: print(f()) Output: 2 2 2 ❗ 👉 Expected: 0 1 2 👉 Got: same value 💡 Reason: Lambda captures variable, not value. 💡 Fix: funcs.append(lambda i=i: i) 💡 Rule: Default arguments capture current value. This is a classic interview trap. #PythonAdvanced #CodingPitfalls #DeveloperLevel #python #clarity

🚀 Day 72 of #100DaysOfCode Today’s problem: Words Within Two Edits of Dictionary. At first, it looked like a simple string comparison… but checking all possibilities made it tricky. Had to focus on counting differences instead of overcomplicating transformations. 💡 What helped me: Compare character by character → count mismatches Stop early if differences exceed the limit. It’s more about controlling comparisons than trying every change. Slowly getting better at string problems. #DSA #LeetCode #CodingJourney #Python #Strings

🔁 Exploring Sorting Algorithms in Python Today I practiced two fundamental sorting techniques: ✅ Bubble Sort ✅ Selection Sort 💡 Key Learnings: * Bubble Sort repeatedly swaps adjacent elements to push larger elements to the end * Selection Sort selects the minimum element and places it in the correct position * Understanding time complexity becomes clearer when you count operations manually #Python #DataStructures #Algorithms #CodingJourney #100DaysOfCode #LearningInPublic

Day 60/100 — #100DaysOfCodingChallenge 60 days in… consistency is slowly turning into a habit now. 🔹 Python (DSA) Solved Search a 2D Matrix — used binary search by treating the matrix like a flattened sorted array. It was a nice reminder of how powerful binary search can be when applied smartly. 🔹 SQL Did some light practice to keep concepts fresh and maintain the streak. #Python #SQL #DSA #LeetCode #Day60 #100DaysOfCode #LearningInPublic #Consistency

Day 53/100 – #100DaysOfCode 🚀 Solved LeetCode #125 – Valid Palindrome (Python). Today I practiced string cleaning and validation to check whether a given string is a palindrome. Approach: 1) Traverse the string and keep only alphanumeric characters. 2) Convert all characters to lowercase. 3) Build a cleaned string. 4) Compare the string with its reverse. 5) If both are equal, return True; otherwise, return False. Time Complexity: O(n) Space Complexity: O(n) Learning how preprocessing simplifies string problems 💪 #LeetCode #Python #DSA #Strings #ProblemSolving #100DaysOfCode

Beyond String Concatenation  When I started, I used to concatenate strings the old-school way. It was messy, prone to errors, and hard to read The Problem: Using + requires manual type conversion (like str(21)) and gets confusing with all the extra quotes and spaces Solution: F-strings Introduced in Python 3.6, F-strings makes your code: ✅ Readable: You see the full sentence structure ✅ Fast: They are more efficient than older methods ✅ Flexible: You can perform math or call methods directly inside { } It’s a small concept, but it’s one of the easiest ways to make code look 10x more professional. #Python #30DaysOfCode #BCA #LearningInPublic #Day21 #JECRC Day 21/30

Python Clarity Series – Episode 25 Topic: Mutable vs Immutable Function Behavior 📌 Why did my list change after function call? def modify(lst): lst.append(100) a = [1, 2] modify(a) print(a) Output: [1, 2, 100] 👉 Lists are mutable → changes reflect outside Now: def modify(x): x = x + 10 a = 5 modify(a) print(a) Output: 5 👉 Integers are immutable → no change outside 💡 Rule: Mutable → changes persist Immutable → changes don’t This confusion causes logic errors. #PythonBasics #FunctionConcepts #StudentClarity #python #clarity

Day 48/100 – #100DaysOfCode 🚀 Solved LeetCode #13 – Roman to Integer (Python). Today I practiced string processing and mapping logic to convert Roman numerals into integers. Approach: 1) Create a dictionary to map Roman symbols to their integer values. 2) Traverse the string from left to right. 3) If the current value is less than the next value, subtract it. 4) Otherwise, add it to the total. 5) Return the final result. Time Complexity: O(n) Space Complexity: O(1) Understanding pattern-based problems in strings 💪 #LeetCode #Python #DSA #Strings #ProblemSolving #100DaysOfCode

Day 39 / #120DaysOfCode – LeetCode Challenge ✅ Problem Solved: • Integer to Roman 💻 Language: Python 📚 Key Learnings: • Learned how to map numerical values to symbolic representations • Used greedy approach for optimal conversion • Understood importance of ordered value-symbol pairing • Practiced handling special subtraction cases (IV, IX, XL, etc.) • Improved skills in writing structured and readable logic Consistency + Logic = Growth 🚀 🔗 LeetCode Profile: https://lnkd.in/gbeMKcv5 #LeetCode #Python #DSA #Algorithms #CodingJourney #Greedy #120DaysOfCode

Day 102 Backtracking patterns are starting to repeat. #Day102 🧩 90. Subsets II How today went: • Similar to the basic Subsets problem • Key difference: handling duplicates • Sorting the array is important • While iterating, skip duplicates to avoid repeating subsets What clicked: Backtracking becomes easier when you: • Recognize the base pattern • Add constraints like duplicate handling Same structure, new rule. That’s how patterns build. #LeetCode #DSA #Python #Backtracking #Recursion #LearningInPublic #Consistency