Daily LeetCode Habit Builds Deep Understanding

LeetCode Day 5 : Problem 121 (Best Time to Buy and Sell Stock) Just solved another LeetCode problem. It was "Best Time to Buy and Sell Stock", sounds like a finance problem, right? But here's what I actually learned: My first solution checked every possible buy and sell pair using a nested loop. It gave the correct answer but was O(n²), on a large array with 100,000 prices that's 10 billion comparisons. LeetCode would have thrown a Time Limit Exceeded. The fix? One pass. Track the minimum price seen so far as you move forward. At each day just ask, if I sell today, what's my profit? Update the max profit if it's better. That's it. O(n) time, O(1) space. The insight that made it click, you never need to look back. The best buy point is always the lowest price you've seen so far. So just keep track of it as you go. Seven problems in. The lesson keeps showing up, if you have a nested loop, there is almost always a one pass solution hiding somewhere. The real lesson? Don't just solve the problem. Ask yourself if you can do it in one pass. #DSA #LeetCode #JavaScript #CodingJourney #Programming

If you search for “Leetcode in Assembly” you will find my article that I wrote in Medium. This is how much I was obsessed getting better at Leetcode. If you had told me then that no one would be coding anymore in 2ish years anymore, I would laugh at you hard. How times have changed.

🔥 Most people skip the “easy” problems… I don’t. 📅 Day 40 of my LeetCode streak ⚡ Total active days: 47 Today’s problem: LeetCode 1995 – Count Special Quadruplets At first glance, it looks simple. But the real game is in how you approach it. 💡 My Approach (Brute Force – but intentional): I used 4 nested loops to check every possible combination (a, b, c, d) such that: nums[a] + nums[b] + nums[c] == nums[d] Yes, it’s an O(n⁴) solution. Yes, it’s not optimal. But here’s the point most people miss 👇 👉 I intentionally start with brute force. Because: It builds clear understanding of constraints. It ensures correctness before optimization. It trains your brain to see patterns for improvement later. 🚀 Many jump directly to optimized solutions without understanding the base logic — and that’s where growth slows down. 💭 Next Step: This problem can definitely be optimized using hashing or better approaches. That’s where I’ll head next. 📌 Key takeaway: Don’t just chase optimization. First, master the logic. Then refine it. 🔗 Problem Link: https://lnkd.in/didArNbk Consistency > Perfection. #LeetCode #Day40 #CodingJourney #ProblemSolving #DSA #Algorithms #Programming #CodeNewbie #TechGrowth #InterviewPrep #LearningInPublic #Consistency #CPlusPlus

🚀 200 problems on LeetCode — but the real growth isn’t just a number. Somewhere along the journey, my approach changed. I stopped asking: ❌ “How do I solve this problem?” And started asking: ✅ “Why does this approach work?” ✅ “What pattern is behind this?” ✅ “Where else can I apply this?” That shift made all the difference. 📈 What I’ve built so far: ✔ Stronger problem-solving mindset ✔ Better understanding of data structures ✔ Pattern recognition across problems ✔ More structured debugging approach Now, I don’t just solve problems — I understand them. Still learning. Still improving. But now with clarity and direction. #LeetCode #DSA #ProblemSolving #CodingJourney #Java

I've been building full-stack apps for a while now. But I realized something. I was skipping the fundamentals. So I stopped. And I started DSA from scratch. Here's my exact plan: 🗓 Platform: LeetCode 📌 Goal: 3–5 problems every single day 📚 Topic order:  → Arrays & Strings  → Hashing  → Two Pointers & Sliding Window  → Linked Lists  → Stacks & Queues  → Recursion & Backtracking  → Binary Search  → Trees  → Graphs  → Dynamic Programming I know the basics. My weak spot is patterns recognizing WHICH technique to use and WHEN. So my focus isn't just solving problems. It's understanding the pattern behind each problem. I'll be posting my progress every day for 30 days. The wins. The struggles. All of it. If you're on the same journey. let's connect. 🤝 #DSA #LeetCode #100DaysOfCode #developer #competitiveprogramming

Personal Software Development Tools Empower Non-Programmers to Build Apps 📌 Non-programmers can now build custom apps with personal software, thanks to Samuel Girardin’s “The Makers” framework. Designed for rapid, low-friction development, it empowers users to solve niche problems without enterprise complexity. By leveraging Python, Vue.js, and modular tools, this movement turns digital creation into a personal, autonomous workflow-democratizing tech in powerful new ways. 🔗 Read more: https://lnkd.in/djABwydX #Mediumpublication #Developerframework #Nonprogrammertools #Customappbuilding #Samuelgirardin

