100 Days of Code: Python Password Generator & FizzBuzz Challenge

24/100: Mastering File Systems & Automation! After building games for the last few days, today I shifted my focus toward File Handling and Automation in Python. This is where coding starts to solve real-world administrative tasks! Key Learnings from Day 24: File I/O: Understanding the difference between read, write, and append modes. The "With" Keyword: Learning how to manage file resources safely using context managers (no more manual .close()!). Mail Merge Project: Built a script that automates personalized letters. It takes a list of names and a template, then generates individual files for each person. Automating repetitive tasks like these is exactly why Python is so powerful in the business world. #Python #100DaysOfCode #Automation #FileHandling #Programming #VSCode

🚀 Day 79 of #100DaysOfCode 💡 LeetCode 338 – Counting Bits Solved today’s problem with a clean and efficient Dynamic Programming + Bit Manipulation approach 💪 🔍 Problem: For a given number "n", return an array where each index "i" contains the number of 1’s in the binary form of "i". ⚡ My Approach: Instead of recalculating bits every time, I reused previous results: 👉 "ans[i] = ans[i >> 1] + (i & 1)" 🧠 Why this works: - "i >> 1" → removes the last bit - "(i & 1)" → checks if last bit is 1 📈 Performance: ✅ Runtime: 3 ms (Beats 95% 🚀) ✅ Memory: 20.14 MB 🔥 Key Learning: Patterns in binary operations can simplify problems drastically. DP + bit tricks = powerful combo ⚡ #Day79 #LeetCode #CodingJourney #Python #DSA #DynamicProgramming #BitManipulation #100DaysOfCode

Today I focused first on Python fundamentals that are essential for practical coding: • Functions help organize logic into reusable blocks, making programs cleaner and easier to manage. • Modules allow code reuse and structure, whether importing built-in ones like math or creating custom ones. • File Handling connects programs to external data, enabling reading, writing, and updating files. These basics form the foundation for building larger, real-world applications. Later, I continued with DSA problem-solving and worked through: 1. Intersection of Two Arrays II – practicing frequency maps to handle duplicates. 2. Jump Game II – applying greedy strategies to minimize jumps. 3. Triangle – solving a DP problem to find the minimum path sum from top to bottom. 4. Unique Binary Search Trees – learning how Catalan numbers and DP combine to count BSTs. #Python #DSA #Leetcode #DynamicProgramming #Functions #Modules #FileHandling #CodingJourney #LearningEveryday

🚀 Day 4/100: Randomization & Data Structures! 🎰⚔️ Continuing the #100DaysOfCode challenge! Today’s training was all about making programs unpredictable and managing organized data. I built the classic "Rock Paper Scissors" game, focusing on: ✅ Python Lists (Storing and accessing data) ✅ The Random Module (Generating unpredictable outcomes) ✅ Indexing & Nested Logic (Mapping user choices to game results) Mastering how to handle lists and random events is a huge power-up for simulation and data sampling! ⚡️ Check out my code here: 🔗 https://lnkd.in/gCkGcSg6 Progressing one day at a time. Day 5, I'm coming for you! 👊 #Python #100DaysOfCode #GameDev #LogicBuilding #PythonLists #Programming #CodingLife

🚀 Day 3/100: Mastering Logic Flow & Decision Making! 🏝️ The #100DaysOfCode journey is heating up! Today was all about Control Flow and Conditional Logic in Python. I built a "Treasure Island" text adventure game to practice: ✅ Nested if/elif/else statements ✅ Complex logical operators (AND / OR) ✅ Managing user input edge cases Understanding branching logic is a massive step toward building robust automation scripts and handling real-world data scenarios. ⚔️ Check out my code here: 🔗 https://lnkd.in/gxyRjpGh Onward to Day 4! 🚀 #Python #100DaysOfCode #LogicBuilding #Programming #DevLife #GrowthMindset #CodeNewbie

🗓 7 April 2026 🚀 LeetCode Problem #973 — K Closest Points to Origin Solved this problem using a Heap (Priority Queue) approach in Python. 💡 Approach: - Calculated the distance of each point from origin using: 👉 x² + y² (no need for square root) - Used a max heap (by pushing negative distance) - Maintained heap size = k - If size exceeds k → removed the farthest point ⚡ Time Complexity: O(n log k) ⚡ Space Complexity: O(k) 🔥 This is a great example of optimizing from brute force (sorting O(n log n)) to a more efficient heap-based solution. Consistency update: solving problems daily and improving problem-solving skills step by step. #leetcode #dsa #python #coding #100DaysOfCode #heaps #learning

Been building a small Python toolkit over the past few days to automate the stuff I kept doing manually on my machine monitors CPU/RAM/disk in real time, sorts files automatically, runs scheduled jobs in the background, backs up folders to zips, and plots a live stats chart all from one CLI menu nothing groundbreaking, just scratching my own itch and figured I'd clean it up and open source it repo's up if you want to check it out or use it https://lnkd.in/dSyts_Gx built under Litends we're slowly open sourcing more of our internal tooling #Python #OpenSource #Automation #Litends

I recently worked on a mini project to strengthen my Python fundamentals — a Movie Ticket Booking Calculator! Features I implemented: • Age-based eligibility checks • Special rules for evening shows • Membership-based discounts • Weekend & evening extra charges • Seat-based service charges (Premium, Gold, Regular) • Final ticket price calculation Key concepts I practiced: • Conditional statements (if-else) • Logical operators (and, or) • Nested conditions • Clean code structuring This project helped me better understand how real-world rules can be translated into logic using Python. #Python #Coding #BeginnerProjects #Programming #Learning #100DaysOfCode #DeveloperJourney

🚀 Solved: Middle of the Linked List Today I worked on a classic linked list problem — finding the middle node efficiently. 🔹 Problem: Given the head of a singly linked list, return the middle node. If there are two middle nodes, return the second one. 🔹 Approach: Used the two-pointer technique: Slow pointer moves 1 step at a time Fast pointer moves 2 steps at a time By the time the fast pointer reaches the end, the slow pointer will be at the middle. 🔹 Complexity: Time: O(n) Space: O(1) 💡 Key takeaway: Two-pointer techniques are extremely powerful for linked list problems #coding #datastructures #python #leetcode #learning #problemsolvingSkills #10000 Coders #Vamsi Enduri #GALI VENKATA GOPI #Manoj Kumar Reddy Parlapalli

🐍 Lab #3 is Live — Exploring Basic Operators in Python! Just published the third lab in my Programming Fundamentals series, and this one dives deep into the building blocks every Python programmer must master! 💡 ✅ What's covered in Lab 3: 🔢 Arithmetic Operators — +, -, *, /, //, %, ** 📝 Assignment & Compound Operators — +=, -=, *=, and more ⚖️ Comparison Operators — ==, !=, <, >, <=, >= 🔗 Logical Operators — and, or, not 📌 Operator Precedence — because order matters! 💬 Fun fact: In Python, = is assignment and == is comparison — a tiny difference that causes BIG bugs for beginners! 😄 Whether you're just starting your coding journey or brushing up on the fundamentals, understanding operators is non-negotiable. Every program you'll ever write depends on them! 🎯 Lab includes: → 30 Practice Questions across all operator types → 10 Input-Based real-world exercises → Clear examples with expected outputs Consistency is the key to mastering programming. One lab at a time! 🚀 📌 Follow along as I continue this series — more labs coming soon! #Python #Programming #ProgrammingFundamentals #LearnPython #Lab3 #Operators #Python101 #CodingJourney #TechEducation #UniversityOfLahore #CSStudents #100DaysOfCode