Reverse Vowels in String with Python

Day 3 / 100 🚀 Solved “Reverse Integer” — a problem that looks simple but actually tests how carefully you handle edge cases. At first, reversing digits feels straightforward. But the real challenge is handling 32-bit overflow without using extra space. 💡 Key learning: Before updating the result, always check if multiplying by 10 will exceed the allowed range. Core idea: rev * 10 + digit must stay within [-2³¹, 2³¹ - 1] Highlights: • Time Complexity: O(log n) • Space Complexity: O(1) • Correctly handles negative numbers and overflow This problem reinforced a critical habit: Don’t just make the logic work — validate boundary conditions. #100DaysOfCode #LeetCode #DSA #Python #ProblemSolving #CodingInterview

🧩 DSA Breakdown: Insert Interval One of those problems that looks scary at first, but once you see the pattern — it clicks instantly. The problem: Given a sorted list of non-overlapping intervals, insert a new interval and merge if needed. The trick? Just think in 3 phases: 1️⃣ Add all intervals that END before the new one starts → no overlap, safe to add 2️⃣ MERGE all intervals that overlap → keep expanding the new interval's boundaries 3️⃣ Add everything remaining → they start after the new interval ends ✅ Time: O(n) — single pass ✅ Space: O(n) Currently grinding DSA one problem at a time 💪 If you're on the same journey, let's connect! #DSA #CodingInterview #Python #LeetCode #Programming #100DaysOfCode

🔍 Problem Solving | LeetCode 1342 Today’s problem focuses on a simple yet fundamental concept: reducing a number to zero using minimal steps. 📌 Approach: If the number is even → divide by 2 If the number is odd → subtract 1 Repeat until the number becomes zero 💡 This problem helps strengthen understanding of: ✔️ Conditional logic ✔️ Looping constructs ✔️ Bit manipulation basics 📊 Example: Input: 14 Output: 6 steps 🚀 Consistency in solving such problems builds a strong foundation for advanced algorithms. #LeetCode #DSA #ProblemSolving #CodingJourney #SoftwareDevelopment #Python #InterviewPreparation

Check out my latest project: an automated system that applies Modern Portfolio Theory with a focus on statistical "de-noising". By utilizing Principal Component Analysis, the system filters out market noise to create a more stable, theoretically efficient covariance matrix. Key Highlights: -Automated Execution: The pipeline runs weekly via GitHub Actions and executes trades through the Alpaca API. -Algorithmic De-noising: Uses Random Matrix Theory to identify significant factors. -Transparency: Automatically generates and emails a performance report with visualizations and backtesting metrics. Check out the full report and Python implementation on GitHub: https://lnkd.in/eWSyd2pi #QuantFinance #Python #AlgorithmicTrading #FinTech

🚀 𝗗𝗮𝘆 𝟮𝟴/𝟯𝟬 — 𝗗𝗦𝗔 𝗖𝗵𝗮𝗹𝗹𝗲𝗻𝗴𝗲 Day 28 and today was all about revisiting and strengthening the tougher concepts from the past few days. Instead of jumping into new topics, I focused on reinforcing dynamic programming and graph patterns — going back to problems that felt challenging and solving them again with a clearer approach. 🔎 𝗗𝗮𝘆 𝟮𝟴 𝗙𝗼𝗰𝘂𝘀 • Revisiting dynamic programming patterns • Strengthening problem-solving without relying on hints • Re-solved selected problems from recent topics It’s interesting to see how problems that felt complex earlier start to make more sense with repetition. That’s probably the biggest lesson from this challenge so far. Almost there. On to Day 29 #DSA #Python #LeetCode #SoftwareEngineering #ProblemSolving #Consistency

Day 6/100 – #100DaysOfCode Solved the problem “Remove Element”, focusing on in-place array manipulation. Problem Summary: Remove all occurrences of a given value from an array without using extra space, and return the count of remaining elements. Approach: Used a two-pointer technique to efficiently overwrite unwanted elements while iterating through the array. Complexity: • Time: O(n) • Space: O(1) Key Insight: Efficient problem solving is not always about removing data — sometimes it's about rearranging it smartly in-place. Consistent progress > perfection. On to Day 7 #100DaysOfCode #Day6 #DSA #Python #LeetCode #ProblemSolving #CodingJourney

🚀 Day 7 – LeetCode Journey Today’s problem: String to Integer (atoi) This one really tested my understanding of edge cases and string parsing. Not just coding, but thinking like a machine step-by-step 👇 ✅ Ignored leading whitespaces ✅ Handled positive & negative signs ✅ Extracted numbers until non-digit appears ✅ Managed overflow within 32-bit integer range At first, it looked simple… but the edge cases made it interesting 😅 💡 Key Learning: Writing code is one thing, but handling all possible inputs correctly is what truly matters in real-world problems. Slowly getting better at breaking down problems and building clean logic 💻🔥 On to Day 8… 🚀 #Day7 #LeetCode #CodingJourney #Python #ProblemSolving #Consistency #LearningEveryday

#Duck_Typing A traditional idea says: “The king’s son will become the next king.” A more modern interpretation would be: “The one who is capable will become the king.” This transition from identity-based selection to capability-based evaluation loosely resembles Python’s duck typing. In duck typing, an object’s suitability is determined not by its type, but by its behavior. If an object implements the required methods, it can be used — regardless of its class hierarchy. However, it is important to avoid overextending this analogy. Duck typing does not imply merit-based selection or optimization. It simply enables flexibility by accepting any object that satisfies the expected interface. This distinction is critical. #Python #SoftwareEngineering #Programming #Coding #TechConcepts #CleanCode #SoftwareDesign #LearnToCode #DeveloperMindset #TechLearning

🚀 Solved LeetCode Problem #15 – 3Sum A classic problem that tests understanding of arrays and two-pointer techniques. 💡 Key Concept: Sorting + Two Pointer approach to find triplets efficiently without duplicates. 🔍 What I learned: - Handling duplicates carefully - Using sorting to simplify problems - Two-pointer technique for optimized solutions 🔥 Challenges like this improve logical thinking and coding efficiency. #Python #DSA #LeetCode #Coding #Algorithms #ProblemSolving

60 Days of Problem Solving Challenge - Day 25 👉 Today’s Problem: Generate IP Addresses The task was to generate all possible valid IP addresses from a string of digits. A valid IP must have four segments (A.B.C.D), where each segment ranges from 0 - 255 and cannot have leading zeros unless the segment itself is 0. 💡 Approach / Logic: Used a Backtracking (DFS) approach. Try forming segments of length 1 to 3 digits. Validate each segment: ✔ Value must be between 0 and 255 ✔ Avoid leading zeros like "01" or "00" Once 4 valid segments are formed and all digits are used, combine them with "." to form a valid IP address. This problem was a great exercise in recursion, constraint validation, and systematic exploration of possibilities. 📈 Progress so far: 🔥 Current Streak: 25 Days 🎯 Goal: 60 Days of Consistent Problem Solving #60DaysOfCode #GeeksforGeeks #ProblemSolving #Python #DSA #CodingChallenge #Consistency #LearningJourney