🚀 Day 11 of My Python + DSA Journey Today’s problem was all about greedy approach👇 ✅ Jump Game (#55) 💡 Jump Game Check if you can reach the last index 🔍 Approach: Tracked maximum reachable index → if current index exceeds it, return False ⏱ O(n) time | O(1) space 🔥 What I learned today: • Greedy approach can simplify complex problems • Tracking max reach avoids unnecessary checks • Early exit conditions improve efficiency Turning logic into faster decisions ⚡ #Day11 #LeetCode #Python #DSA #CodingJourney #100DaysOfCode

How to use Python (Pandas and Matplotlib) to convert GenAI-generated Multiple Choice Questions (MCQs) into clean, professional images—Watch Video here : https://lnkd.in/gCCXd5HZ

🌟 New Blog Just Published! 🌟 📌 Fast Python Project Setup 2026 with uv, Ruff, Ty, and Polars 🚀 📖 Starting a new Python project used to feel like assembling a jigsaw puzzle before you could write any code. You had to pick an environment manager, a dependency locker, a formatter, a linter, and a...... 🔗 Read more: https://lnkd.in/dZDzhD8G 🚀✨ #uv #ruff #polars

Day 3/365: Comparing Two Strings Character by Character 🧵🧠 Today I worked on a simple but fundamental logic problem: checking if two strings are the same, without directly using a built-in equality check. First, I compare the lengths of both strings. If lengths differ, they can’t be the same. If lengths match, I loop through each index and compare characters one by one. If any character is different, I break and print that the strings are not the same. If the loop finishes without finding a mismatch, the else block of the for loop runs and prints that the strings are the same. The interesting part is the for-else in Python. The else only runs when the loop completes normally (no break). This makes it a clean way to express: “if I didn’t find any mismatch in the entire loop, then the strings are equal.” Day 3 done ✅ 362 more to go. #100DaysOfCode #365DaysOfCode #Python #LogicBuilding #StringComparison #ForElse #CodingJourney #LearnInPublic #AspiringDeveloper

While working on a project, I came across something simple but really important .𝐞𝐧𝐯 𝐟𝐢𝐥𝐞𝐬. At first, I was hardcoding things like 𝐀𝐏𝐈 𝐤𝐞𝐲𝐬 and 𝐔𝐑𝐋𝐬 directly into my code. It worked, but it didn’t feel right. That’s when I learned how .𝐞𝐧𝐯 files help keep sensitive data separate from the actual codebase. I put together a quick 4-slide breakdown covering: → What a .𝐞𝐧𝐯 file is → Why it matters → How to use it in Python #Programming #Python #WebDev #SoftwareEngineering #LearnInPublic #DevTips #100DaysOfCode #COMSATS #CUI

🚀 Today I practiced Python by building a mini project Created a Number Guessing Game 🎯 What I worked on: • Variables & data types • Loops (while) • Conditional statements (if/elif/else) • Attempt tracking logic What I learned: Building something small helped me understand how logic and flow actually work, instead of just watching tutorials. Challenges I faced: • Managing loop conditions • Tracking attempts correctly Sharing a snippet of my code below 👇 Next: → Building a CLI To-Do List → Improving input validation Staying consistent and learning step by step. #Python #LearningInPublic #CodingJourney #BeginnerDeveloper

🚀 Day 6 of #111DaysOfLearningForChange – Code for Change Built my first CLI-based To-Do App using Python 🧠💻 📌 What I learned today: • File handling using JSON • Structuring a CLI application • Managing state (tasks) with persistent storage • Using match-case for cleaner control flow 🛠️ What I built: A command-line To-Do app with features: • Add tasks • View tasks • Mark tasks as complete ✔️ • Delete tasks • Data stored in a JSON file ✨ Key takeaway: Building projects makes concepts like file handling and control flow much clearer than just theory ⚡ Challenge faced: Handling task IDs and updating data correctly after deletion #111DaysOfLearningForChange #CodeForChange #Python #CLI #Projects #LearningInPublic

Rook Attack Given two strings for the location of two rooks on a chess board, determine if they can attack each other. A standard chessboard is 8x8, with columns labeled A through H (left to right) and rows labeled 1 through 8 (bottom to top). Rooks can move as many squares as they want in a horizontal or vertical direction. So if they are on the same row or column, they can attack each other. freeCodeCamp #DailyCodingChallenge #python #javascript

Day 8/365: Reversing a List Without Using Built‑in Functions 🔁🧠 Today I revisited a very common operation in programming: reversing a list. But instead of using Python’s built‑in methods like reverse() or slicing (n[::-1]), I implemented the logic manually using two pointers and a while loop. Why this exercise matters: 1. It forces me to think about how data is stored and changed in memory. 2. I practiced the two‑pointer technique, which is used a lot in array and string problems. 3. It reminded me that behind every “simple” built‑in method, there is an actual algorithm. Day 8 done ✅ 357 more to go. If you have similar two‑pointer problems (like checking palindromes or partitioning arrays), send them my way — I’d love to try them next. #100DaysOfCode #365DaysOfCode #Python #LogicBuilding #TwoPointers #ListManipulation #CodingJourney #LearnInPublic #AspiringDeveloper

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