Aswani chejeti’s Post

🚀 Day 27 of Python Problem Solving!! Today, I worked on the classic Two Sum problem. 💡 What I Practiced Today: Traversing arrays using loops Understanding brute force vs optimized approaches Using hashmaps (dictionaries) for faster lookups Improving time complexity from O(n²) to O(n) Writing clean and efficient Python code 🧠 Problem Statement: Given an array of integers nums and an integer target, return the indices i and j such that: nums[i] + nums[j] == target and i != j. 📌 Example: Input: nums = [2, 7, 11, 15], target = 9 Output: [0, 1] ✨ I explored two approaches: 1️⃣ Brute Force using nested loops (O(n²)) 2️⃣ Optimized approach using a dictionary for constant-time lookup (O(n)) This problem helped me understand how choosing the right data structure can significantly improve performance — an important concept for coding interviews. #Day27 #100DaysOfCode #Python #CodingJourney #ProblemSolving #DataStructures #Programming #LearnToCode #TechJourney

🧠 Python Concept: unpacking (Multiple Assignment) Write less, assign more 😎 ❌ Traditional Way a = 1 b = 2 c = 3 ✅ Pythonic Way a, b, c = 1, 2, 3 🧒 Simple Explanation 📦 Think of unpacking like opening a box ➡️ Multiple values ➡️ Assigned in one line ➡️ Clean & simple 💡 Why This Matters ✔ Less code ✔ Cleaner assignments ✔ Very common in Python ✔ Improves readability ⚡ Bonus Examples 👉 Swap values easily: a, b = b, a 👉 Unpack list: nums = [1, 2, 3] a, b, c = nums 👉 Ignore values: a, _, c = [1, 2, 3] 🐍 Assign smarter, not longer 🐍 Python loves clean code #Python #PythonTips #CleanCode #LearnPython #Programming #DeveloperLife #100DaysOfCode

🚀 **Built a Simple Typing Speed Test in Python!** Today, I worked on a small but interesting project — a **Typing Speed Test using Python**. The idea was simple: ✔️ Display a random sentence ✔️ Measure the time taken to type ✔️ Calculate typing speed (WPM) ✔️ Check typing accuracy What I liked most about this project is how it combines basic concepts like: * `time` module for tracking performance * `random` for dynamic sentences * String handling & logic building 📊 **Sample Output:** * Typing Speed: ~16 WPM * Accuracy: ~62% It may look like a beginner project, but it really helped me understand how logic, timing, and user input work together in real applications. 💡 Next, I’m planning to improve it by: * Adding GUI (Tkinter) * Better accuracy calculation * Real-time feedback Learning step by step and building small projects is the best way to grow in programming 🚀 #Python #Programming #BeginnerProjects #CodingJourney #PythonProjects #LearningByDoing#StudentDeveloper

🚀 Python Series – Day 7: Loops in Python (for & while) Till now, we learned conditions (if-else) 💻 But what if we want to repeat something multiple times? 🤔 👉 That’s where Loops come in 🔥 🧠 What is a Loop? A loop is used to execute a block of code multiple times 🔁 for Loop Used when we know how many times to run the loop for i in range(5): print(i) 👉 Output: 0 1 2 3 4 🔄 while Loop Used when we don’t know how many times to run i = 0 while i < 5: print(i) i += 1 ⚠️ Important Concept 👉 Infinite Loop (Be careful!) while True: print("Hello") 🛑 Break Statement Stops the loop for i in range(10): if i == 5: break print(i) ⏭️ Continue Statement Skips current iteration for i in range(5): if i == 2: continue print(i) 🎯 Why are Loops Important? ✔ Automate repetitive tasks ✔ Save time & effort ✔ Used in almost every program ❓ Question for you: What will be the output? for i in range(3): print(i * 2) 👉 Comment your answer 👇 📌 Tomorrow: Functions in Python 🔥 #Python #Coding #DataScience #Programming #LearnPython #Beginners #Tech #MustaqeemSiddiqui

🚀 Day 26 of Python Problem Solving!! Today, I worked on a Python problem to check whether two strings are anagrams of each other. 💡 What I Practiced Today: Understanding how to compare two strings efficiently Using dictionaries (hashmaps) for character frequency counting Applying the sorting technique as an alternative approach Analyzing time complexity of different solutions Handling edge cases like unequal string lengths 🧠 Problem Statement: Given two strings s and t, return true if they are anagrams, otherwise return false. 📌 Example: Input: s = "apple", t = "aplep" Output: true ✨ I explored two approaches: 1️⃣ Using dictionaries to count character frequencies 2️⃣ Using sorting to directly compare both strings This problem helped me understand how different approaches can solve the same problem with varying efficiency — a key concept for coding interviews. #Day26 #100DaysOfCode #Python #CodingJourney #ProblemSolving #DataStructures #Programming #LearnToCode #TechJourney