🚀 Day 7 of LeetCode Problem Solving Solved today’s problem — LeetCode #414: Third Maximum Number 💻🔥 ✅ Approach: Tracking Top 3 Maximums ⚡ Time Complexity: O(n) 📊 Space Complexity: O(1) The challenge was to find the third distinct maximum number in an array. If it doesn’t exist, return the maximum number. 👉 Instead of sorting (which takes extra time), I tracked the top 3 distinct maximum values in a single pass. 💡 Key Idea: Maintain three variables (max, smax, tmax) to store the first, second, and third maximum values while traversing the array. 👉 Core Logic: Skip duplicates Update max, second max, third max accordingly If third max doesn’t exist → return max 💡 Key Learning: Optimizing from sorting to a single-pass solution can significantly improve efficiency. Grateful to my mentor Pulkit Aggarwal — your guidance is helping me think more optimally 🙌 Consistency is the key — improving step by step 🚀 #Day7 #LeetCode #DSA #Java #CodingJourney #ProblemSolving #100DaysOfCode

👩🏾💻 | 𝐀 𝐌𝐈𝐗 𝐎𝐅 𝐈𝐌𝐏𝐎𝐒𝐓𝐄𝐑 𝐒𝐘𝐍𝐃𝐑𝐎𝐌𝐄 𝐀𝐍𝐃 "𝐓𝐇𝐄 𝐓𝐈𝐒𝐌𝐒" I’ve realized that being in dev is basically just alternating between: 1. "I am a literal genius for fixing this semicolon." 2. "I have no idea what I’m doing and the police are coming to arrest me for fraud." There is literally no in-between for me. Let’s be honest, you have to be a little bit "different" to stare at a screen for 8 hours trying to talk to a rock that humans tricked into thinking (a computer). Whether it’s the hyper-focus, the sensory issues with loud keyboards, or just having a "tism" for specific logic patterns. Tech is where our quirks become our superpowers (or at least that’s what I’m trying to convince myself of). This is how I think one should be tackling the Imposter Syndrome: • 🧱 Dumbed-down-coding: If you can explain it to a 5-year-old, you clearly know it. • 📝 The "Win" Log: Writing down every time you didn't cry over a Java error. • 🤝🏽 Community: Realizing your peers are just as confused as I am. With that I’ll say…. We aren't crazy, we’re just compiled differently. 💻✨ #StudentDeveloper #DevRel #Neurotech #TechHumor #Wethinkcode

Day 14 of #50DaysOfLeetCode Challenge Today’s coding challenge was Rotate List (LeetCode 61). The goal is to rotate a linked list to the right by k places. At first, it sounds like you need to move nodes one by one, but that’s inefficient. The key to a high-performance solution is to treat the list like a loop! The Efficiency Strategy: 1. Calculate Length: First, find the total length of the list (n). 2. Handle Large K: If k is larger than n, we only need to rotate k % n times. This avoids unnecessary cycles. 3. Make it a Circle: Connect the last node's "next" pointer to the original head to create a temporary circular list. 4. Find the New Break: Move (n - (k % n)) steps from the head to find the new tail of the rotated list. 5.Break the Loop: Save the node after the new tail as the new head, and then set the new tail's "next" to null. #LeetCode #BitManipulation #Java #Coding #Efficiency #TechLearning

What is the essence of learning how to code then? Flashback. A few weeks ago, I was working on a personal project, FlagOps. I paused it for a while because I got busy with something I can’t share yet. Two days ago, I was solving a challenge on HackerRank, a code review feedback task. I needed to implement an increment function across five different sections. Writing the same function five times didn’t make sense. I tried to be smart about it. I created a single function that accepted the state and setState. That backfired. It introduced unnecessary re-renders and React started throwing errors. The issue wasn’t obvious at first, but it came down to how I was handling state and how the function kept changing on every render. I removed the direct state dependency and switched to using prev instead. Then I wrapped the function with useCallback to stabilize it. That fixed it. One function, no duplication, no unnecessary re-renders. This is where learning comes in. That thing you read, that course you took, that random doc you went through, it might not click immediately. But when you hit a real problem, your brain pulls from what you already know. Even with something like the React Compiler handling optimizations, if your fundamentals are off, it won’t save you. That’s the point. Keep learning. #frontendengineer #softwareengineer #learningtocode #scalablecode