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

LeetCode Problem 1572: "Matrix Diagonal Sum" : Given a square matrix mat, return the sum of the matrix diagonals. Only include the sum of all the elements on the primary diagonal and all the elements on the secondary diagonal that are not part of the primary diagonal.  The below code in python resolves this problem successfully. #dsa #matrix #leetcode #python #competitiveprogramming #datastructures #algorithms #problemsolving #coddingchallenge #dailycoding #programming

Not every validation fits a single field. Some rules only make sense when you see the whole object. That’s where model validators shine. Clean rules. Centralized logic. No hacks. 📘 Learn real-world validation patterns in Practical Pydantic → https://lnkd.in/eGiB7ZxU #Python #Pydantic #CleanCode

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

🔥 Day 67 of my #100DaysLogicChallenge Multithreading vs Multiprocessing — Parallel Thinking 🧠⚙️ Today I explored how programs run multiple tasks at the same time using Multithreading and Multiprocessing. Both are used to improve performance — but they solve different problems in very different ways. 🧠 What I learned today • Difference between thread & process • Why Python needs multiprocessing for CPU tasks • How threads share memory • How processes run independently • When to use each technique 🧵 Multithreading Multiple threads inside one process Share same memory Faster communication Best for I/O-bound tasks Affected by Python’s GIL 🧱 Multiprocessing Multiple independent processes Separate memory spaces True parallel execution Best for CPU-bound tasks Not limited by GIL 💡 Key Insight Threads share memory — Processes share nothing. Use the right tool for the right workload. #100DaysLogicChallenge #Day67 #Multithreading #Multiprocessing #SystemThinking #LearningInPublic #BuildInPublic 🚀

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

Today I learned about the while loop in Python 🐍 A while loop is used to repeat a set of instructions as long as a condition remains true. It’s especially useful when: ✅ You don’t know in advance how many times the loop should run ✅ The loop depends on user input or dynamic conditions ✅ You want to keep running until a specific condition changes Simple example: count = 0 while count < 5: print(count) count += 1 It keeps running until the condition becomes false. Small concept, but very powerful when building real-world logic and automation. Learning one Python concept at a time 🚀 #Python #DataScience #LearningInPublic #Programming #100DaysOfCode #CareerSwitch

✅ Day 1 of 100 Covered Python variables and string manipulation—loved the conceptual "necklace" analogy for strings. Applied it by building a Band Name Generator: a script that prompts for your city and pet's name, then prints a combined result. Hands-on practice with print(), input handling, and basic debugging. A well-structured first lesson that blends theory with immediate application. #python #100DaysOfCode

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

Daily LeetCode Question | Day 1 ✅ LeetCode 1351: Count Negative Numbers in a Sorted Matrix ✔️ Used the two-pointer (staircase) approach starting from the top-right corner of the matrix. At each step, I leveraged the row-wise and column-wise sorted property to eliminate multiple elements at once instead of checking every cell. 🔹 Approach: Two Pointers (Staircase Search) 🔹 Time Complexity: O(m + n) 🔹 Space Complexity: O(1) This optimized approach avoids brute force and binary search, making it both efficient and interview-friendly. #LeetCode #DSA #TwoPointers #ProblemSolving #Python #CodingJourney