Cracking LeetCode with Simple Problem-Solving Mindset

Just solved “First Matching Character From Both Ends” 🚀 💡 My approach (simple & efficient): Instead of overcomplicating it, I used a two-pointer mindset without explicitly creating two pointers. Loop through the string from the start For each index i, compare: s[i] (from the front) s[n - i - 1] (from the back) The moment both match → return the index If no match → return -1 ✨ This works because we're checking symmetry from both ends in a single pass (O(n)) with O(1) space. Sometimes the best solutions aren’t fancy — they’re just clean and intuitive. 🔥 Consistency > Complexity. Small wins like this build strong problem-solving instincts. #LeetCode #DSA #Python #CodingJourney #ProblemSolving #TechGrowth #CodeDaily #WomenInTech #FutureEngineer #100DaysOfCode #KeepBuilding

🚀 Day 2 – Strengthening My Problem-Solving Mindset Quick reality check 👇 It’s not about how many languages you know… It’s about how well you can think and solve. 📌 Today’s Problem: Multiplication Table Sounds basic, but I approached it with a learning mindset. 🔹 Two Approaches Explored 1️⃣ Iterative Approach (For Loop) 2️⃣ Recursive Approach (Function Calling Itself) 💡 Key Takeaway Same problem. Two approaches. Different ways of thinking. ✔️ Learned how loops execute line by line ✔️ Understood how recursion builds logic internally 📈 Progress Update: From just coding → to understanding how code works Consistency is the real game. #Python #ProblemSolving #100DaysOfCode #Recursion #LearningJourney #DeveloperGrowth

