Day 33/100 – #100DaysOfCode 🚀 Solved LeetCode #1480 – Running Sum of 1d Array (Python). Today I practiced prefix sum logic to compute the running sum of an array. Approach: 1) Initialize an empty list to store the running sum. 2) Maintain a variable sum = 0. 3) Traverse the array and keep adding each element to sum. 4) Append the updated sum to the result list. 5) Return the final running sum array. Time Complexity: O(n) Space Complexity: O(n) Understanding prefix sums helps solve many array problems efficiently 💪 #LeetCode #Python #DSA #Arrays #PrefixSum #ProblemSolving #100DaysOfCode

🎯 Project: Guess the Number Game I developed a fun and interactive game using Python where the user has to guess a randomly generated number. ✨ Key Features: Random number generation User input handling Hints like “Too High” or “Too Low” Multiple attempts until correct guess 💻 Technologies Used: Python This project helped me strengthen my logic-building skills and understand how to work with conditions and loops effectively. Excited to explore more in Python and build advanced projects! 🚀 #Python #GameDevelopment #BeginnerProjects #CodingJourney #LearningByDoing 🔗 GitHub Repository: https://lnkd.in/d8xsxgVX 🎥 Project Demo:

Day 1 of getting back into Python 🐍 Spent some time revisiting the basics and strengthening the fundamentals. Covered things like data types, strings, and basic operations, and built a few small projects along the way. It’s always interesting how the basics make everything else easier to understand. #Python #LearningJourney #DataAnalytics #ContinuousLearning

🚀 Solved today’s GeeksforGeeks Problem of the Day: Intersection of Two Sorted Arrays using Python 🐍 Problem: Find the distinct common elements between two sorted arrays. Approach: Used the efficient Two Pointer Technique 👇 ✔ Traverse both arrays simultaneously ✔ Compare elements and move pointers accordingly ✔ Skip duplicates to ensure unique results 💡 Key Insight: Since arrays are already sorted, we can avoid extra data structures and solve it in O(n + m) time. 💡 Concepts Used: Two Pointers | Arrays | Duplicate Handling This problem is a great example of how understanding input properties (sorted arrays) can drastically optimize your solution 🚀 #geekstreak60 #geeksforgeeks #dsa #python #coding #problemSolving #arrays #twopointers

🚀 Day 2 — Python Journey Continuing with Python, today I focused on integer operations. 📌 What I learned: - Integer declaration - Addition, subtraction, multiplication - Division and modulus (remainder) - Power operation - Operator precedence (which operation runs first) 💡 What stood out: Understanding operator precedence is really important — the same expression can give different results if you don’t know the order of execution. Also, modulus (%) is more useful than it looks (especially for problems and logic building). Trying to stay consistent and build strong basics step by step. #Day2 #Python #CodingJourney #Consistency #LearnInPublic

Day 17 | Problem-Solving Practice Today I worked on: • Counting the number of digits in a number Implemented a basic approach and then handled edge cases like negative numbers and zero. Focusing on writing correct logic for all scenarios, not just the common ones. GitHub: https://lnkd.in/g35tV9Gj #ProblemSolving #Python #LearningInPublic #Consistency

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

Some days, VS Code feels like a puzzle I didn’t sign up for. Setting up a simple thing like Python with Conda base turned into hours of confusion. Paths, terminals, environments… nothing talks to each other at first. But I’m learning: frustration is part of the process, not a sign to quit. Slowly, things start to make sense. #techjourney #womenintech #datasciencejourney #vscode #python #conda #beginnertodev

Day 46/100 – #100DaysOfCode 🚀 Solved LeetCode #2733 – Neither Minimum nor Maximum (Python). Today I practiced sorting and simple array logic to find any element that is neither the minimum nor the maximum in the array. Approach: 1) Sort the array. 2) Check the length of the array. 3) If the size is less than or equal to 2, return -1 (no valid element exists). 4) Otherwise, return the second element as it will be neither min nor max. Time Complexity: O(n log n) Space Complexity: O(1) Understanding how sorting simplifies boundary-based problems 💪 #LeetCode #Python #DSA #Arrays #Sorting #ProblemSolving #100DaysOfCode