Day 95 Greedy + mapping makes things simple. #Day95 🧩 763. Partition Labels Key idea: • First, map each character to its last occurrence index • Iterate through the string and keep updating the current partition end • When the current index reaches the end → cut the partition What clicked today: It’s about tracking the maximum boundary of characters seen so far. Once all characters in the current segment are covered, you safely split. Simple logic, but powerful pattern. #LeetCode #DSA #Python #Greedy #HashMap #LearningInPublic #Consistency

🚀 Day 32 – LeetCode Journey Today’s problem: Reverse String II ✔️ Implemented in-place string reversal using two pointers ✔️ Efficiently processed the string in chunks of 2k ✔️ Optimized approach with minimal extra space 💡 Key Insight: Instead of reversing the entire string, we only reverse the first k characters in every 2k block. Using the two-pointer technique makes this both simple and efficient. This problem strengthened my understanding of string manipulation, indexing, and in-place operations. Step by step, becoming a better problem solver 🔥💪 #LeetCode #Day32 #Strings #TwoPointers #Python #ProblemSolving #CodingJourney #100DaysOfCode

Day 37 & 38 complete! 🚀 Finding Minimum and Maximum in an Array: Practiced single-pass iterations to identify the extreme values in a dataset, focusing on minimizing comparisons. Count Each Vowel in a String: Used a dictionary to map and count the frequency of vowels. This was great practice for handling case sensitivity and string traversal. First Unique Character in a String: Implemented a two-pass approach—first using a Hash Map to store character frequencies, and then iterating to find the first character with a count of one. Sometimes going back to the basics is the best way to ensure your logic is bulletproof! 📈 #100DaysOfCode #Python #DSA #LeetCode #ProblemSolving

Day 55 of #GeekStreak60 🚀 Today’s problem was simple yet essential — removing spaces from a string. 🧠 Core Idea Clean the string by eliminating all whitespace. 💡 What I Did → Used Python’s built-in replace() method → Replaced all spaces with an empty string for a clean result 📚 What I Learned Even the simplest problems strengthen fundamentals and highlight how powerful built-in functions can make code clean, readable, and efficient ✨ ✅ Day 55 complete Consistency > Complexity 💪 #GeekStreak60 #GeeksforGeeks #NPCI #Day55 #ProblemSolving #Python #CodingJourney

🚀 LeetCode Progress Update – Problem Solved! ✅ Problem: Remove Trailing Zeros From a String 💡 Approach: Used reverse traversal to find the first non-zero digit and sliced the string accordingly. 🔍 Key Learning: Efficient string manipulation can avoid unnecessary conversions. Traversing from the end helps solve trailing-based problems quickly. 💻 Code Insight: Instead of removing zeros one by one, I identified the breakpoint and sliced the string — making it optimal and clean. ⏱️ Performance: Runtime: 3 ms ⚡ Beat: 66%+ users Memory: 19.23 MB 📈 Consistency is key — one problem closer to mastery! #LeetCode #CodingJourney #Python #ProblemSolving #DSA #100DaysOfCode

I dont think one needs to participate in hackathons in order to "build" something quickly, leveraging on python and ollama model, I got a quick Nominal Roll tweaker up and running (of coz using all fake generated data as a base), with the ability to toggle on and off the guardrails to help refine what the LLM can do, and how much to tighten on the guardrails so that its still useful.

🚀 Solved today’s GeeksforGeeks Problem of the Day: Intersection of Two Sorted Arrays using Python 🐍 Problem: Find the distinct common elements between two sorted arrays. Approach: Used the efficient Two Pointer Technique 👇 ✔ Traverse both arrays simultaneously ✔ Compare elements and move pointers accordingly ✔ Skip duplicates to ensure unique results 💡 Key Insight: Since arrays are already sorted, we can avoid extra data structures and solve it in O(n + m) time. 💡 Concepts Used: Two Pointers | Arrays | Duplicate Handling This problem is a great example of how understanding input properties (sorted arrays) can drastically optimize your solution 🚀 #geekstreak60 #geeksforgeeks #dsa #python #coding #problemSolving #arrays #twopointers

📌 Problem: Merge Strings Alternately 💡 Approach: Used a simple two-pointer / iteration technique to merge both strings character by character. First, iterate up to the minimum length of both strings and append alternately. Then, append the remaining characters from the longer string. ⚙️ Key Insight: Handle unequal string lengths separately Avoid index out-of-bounds by iterating till min(len(word1), len(word2)) ⏱️ Time Complexity: O(n + m) 📦 Space Complexity: O(n + m) merg 📚 What I learned: String manipulation efficiently Handling edge cases when lengths differ #LeetCode #DSA #Coding #ProblemSolving #Python #SoftwareDevelopment #CodingJourney

🚀 Day 41 – LeetCode Journey Today’s problem: Add Binary ✔️ Implemented binary addition manually ✔️ Handled carry propagation efficiently ✔️ Worked with string manipulation and indexing 💡 Key Insight: Binary addition follows the same rules as decimal addition, but with base 2. Managing the carry correctly is the key to building the final result. This problem improved my understanding of bit-level operations and string handling. Step by step, mastering the fundamentals 🔥💪 #LeetCode #Day41 #Binary #Strings #Python #ProblemSolving #CodingJourney #100DaysOfCode

🚀 Day 48 – LeetCode Journey Today’s challenge: Substring with Concatenation of All Words ✔️ Solved using sliding window + hashmap ✔️ Processed string in fixed-length chunks ✔️ Tracked word frequency efficiently 💡 Key Insight: Instead of checking every substring blindly, splitting the string into word-sized pieces and using a hashmap helps validate matches efficiently. Sliding window keeps the solution optimized. This problem was a great exercise in string manipulation, hashing, and window techniques 🧠 Consistency is the real game changer 🚀 #LeetCode #Day48 #SlidingWindow #HashMap #Strings #Python #ProblemSolving #CodingJourney #100DaysOfCode https://lnkd.in/gxf4RBT6