🚀 Day 1 — Building Problem Solving Skills I’m continuing my journey to improve problem-solving skills by staying consistent, disciplined, and accountable — one problem at a time. 🧩 Problem: • Two Sum (LeetCode #1) 📚 Topic: Arrays (Pair Traversal) 💡 Key Insight: Checking all possible pairs works, but it highlights the need for more efficient approaches as input size grows. ⚡ Approach: • Pick an element using index i • Traverse remaining elements using index j • Check if nums[i] + nums[j] == target • Return indices when condition is satisfied 🎯 Takeaway: Even simple problems help strengthen logic and introduce optimization thinking. ⏱ Complexity: Time → O(n²) Space → O(1) 💻 Sample Input: nums = [2, 7, 11, 15] target = 9 ✅ Output: [0, 1] Consistency > Perfection 💪 #DSA #LeetCode #ProblemSolving #Python #CodingJourney #LearningInPublic #Arrays #TechGrowth

💻 Solved a great problem today: Count Increasing Subarrays 🚀 Given an array, the task was to count all strictly increasing subarrays of size ≥ 2. 🔍 Approach I used: Broke the array into continuous increasing segments For each segment of length k, calculated subarrays using the formula: 👉 k(k-1)/2 Summed all results to get the final answer ⚡ Time Complexity: O(n) 📦 Space Complexity: O(n) 💡 This problem helped me understand how breaking a problem into patterns can simplify complex logic. Here’s my Python solution 👇 class Solution: def countIncreasing(self, arr): list2 = [] list2.append(arr[0]) list3 = [] for i in range(1, len(arr)): if arr[i-1] < arr[i] and arr[i] > 2: list2.append(arr[i]) else: list3.append(list2) list2 = [] list2.append(arr[i]) list3.append(list2) ans = 0 for i in list3: if len(i) > 1: ans += (len(i) * (len(i) - 1)) // 2 return ans 🔥 Always learning, always improving. #python #dsa #coding #problemSolving #programming #developers #learning

Just deployed my first project. Then got stuck for 2 hours on a beginner HackerRank task. The task was simple — identify a leap year. That's it. I was writing code for a question I hadn't completely understood. That's where the 2 hours went. I took help of an AI assistant — but with one rule: no direct solutions, only directions. It pushed me to think, not copy. Two lessons I'm carrying forward: 1. Understand the task completely before writing a single line of code. 2. Know the solution in logic before you know it in code. Basics hit different when you learn them the hard way. Have you ever got stuck on something simple? What was your lesson? #Python #HackerRank #BuildInPublic #AIEngineering

Just solved “Reverse Words in a String” — and this time, I focused less on just getting it accepted and more on how clean and efficient my thinking is. 💡 My approach: Broke the problem into 3 simple steps: split → reverse → join Avoided manual looping once I realized Python already gives optimized built-ins Switched from constructing strings step-by-step (costly ⚠️) to using join() for better performance Used reversed() to keep the solution clean and readable ✨ Key learning: Sometimes optimization isn’t about writing more logic — it’s about writing less, but smarter. Leveraging built-in functions can significantly improve both readability and efficiency. 📈 Result: Runtime: 0 ms Cleaner code ✔️ Better understanding ✔️ Still learning, still improving — one problem at a time 🚀 #LeetCode #Python #DataStructures #CodingJourney #ProblemSolving #100DaysOfCode #TechGrowth #CodeOptimization #LearningInPublic #FutureEngineer #WomenInTech #ConsistencyWins

🚀 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

Shipping a discussion guide is just the beginning. Running the sessions can sometimes reveal thin findings, often due to overlooked details. Introducing qual-sniffer, a Python CLI designed to review your discussion guides before you run them. This tool: 1. Flags leading questions, embedded assumptions, and double-barreled questions. 2. Catches yes/no questions that may cut participant responses short. 3. Checks for a warm-up, adequate follow-up probes, and ensures no sensitive topics are present in the first three questions. 4. Returns a score from 0 to 100, along with a letter grade and fix suggestions for any identified issues. Qual-sniffer works without requiring an API key and offers an optional LLM summary for a written critique. This is tool #3 of 40 in my CPR Orbital series, providing at least one open-source research tool every week throughout 2026. #UXResearch #ComputationalProductResearch #OpenSource #QualitativeResearch #AIForResearch (GitHub link in first comment)

🚀 Day 28 of Problem Solving Journey Today, I worked on an interesting problem: Group Anagrams 🔍 Problem Statement: Given an array of strings, group the anagrams together. Anagrams are words that have the same characters but arranged differently. 💡 Approaches I explored: ✅ Approach 1: Character Frequency Count (Optimized) Used a fixed-size array (26 letters) to count character occurrences Converted the count into a tuple to use as a dictionary key Achieved an efficient time complexity of O(n * k) ✅ Approach 2: Sorting Strings Sorted each string and used it as a key Simple and intuitive approach Time complexity: O(n * k log k) 📌 Key Learning: Understanding how hashing works with different representations (frequency vs sorted string) helps in optimizing solutions. ⚡ Takeaway: There are always multiple ways to solve a problem, but choosing the most efficient one makes a difference in real-world applications and interviews. 💻 Tech Used: Python | HashMap | Arrays #Day28 #ProblemSolving #Python #DataStructures #Algorithms #CodingJourney #100DaysOfCode

𝗜 𝗧𝗵𝗼𝘂𝗴𝗵𝘁 𝗞𝗻𝗼𝘄𝗶𝗻𝗴 𝗦𝘆𝗻𝘁𝗮𝘅 𝗠𝗲𝗮𝗻𝘁 𝗜 𝗖𝗼𝘂𝗹𝗱 𝗖𝗼𝗱𝗲. 𝗜 𝗪𝗮𝘀 𝗪𝗿𝗼𝗻𝗴. In the beginning, I thought learning syntax was everything. If I knew loops, conditions, functions, and queries, I felt like I was improving. But real growth started when I faced problems that did not have direct answers. That is when I understood the difference between knowing syntax and actually solving problems. Syntax tells you how to write code. Problem solving tells you what to write and why. In real work, the hard part is usually not remembering the syntax. The hard part is understanding the problem, thinking calmly, breaking it step by step, and not giving up when nothing works at first. That is the part that really changed me. Now I feel syntax is just the starting point. The real skill is learning how to think through problems. #Programming #ProblemSolving #Coding #Python #Learning