Python Basics: Day 1 - Variables & String Manipulation

Built a GUI-based word guessing game in Python to move beyond terminal-only projects. The game uses a cleaned 100k-word dataset and includes difficulty selection, scoring, hints, and replay , all handled through an event-driven Tkinter interface. GitHub: https://lnkd.in/gDc3GNN9 #Python #Tkinter #GUI #LearningByBuilding

#Day3 of #100DaysofAI Day 3 was packed with Python control flow mastery and function building! Revised if/elif/else, for/while loops with break/continue, list comprehensions, then wrote 8 practical functions (add/subtract/multiply/divide, even/odd checker, prime tester, reverse number, Fibonacci generator). Built a Simple Calculator and Number Guessing Game as mini-projects. Key takeaway: print() shows output, return computes values — functions must return, never assign print() to variables. Control flow is logic's backbone! #AIJourney #LearningInPublic #Python #ArtificialIntelligence #BuildInPublic

Day 7 of LeetCode 🚀 | 3Sum Closest Today’s problem was 3Sum Closest — finding three numbers whose sum is closest to a given target. Approach: Sort the array Fix one element and use the two-pointer technique Update the closest sum based on minimum difference Adjust pointers to move toward the target ⏱️ Time Complexity: O(n²) 📦 Space Complexity: O(1) #LeetCode #Day6 #DSA #ProblemSolving #TwoPointers #Python #CodingJourney

1021. Remove Outermost Parentheses While the standard approach uses a stack, I optimized the space complexity to O(1) (ignoring output) by implementing a Depth Counter. By tracking the nesting level with a simple integer, I was able to filter outermost shells in a single O(N) pass. Achieving a 0ms runtime in Python isn't just about the algorithm; it's about choosing the right primitive operations. #LeetCode #Python #Programming #Optimization #DataStructures #CodingStreak #SoftwareEngineering

Day 4 of LeetCode 🚀 | Divide Two Integers Today’s challenge was Divide Two Integers — performing division without using *, /, or %. Approach: Handle sign using XOR Convert numbers to absolute values Use bit shifting to subtract the largest possible multiple Take care of 32-bit overflow Time Complexity: O(log n) Space Complexity: O(1) #LeetCode #Day4 #DSA #ProblemSolving #Python #CodingJourney

Daily LeetCode Progress | Day 14✅ LeetCode #3 | Longest Substring Without Repeating Characters ✔️ 🧠 Approach: • Applied a sliding window (two pointers) technique to maintain a substring with all unique characters. • Used a set to track characters in the current window for constant-time duplicate checks. • When a duplicate was encountered, shifted the left pointer until the window became valid again 🔁 • Continuously updated the maximum window size while expanding the right pointer for optimal results 📈 ⏱️ Time Complexity: O(n) 📦 Space Complexity: O(n) “Efficiency is not about doing more, it’s about doing it right.” #LeetCode #DataStructures #SlidingWindow #Python #Consistency

For loop vs While loop — not interchangeable Quick mental model: -for loops iterate over a known sequence -while loops wait on a condition -for is about certainty. -while is about state. Choosing correctly makes code safer and easier to reason about. I’ve shared the difference so you don’t just write loops that work, but loops that behave correctly under pressure. #python #loop #forloop #whileloop

LinkedIn Post Draft 🎯 Solved: Running Sum of 1D Array (LeetCode) Today I cracked the Running Sum of 1D Array problem on LeetCode using Python. Instead of using nested loops or extra slicing, I focused on a simple idea: Keep a running total and push it into the result list. This small problem reinforced something important: Clean logic + simple loops beat complicated code every time. My solution passed all test cases with 0ms runtime. 🧠 What I practiced here: Loop control Accumulators List building Time & space efficiency 📌 Code & solution available on my GitHub and LeetCode. If you're learning DSA with Python, start with these fundamentals — they scale to harder problems like sliding window, prefix sums, and two pointers. #Python #DSA #LeetCode #ProblemSolving #CodingJourney #SoftwareEngineering

A/B testing is so often a case of "it depends" - and can take one down many, MANY rabbit holes! Because A/B tests often involve cost or risk or both, preparation is crucial. I've put together this article (https://lnkd.in/diJrEGKy) on some of the key considerations - along with Python "how to" snippets - that can assist in the planning phases. #ABTesting #Python #HowTo

Day 35 – Implementing Insertion Sort: Today, I implemented the Insertion Sort algorithm using Python. This sorting technique works by taking one element at a time and inserting it into its correct position in the already sorted part of the list. It helped me understand how shifting elements works and why insertion sort performs efficiently on small or nearly sorted datasets. GitHub Code: https://lnkd.in/gCgF48zH #Day35 #100DaysOfCode #InsertionSort #Python #DSA #Algorithms #ProblemSolving #LearningByDoing #Consistency