Day 4 of #100DaysOfCode – Building Strong Logic Step by Step! Today’s session was all about improving logical thinking and mastering basics that matter in real coding Instead of just writing code, I focused on understanding how and why things work 👇 ✨ What I practiced today (Programs 41–50): 🔹 Working with numbers & conditions ✔️ Positive / Negative / Zero check ✔️ Sum of even & odd numbers ✔️ Sum of first N natural numbers 🔹 String & character handling ✔️ Word count in a sentence ✔️ ASCII value of characters ✔️ Identifying alphabets, digits & special characters 🔹 Logic building with loops ✔️ Multiplication tables ✔️ Strong number concept 🔹 Data insights ✔️ Finding differences in lists 💡 Key Learning: Simple problems = Strong foundation The more I practice, the more I realize: 👉 Logic is everything in programming ⚡ Every small program today is preparing me for bigger real-world problems tomorrow 🔥 Consistency is turning effort into skill! Global Quest Technologies ✨ #100DaysOfCode #Day4 #Python #PythonProgramming #CodingJourney #ProblemSolving #LearnPython #DeveloperMindset #TechSkills #SoftwareDevelopment #CodingLife #Consistency #FutureDeveloper #GlobalQuestTechnologies #GQT

🚀 Cracked the Spiral Matrix problem on LeetCode — and here’s the mindset behind it 👇 Most people jump straight into coding this problem. I didn’t. Instead, I approached it like a boundary management problem 🧠 🔍 My thought process: • Treat the matrix like a shrinking box • Maintain 4 pointers: top, bottom, left, right • Traverse layer by layer — not element by element • After each traversal, shrink the boundaries inward This helped me: ✅ Avoid unnecessary conditions ✅ Prevent duplicate traversals ✅ Keep the logic clean and scalable The real learning wasn’t just solving it — it was realizing how visualizing the structure simplifies the code. 💡 Sometimes the difference between confusion and clarity is just how you frame the problem. 🔥 Consistency + clarity > brute force coding #LeetCode #DSA #CodingJourney #ProblemSolving #Python #WomenInTech #TechLearning #SoftwareEngineering #100DaysOfCode #StudentDeveloper #CodingMindset #LearnInPublic

Code that writes code. 🌌 There is a point in every developer's journey where you stop thinking about Logic and start thinking about Patterns. Advanced Python is about: ~Abstraction: Using Protocols and Generics for structural typing. ~Automation: Using advanced Decorators to inject behavior across entire systems. ~Reliability: Understanding the memory manager so you can prevent leaks before they start. We use these "hidden" features not to make the code more complex, but to make the usage of our code more simple for everyone else. Which part of the "Advanced Mindset" was the hardest for you to learn? For me, it was finally mastering asyncio flow control. #CleanCode #Pythonic #ProgrammingPrinciples #SystemDesign #AdvancedCoding

Day 6 of #100DaysOfCode – Unlocking Number Logic 🔢🧠 Today’s learning took a deeper turn into number properties and mathematical patterns — and honestly, it changed how I look at numbers in programming 👀 It’s not just about coding anymore… It’s about understanding the behavior behind numbers ✨ What I explored today (Programs 61–75): 🔹 Advanced number concepts ✔️ Sunny, Happy, Duck, Buzz numbers ✔️ Fascinating & Digital Root logic 🔹 Number system conversions ✔️ Decimal ↔ Binary ✔️ Decimal → Octal & Hexadecimal 🔹 Mathematical problem-solving ✔️ HCF & Co-Prime numbers ✔️ Sum of divisors ✔️ Abundant & Deficient numbers 💡 Big Learning Today: Some numbers follow patterns… Some numbers repeat loops… And some numbers reveal logic only when you break them step by step 👉 Example: A Happy Number keeps transforming until it becomes 1 If it loops → it’s not happy That’s exactly like coding… 👉 Keep improving → you reach clarity 👉 Stay stuck → you repeat mistakes 🔥 Consistency is turning concepts into confidence! 💬 Day by day, I’m not just coding… I’m thinking like a programmer Global Quest Technologies ✨ #100DaysOfCode #Day6 #Python #PythonProgramming #CodingJourney #ProblemSolving #LearnPython #DeveloperMindset #LogicBuilding #TechSkills #SoftwareDevelopment #Consistency #FutureDeveloper #GlobalQuestTechnologies #GQT

Building this trading bot taught me how powerful clean architecture, modular design, and API‑driven automation can be. My goal wasn’t to create a complex system — but a simple, reliable, and transparent bot that anyone can understand. This project helped me sharpen my Python fundamentals, improve my debugging discipline, and design a structure that scales. Excited to keep improving it with strategies, risk checks, and backtesting. - Drafted with the help from Copilot. #Python #TradingBot #AlgorithmicTrading #PythonProjects #Automation #APIDevelopment #CodingJourney #LearningInPublic GIT hub link for code: https://lnkd.in/d_cCwG-r