👇 🚀 Day 25 of Python Problem Solving!! Today, I worked on a Python problem to check whether an array contains duplicate elements. 💡 What I Practiced Today: Traversing an array efficiently Using data structures like sets for quick lookup Understanding time complexity (O(n) vs O(n log n)) Comparing different approaches (sorting vs hashing) Handling edge cases like empty arrays or unique elements 🧠 Problem Statement: Given an integer array nums, return true if any value appears more than once in the array, otherwise return false. 📌 Example: Input: nums = [1, 2, 3, 3] Output: true ✨ This problem helped me strengthen my understanding of efficient searching techniques and choosing the right approach to optimize performance — an important skill for coding interviews. #Day 25 #100DaysOfCode #Python #CodingJourney #ProblemSolving #DataStructures #Programming #LearnToCode #TechJourney

Day 21 of #100DaysOfLearning — Python OOP & Operator Overloading Today, I worked on building a Vector class in Python and explored how to make code more intuitive using operator overloading. What I learned: -Creating a class with attributes (x, y) -Implementing __add__() to add two vectors using + -Using __str__() to display vectors in mathematical form (like 5i + 9j) -Taking user input in custom format (5i 9j) and converting it into usable data One interesting part was handling input like: 5i 9j → converting it into numeric values using string methods like .replace() and .split() Result: I can now add two vectors like: (5i + 9j) + (1i + 2j) = (6i + 11j) This small project helped me understand how powerful Python’s magic methods are in making code cleaner and closer to real-world math. Next: Planning to explore vector operations like dot product and magnitude (important for Machine Learning) #Python #MachineLearning #100DaysOfCode #OOP #CodingJourney #LearnInPublic #SkillShikshya

How async/await Works in Python (Simple Explanation) Async programming in Python allows multiple tasks to run without blocking each other. Instead of waiting for one task to finish, Python can switch to another task. Key Concepts: - async → defines a function that runs asynchronously - await → pauses execution until the task is complete How it works: 1. Task starts (e.g., API call) 2. Instead of waiting, Python moves to another task 3. When result is ready → execution continues Example Use Cases: - API requests - Database queries - File handling - Web scraping Why it’s important: - Faster performance for I/O tasks - Better resource utilization - Handles multiple operations efficiently Final Insight: Async is not about doing things faster… It’s about not wasting time while waiting. Follow Saif Modan #Python #Async #Backend #Programming #Tech #LearningInPublic

Stop Wasting Memory! Conquer Python’s Deadliest Trap: The Reference Cycle. Think your Python code is perfectly memory-efficient just because you use del? Think again. You could be leaving massive memory leaks on the table, and it’s time to see exactly why. I’ve put together this definitive four-panel visualization to expose the inner workings of CPython’s memory management and, more importantly, why it sometimes fails without help. Reference cycles are silent performance killers. When objects get stuck pointing to each other, they become isolated ‘zombies’ that refuse to die, driving up your application’s footprint and potentially triggering crashes. This guide isn’t just theoretical—it's essential knowledge for writing production-ready, scalable Python: See the Illusion: We show how innocently two lists get created. Witness the Trap: Watch as simple append operations create an unbreakable bond—the cycle is born, and ref counts skyrocket. Feel the 'Deadlock': The scariest part. You delete the variables, but the objects live on. They are unreachable, invisible, yet still consuming precious RAM. Meet Your Savior: We introduce the Cyclic Garbage Collector (GC). It’s the only tool powerful enough to break this deadlock and reclaim that trapped memory. Understanding this mechanism isn't optional; it's the difference between a leaky script and robust software. Study this diagram, understand the stakes, and start writing cleaner, smarter Python. What’s your biggest memory optimization challenge? Share it in the comments! 👇 #Python #CPython #MemoryManagement #Programming #TechExplainer #CodingBestPractices #SoftwareEngineering #DataStructures

Most Python code looks simple until you realize how much is happening under the surface. Take this for example: _C = (1, 2, 3) a, b, c = _C print(a) This is iterable unpacking, more precisely Python’s way of doing positional destructuring assignment. What actually happens: _C is evaluated as an iterable Python matches elements positionally Each value is bound in a single atomic assignment step So internally: a = _C[0] b = _C[1] c = _C[2] This pattern is not just syntactic sugar, it is widely used in production code: Function return unpacking (return x, y) Iteration over structured data API responses and tuple-based records Why it matters: Removes manual indexing (less error prone) Improves intent readability Makes transformations explicit and compact One important constraint: If the structure does not match, Python fails fast with a ValueError, which is often a feature, not a bug. Clean syntax, strict alignment, predictable behavior. That is the philosophy behind Python’s design. Which Python feature felt too simple until you saw it in real systems? #Python #SoftwareEngineering #CleanCode #Programming #PythonTips #Coding #Developer #SystemDesign