Solving Permutation in String Problem with Brute Force and Optimized Approaches

DevLog Day 46 Today I finally conquered a problem that had beaten me before. Redemption days hit different. The problem was Sort Colors on LeetCode, a medium level question where you are given an array containing only 0s, 1s, and 2s representing colors, and you need to sort it in place in a single pass. No built in sort, no multiple iterations. The brute force is straightforward, you could use a built in sort function or classic algorithms like bubble sort or insertion sort, but the single pass constraint rules all of that out. My solution used counting sort. Since we only ever have three possible values, I used a fixed size array to count the frequency of 0s, 1s, and 2s, then overwrote the original array using those counts. Because the frequency array never grows beyond 3 elements regardless of input size, the space stays constant. There is something satisfying about coming back to a problem that once stumped you and seeing it clearly this time. It is proof that the reps are adding up even when it does not feel like it in the moment. #100DaysOfCode #LeetCode #NeetCode #DataStructures #Arrays #CodingJourney #ProblemSolving #Programming #SoftwareEngineering #Tech

DevLog Day 45 Today was a revisit day. Sometimes you need to go back to the basics and there is nothing wrong with that. The problem was Remove Element. You are given an array and a value, and you need to remove all occurrences of that value in place and return the length of the resulting array. No extra space, just you and the array. It is one of those problems that looks almost too simple on the surface but it is a great exercise in thinking about in place operations and pointer manipulation. Going back to a problem you have already seen hits differently the second time around because you start noticing the patterns you missed before and connecting them to harder problems you have solved since. #100DaysOfCode #LeetCode #NeetCode #DataStructures #Arrays #CodingJourney #ProblemSolving #Programming #SoftwareEngineering #Tech

Day 56 of solving LeetCode. Today’s problem: Count Primes Result: Accepted ✔️ (66/66 test cases) Performance: • Runtime: 96 ms (beats 75.25%) • Memory: 51.26 MB Key takeaway: Brute force thinking doesn’t scale. The real shift is recognizing patterns like the Sieve of Eratosthenes — precompute smartly instead of checking repeatedly. Most people stay stuck trying to optimize loops. The smarter move is changing the approach entirely. Consistency > motivation. 56 days in. No breaks. No excuses. ∆ #LeetCode #CodingJourney #DSA #Programming #ProblemSolving #100DaysOfCode #DeveloperLife #CodingDaily #Algorithms #Consistency #GrowthMindset

🚀 Day 7 of My LeetCode Journey Today’s problem: Reverse Integer At first glance, it looks simple — just reverse digits. But the real challenge was handling 32-bit integer overflow without using 64-bit storage. 🔍 What I learned: How to extract digits using modulo (%) Building the reversed number step by step Most importantly, checking overflow before updating the result ⚠️ Edge Case: If the reversed number goes beyond the 32-bit range [-2³¹, 2³¹ - 1], we must return 0 💡 Example: Input: 123 → Output: 321 Input: -123 → Output: -321 Input: 1534236469 → Output: 0 (Overflow case) Consistency over perfection 💪 #Day7 #LeetCode #DSA #CProgramming #CodingJourney #ProblemSolving

Every great programmer starts with the basics. Diving deep into Singly Linked Lists — understanding how nodes connect, how memory is managed dynamically, and how operations like insertion and deletion actually work behind the scenes. It’s not just about code, it’s about building logic. awareness of hardware-level behavior like cache alignment and data locality. #Multithreading #Concurrency #Programming #SoftwareEngineering #BackendDevelopment #CPP #CppProgramming #ModernCPP #Multithreading #Concurrency #ParallelProgramming #STL #SystemProgramming #SoftwareEngineering #CodingLife #DSA #Coding #LinkedList #TechLearning #ProgrammerMindset

Ever look at a LeetCode problem and think, "Oh, this is just simple math," only to see a constraint of $10^{15}$ staring back at you? That was my experience with the "Count Good Numbers" problem today. The core logic was actually pretty straightforward: even indices get even digits (5 options), and odd indices get prime digits (4 options). But trying to calculate 5^even * 4^odd for massive numbers? Immediate Time Limit Exceeded (TLE). I had to scrap the standard approach and write a custom pow() function using Binary Exponentiation. It’s wild how applying modulo 10^9 + 7 at every single multiplication step within the recursive call is the exact difference between a failing solution and a clean O(log n) pass without integer overflow. Definitely a great reminder that knowing the brute-force math is only half the battle—optimizing it is where the real engineering happens. Back to the grind! #LeetCode #DSA #CPP #CompetitiveProgramming #SoftwareEngineering #CodingJourney

Ever faced a memory leak… in code or in life? 😂 Post: In C, forgetting to free() memory leads to leaks. In life, forgetting to “let go” does the same. 🔹 Deleted the node 🔹 But memory still occupied That’s not just a bug… that’s emotional engineering 😄 👉 Lesson: Always clean up your pointers (and your past) #CProgramming #LinkedList #MemoryLeak #CodingHumor #SoftwareEngineering #EmbeddedSystems #DebuggingLife #TechMemes #ProgrammerLife

Stop memorizing Rust rules. Start deriving them. 🦀 This free interactive course reframes the borrow checker not as a set of rules to memorize, but as the logical outcome of three primitives: Space, Time, and Coordinates. 📐 Every memory bug is just a failure in one of these three dimensions: 🔸 Use-after-free 🔸 Dangling pointer 🔸 Data race 🔍 Understand the framework, and the compiler's behavior clicks into place. ✅ 💡 Highly recommended for experienced devs, especially those with a C/C++ background. 👇 https://lnkd.in/gAsQvjhv #Rust #RustLang #Programming #SystemsProgramming #SoftwareEngineering

🚀 Testing your C fundamentals! Can you predict the output of this nested loop? for(int i = 1; i <= 3; i++) { for(int j = 1; j <= 2; j++) { printf("%d%d ", i, j); } } Drop your answer in the comments 👇 #CProgramming #EmbeddedSystems #CodingChallenge #Loops #LearningInPublic

LCA - Lowest Common Ancestor of binary tree Approach: If current node is null, return null If current node is p or q, return current node Recursively search left and right If both sides return non-null → current node is LCA Otherwise → return the non-null side TC = O(n) SC = O(h) - depends on tree height (recursion stack) O(logn) - balanced tree O(n) - skewed tree #dsa #leetcode #consistency #coding #programming