🚀 Mastering the art of loops! 🔄 Discover how loops help your code execute repetitive tasks efficiently. Essentially, loops are like a magical chant that tells your program to keep doing something until a certain condition is met. For developers, mastering loops is crucial for automating tasks and iterating over data structures with ease. Here's the breakdown: 1️⃣ Initialize a counter variable 2️⃣ Set the condition for the loop 3️⃣ Define the action to perform in each iteration Sample code using a "for" loop in Python: ``` for i in range(5): print("Hello, World!") ``` 🌟 Pro Tip: Use loops to reduce redundancy in your code and boost efficiency. 💡 ⚠️ Common Mistake: Forgetting to update the counter variable in the loop, leading to an infinite loop! 🔄 🌟 What's your favorite use case for loops in your projects? Let's discuss! 💬 #Coding101 #LearnToCode #TechTips #CodeNewbie #PythonProgramming #DeveloperCommunity #LoopLogic #CodeEfficiency #ProDevSkills 🌐 View my full portfolio and more dev resources at tharindunipun.lk

🚀 Day 42 of My LeetCode Journey Today’s problem: Regular Expression Matching This wasn’t just another coding problem — it forced me to think in terms of state transitions and decision trees, not brute force. 🔍 Key Learning: - Pure recursion is not enough → leads to exponential time - Introduced Dynamic Programming (Top-Down with Memoization) - Learned how to break the problem into: - Matching current characters - Handling "*" (zero or more occurrences) 🧠 Core Insight: Instead of trying all possibilities blindly, cache results of subproblems → avoids recomputation. ⚡ Result: - Runtime: 1 ms (Beats 99.99%) - Efficient DP solution with optimal pruning 💡 Takeaway: Hard problems aren’t about syntax — they’re about modeling the problem correctly. #Day42 #LeetCode #DataStructures #DynamicProgramming #Java #CodingJourney

🚀 Day 21 of Consistency | #75DaysLeetCodeChallenge 🧠 Today’s Problem : Evaluate Reverse Polish Notation (#150) 💡 Key Learning: This problem strengthens understanding of stack-based expression evaluation, especially for postfix (Reverse Polish) notation. ⚡ Approach: Use a stack to store operands Traverse tokens → If number → push to stack If operator → pop two elements → apply operation → push result back Final result will be at top of stack 🧠 Why this works: Postfix expressions eliminate need for parentheses Stack ensures correct order of operations Efficient evaluation → O(n) time 🔥 Result : ✔️ Runtime: 0 ms (Beats 100%) 📈 A classic stack problem that builds strong foundation for expression parsing & evaluators. A big thanks to Shivam Singh, Nikhil Yadav & Akshat Tiwari for this amazing challenge 🙌 Consistency is compounding. Keep going. 💪 #Day21 #LeetCode #DSA #CodingJourney #100DaysOfCode #Python #Stack #Consistency

𝗜𝘁 𝘀𝘁𝗮𝗿𝘁𝘀 𝘄𝗶𝘁𝗵 𝗮 𝗻𝗼𝗯𝗹𝗲 𝗶𝗻𝘁𝗲𝗻𝘁𝗶𝗼𝗻: "𝗜 𝗮𝗺 𝗴𝗼𝗶𝗻𝗴 𝘁𝗼 𝘀𝗮𝘃𝗲 𝘁𝗶𝗺𝗲." It ends with you debugging a Python script at 2 AM for a process that you could have finished by hand before lunch. Engineers love to solve problems with code. But sometimes, code is the most expensive solution. Here is the math on why "𝗔𝘂𝘁𝗼𝗺𝗮𝘁𝗶𝗻𝗴 𝗘𝘃𝗲𝗿𝘆𝘁𝗵𝗶𝗻𝗴" is actually hurting your productivity. 𝗥𝗲𝗴𝗶𝘀𝘁𝗲𝗿 𝗻𝗼𝘄 : https://lnkd.in/dkVrmCHc #DeveloperLife #Automation #Productivity #IndieHacker #Engineering #TheVentureBuild

🚀 Day 54 of My LeetCode Journey 🔍 Problem: Find the Index of the First Occurrence in a String Today’s problem focused on searching for a substring inside a string — a very common concept in interviews and real-world applications like text processing and search engines. 💡 Key Idea: We compare the substring (needle) with every possible starting position in the main string (haystack) until we find a match. 🧠 What I Learned: How string matching works internally Importance of boundary conditions (like empty strings) Difference between brute-force and optimized approaches Why built-in methods like indexOf() are efficient ⚡ Approaches: Using built-in method (indexOf) – simple and efficient Manual iteration (brute force) – helps understand logic deeply 📈 Time Complexity: O(n * m) for brute-force approach 🔥 Takeaway: Even simple problems can teach core fundamentals. Mastering these basics builds a strong foundation for advanced algorithms like KMP. #Day54 #LeetCode #Java #DataStructures #CodingJourney #Programming #InterviewPreparation