Python Fundamentals: Week 1 of #100DaysOfCode

🚀 Day 44 of My Coding Journey Today I explored Python Regular Expressions and learned how to find the start and end indices of substrings, even when they overlap! 🔍 💡 Key Takeaways: ✨ start() and end() help locate exact positions of matches ✨ Regular finditer() doesn’t capture overlapping patterns ✨ Using lookahead (?=...) allows us to detect overlapping matches 📌 Example: String: aaadaa Substring: aa Output: (0, 1) (1, 2) (4, 5) 🔥 This was a great reminder that small details (like overlapping cases) can make a big difference in problem-solving. Consistency is key — one step every day! 💙 #Day44 #CodingJourney #Python #Regex #ProblemSolving #LearningEveryday #Consistency

🐍 Week 17 – Refining My Python Skills 🐍 This was a shorter week due to some personal commitments, but I focused on implementing the quicksort algorithm. Like last week with merge sort, I wanted to deeply understand how quicksort works. Here are the key concepts I worked on: - Implemented a separate partition function to split around a pivot. In my approach, I used three buckets (left, middle, right) to handle duplicates more cleanly and avoid unnecessary comparisons. - Created a quick_sort function to implement the main algorithm, recursively sorting the partitions until the base case was met. After practicing merge sort, quicksort felt more intuitive, and the concepts connected more easily. In Week 18, I plan to practice implementing the Luhn Algorithm. #Python #CodingJourney #LearningInPublic

🚀 Day 3 — Python Journey Today’s focus was on float operations in Python (working with decimal numbers). 📌 What I learned: Float declaration Addition, subtraction, multiplication, division Rounding values using round() Scientific notation Precision handling in floats 💡 What I found interesting: Float values are not always 100% accurate due to precision limitations. Even simple calculations can sometimes give unexpected results. Understanding this early is important, especially for real-world applications like finance or data science. Step by step, trying to build a strong foundation. #Day3 #Python #CodingJourney #LearnInPublic #Consistency

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

Day 6 of my Build in Public journey 🚀 Here’s what I focused on today 👇 💻 Python • Revised sets and learned about what a frozenset is • Learned how arrays work in Python (array module, NumPy arrays) • Read how list comprehensions work 🌐 HTML • Learned how to use images in web pages • Explored forms and how they work • Started with web accessibility basics #BuildInPublic #100DaysOfCode #LearningInPublic #Consistency

Starting a new routine: Daily Python problem-solving. Day 1 was all about revisiting the fundamentals today. I worked through a few classic logic exercises: a FizzBuzz variant, some conditional logic for grade classification, and a few quick warmup drills. It’s always good to go back to the basics and build a little consistency. Excited to see how far I can push this habit over the next few weeks! You can check out my code for today over on GitHub here: https://lnkd.in/gvvC4yRk #Python #SoftwareEngineering #DeveloperJourney #Day1

Day 20 | Problem-Solving Practice Today I worked on determining the number of days in a given month and year. • Implemented a basic conditional approach • Optimized the solution using a set and simplified leap year logic Focused on handling edge cases like invalid month inputs and leap years correctly. Consistency over intensity — showing up every day and improving step by step. GitHub: https://lnkd.in/g35tV9Gj #ProblemSolving #Python #LearningInPublic #Consistency

💻 Day 20 of #100DaysOfCode Today was all about strengthening the basics 🔁 ✔️ Revised loops (for loop & while loop) ✔️ Solved 20+ practice questions ✔️ Focused on improving logic and speed Real progress comes from repetition and consistency. Building a strong foundation step by step 🚀 #Python #CodingJourney #Consistency #LearnToCode

Week 2 of #100DaysOfCode — done. 🎉 This week I focused on going deeper into Python. I started thinking less about just writing code, and more about writing better code. Focused on: 📊 Data Structures → Sets → Dictionaries ⚠️ Exceptions → Understanding errors → Handling them properly 🧪 Test-Driven Development → Writing tests before code → Thinking more about code reliability I’ve structured my learning into notes and practical examples to better understand the concepts : https://lnkd.in/epaBymnJ 14 days down. Staying consistent. 💻 #100DaysOfCode #Python #LearningInPublic #CodingJourney

Day 5/100 — Mastering the Basics that Matter Today I solved: Remove Duplicates from Sorted Array At first glance, it looks simple… but the real challenge was: Solving it in-place Maintaining O(1) space complexity Applying the Two Pointer technique efficiently Approach: Used two pointers (i & j) where: i tracks the last unique element j scans the array Whenever a new element is found, we update in-place — no extra space needed. Key Takeaways: Writing optimal code > just solving the problem In-place operations are super important for interviews Two pointers = must-know pattern in DSA Small problems like these build strong foundations for bigger challenges. Consistency continues… #100DaysOfCode #Day5 #DSA #LeetCode #Python #CodingJourney #ProblemSolving #TechGrowth #SoftwareEngineering #Consistency #KeepGrinding