Min Cost Climbing Stairs LeetCode Challenge

✅ Day 46 of 100 Days LeetCode Challenge Problem: 🔹 #91 – Decode Ways 🔗 https://lnkd.in/gpZQshBr Learning Journey: 🔹 Today’s problem focused on counting the number of ways to decode a numeric string into letters. 🔹 I used a Dynamic Programming approach with space optimization, tracking only the previous two states. 🔹 At each step, I checked both single-digit and two-digit decoding possibilities. 🔹 Careful handling of edge cases like leading zeros was essential to ensure valid decoding paths. Concepts Used: 🔹 Dynamic Programming 🔹 Space Optimization 🔹 String Parsing 🔹 State Transition Key Insight: 🔹 Many decoding problems depend on evaluating valid transitions from previous states. 🔹 Maintaining only necessary previous results reduces space complexity to O(1). 🔹 Edge cases involving zeros are critical in avoiding invalid combinations. #LeetCode #DataStructures #Algorithms #CodingInterview #SoftwareEngineering #SoftwareDeveloper #ProblemSolving #Programming #ComputerScience #TechCareers #100DaysOfCode #DailyCoding #Consistency #LearningInPublic #Python #BackendDevelopment #InterviewPreparation #TechCommunity

✅ Day 47 of 100 Days LeetCode Challenge Problem: 🔹 #152 – Maximum Product Subarray 🔗 https://lnkd.in/gcKQWrHz Learning Journey: 🔹 Today’s problem focused on finding the maximum product of a contiguous subarray. 🔹 Unlike sum-based problems, negative numbers can flip the result, so I tracked both maximum and minimum products at each step. 🔹 Whenever a negative number appeared, I swapped the current max and min to maintain correctness. 🔹 This allowed me to dynamically update the best possible product while traversing the array once. Concepts Used: 🔹 Dynamic Programming 🔹 Kadane-like Optimization 🔹 Greedy State Tracking 🔹 Array Traversal Key Insight: 🔹 Keeping track of both maximum and minimum products is essential due to sign changes. 🔹 Negative numbers can turn the smallest product into the largest. 🔹 Maintaining rolling states leads to an efficient O(n) solution. #LeetCode #DataStructures #Algorithms #CodingInterview #SoftwareEngineering #SoftwareDeveloper #ProblemSolving #Programming #ComputerScience #TechCareers #100DaysOfCode #DailyCoding #Consistency #LearningInPublic #Python #BackendDevelopment #InterviewPreparation #TechCommunity

✅ Day 36 of 100 Days LeetCode Challenge Problem: 🔹 #213 – House Robber II 🔗 https://lnkd.in/gmvFEbZe Learning Journey: 🔹 Today’s problem extended the classic House Robber problem by arranging houses in a circular layout. 🔹 The circular constraint means the first and last houses cannot both be robbed. 🔹 I solved this by breaking the problem into two linear cases: excluding the first house and excluding the last house. 🔹 A helper function applies the standard dynamic programming approach to maximize profit without adjacent selections. Concepts Used: 🔹 Dynamic Programming 🔹 Space Optimization 🔹 Problem Decomposition 🔹 Greedy Decision Making Key Insight: 🔹 Circular constraints can often be simplified by converting them into multiple linear scenarios. 🔹 Tracking only previous states reduces space complexity while maintaining optimal results. 🔹 Recognizing problem patterns helps reuse solutions from related problems. #LeetCode #DataStructures #Algorithms #CodingInterview #SoftwareEngineering #SoftwareDeveloper #ProblemSolving #Programming #ComputerScience #TechCareers #100DaysOfCode #DailyCoding #Consistency #LearningInPublic #Python #BackendDevelopment #InterviewPreparation #TechCommunity

✅ Day 54 of 100 Days LeetCode Challenge Problem: 🔹 #728 – Self Dividing Numbers 🔗 https://lnkd.in/gxraQJ82 Learning Journey: 🔹 Today’s problem focused on identifying numbers that are divisible by each of their digits. 🔹 For every number in the given range, I extracted its digits and checked divisibility conditions. 🔹 Any number containing zero was immediately rejected since division by zero is invalid. 🔹 Valid numbers were collected into the final result list. Concepts Used: 🔹 Digit Extraction 🔹 Modulo Arithmetic 🔹 Iterative Checking 🔹 Conditional Filtering Key Insight: 🔹 Breaking numbers into digits simplifies many number-theory problems. 🔹 Early elimination (like handling zeros) improves efficiency. 🔹 Clear validation logic makes implementation straightforward and readable. #LeetCode #DataStructures #Algorithms #CodingInterview #SoftwareEngineering #SoftwareDeveloper #ProblemSolving #Programming #ComputerScience #TechCareers #100DaysOfCode #DailyCoding #Consistency #LearningInPublic #Python #BackendDevelopment #InterviewPreparation #TechCommunity

✅ Day 44 of 100 Days LeetCode Challenge Problem: 🔹 #3713 – Longest Balanced Substring 🔗 https://lnkd.in/gfryNgam Learning Journey: 🔹 Today’s problem focused on finding the longest substring where all characters appear with equal frequency. 🔹 I explored all possible substrings by fixing a starting index and expanding the window step by step. 🔹 A frequency array helped track character counts along with the number of distinct characters and maximum frequency. 🔹 By validating whether all active characters share the same count, I identified balanced substrings efficiently. Concepts Used: 🔹 String Processing 🔹 Frequency Counting 🔹 Nested Traversal 🔹 Sliding Window Concepts Key Insight: 🔹 Balanced substring problems rely on maintaining strict frequency conditions. 🔹 Tracking distinct characters and maximum frequency simplifies validation logic. 🔹 Smart bookkeeping can make brute-force approaches effective for constrained problems. #LeetCode #DataStructures #Algorithms #CodingInterview #SoftwareEngineering #SoftwareDeveloper #ProblemSolving #Programming #ComputerScience #TechCareers #100DaysOfCode #DailyCoding #Consistency #LearningInPublic #Python #BackendDevelopment #InterviewPreparation #TechCommunity

✅ Day 37 of 100 Days LeetCode Challenge Problem: 🔹 #322 – Coin Change 🔗 https://lnkd.in/gtfVrvhV Learning Journey: 🔹 Today’s problem focused on finding the minimum number of coins needed to make up a given amount. 🔹 I used Dynamic Programming with a bottom-up approach, building solutions for smaller amounts first. 🔹 A DP array tracks the minimum coins required for each value from 0 up to the target amount. 🔹 For every amount, I iterated through all coin denominations to compute the optimal solution. Concepts Used: 🔹 Dynamic Programming 🔹 Bottom-Up DP 🔹 Optimization Problems 🔹 State Transition Key Insight: 🔹 Breaking problems into smaller subproblems makes optimization manageable. 🔹 Initializing with infinity helps represent unreachable states clearly. 🔹 Iterative DP ensures efficient computation and avoids repeated work. #LeetCode #DataStructures #Algorithms #CodingInterview #SoftwareEngineering #SoftwareDeveloper #ProblemSolving #Programming #ComputerScience #TechCareers #100DaysOfCode #DailyCoding #Consistency #LearningInPublic #Python #BackendDevelopment #InterviewPreparation #TechCommunity

Closing a chapter. Opening a new mindset. I just wrapped up the final topic of my Python module — and it hit different. This section was all about digit-based programming, and it pushed me to truly think in logic: ✅ Extracting digits from a number ✅ Printing only the odd digits ✅ Finding the sum of digits ✅ Identifying the greatest & smallest digit ✅ Calculating the difference between them ✅ Checking Spy Numbers 🕵️ (sum of digits = product of digits) ✅ Checking Neon Numbers ✨ (square's digit sum = original number) What started as simple number problems turned into a deep dive into loops, conditionals, and number manipulation — the real building blocks of programming logic. This wasn't just about solving problems. It was about learning how to think like a programmer. 💡 Every concept clicked a little more. Every bug fixed made me a little sharper. That's the journey. If you're just starting out in Python — keep going. The small wins stack up. 🚀 #Python #CodingJourney #LearnToCode #PythonProgramming #100DaysOfCode #BeginnerCoder #TechLearning #Programming #GrowthMindset #LinkedInLearning

✅ Day 39 of 100 Days LeetCode Challenge Problem: 🔹 #114 – Flatten Binary Tree to Linked List 🔗 https://lnkd.in/g6xn2K3g Learning Journey: 🔹 Today’s problem focused on transforming a binary tree into a flattened linked list in-place. 🔹 I used an iterative approach, modifying pointers while traversing the tree. 🔹 For each node with a left subtree, I found the rightmost node of that subtree and connected it to the current node’s right subtree. 🔹 Then, I moved the left subtree to the right and continued traversal. Concepts Used: 🔹 Binary Trees 🔹 Tree Traversal 🔹 Pointer Manipulation 🔹 In-place Modification Key Insight: 🔹 Tree restructuring problems often rely on careful pointer adjustments. 🔹 Finding the predecessor (rightmost node of left subtree) helps preserve traversal order. 🔹 Iterative solutions can avoid recursion and reduce extra space usage. #LeetCode #DataStructures #Algorithms #CodingInterview #SoftwareEngineering #SoftwareDeveloper #ProblemSolving #Programming #ComputerScience #TechCareers #100DaysOfCode #DailyCoding #Consistency #LearningInPublic #Python #BackendDevelopment #InterviewPreparation #TechCommunity

✅ Day 43 of 100 Days LeetCode Challenge Problem: 🔹 #684 – Redundant Connection 🔗 https://lnkd.in/gWtKJ-FA Learning Journey: 🔹 Today’s problem focused on detecting an extra edge that creates a cycle in an undirected graph. 🔹 I used the Union-Find (Disjoint Set Union) data structure to track connected components. 🔹 For each edge, I checked whether both nodes already belong to the same set. 🔹 If they do, adding that edge forms a cycle, making it the redundant connection. Concepts Used: 🔹 Union-Find (Disjoint Set) 🔹 Path Compression 🔹 Graph Cycle Detection 🔹 Connected Components Key Insight: 🔹 Union-Find provides an efficient way to detect cycles during edge additions. 🔹 Path compression optimizes repeated parent lookups. 🔹 Incrementally building connectivity helps quickly identify redundant edges. #LeetCode #DataStructures #Algorithms #CodingInterview #SoftwareEngineering #SoftwareDeveloper #ProblemSolving #Programming #ComputerScience #TechCareers #100DaysOfCode #DailyCoding #Consistency #LearningInPublic #Python #BackendDevelopment #InterviewPreparation #TechCommunity

𝐓𝐨𝐝𝐚𝐲 𝐢𝐧 𝐦𝐲 𝐏𝐲𝐭𝐡𝐨𝐧 𝐜𝐥𝐚𝐬𝐬, 𝐬𝐨𝐦𝐞𝐭𝐡𝐢𝐧𝐠 𝐟𝐢𝐧𝐚𝐥𝐥𝐲 𝐜𝐥𝐢𝐜𝐤𝐞𝐝.💡 We moved from procedural programming to object-oriented programming, and I had that quiet “aha” moment.🤍 Procedural programming feels like giving instructions: Do this. Then that. Then print the result. It works.👍 But OOP made me pause and think differently.🧠 Instead of steps, I started seeing things. Students. Objects. Responsibilities. Relationships. Encapsulation taught me to keep related data and behavior together.📦 Inheritance showed me how to build on what already exists.🌱 Polymorphism reminded me that the same action can behave differently depending on the object. What surprised me most wasn’t the syntax. It was the mindset shift.✨ I realized programming isn’t just about writing code. It’s about modeling real life, organizing complexity, and designing solutions that grow. 𝐒𝐭𝐢𝐥𝐥 𝐥𝐞𝐚𝐫𝐧𝐢𝐧𝐠 📚 𝐒𝐭𝐢𝐥𝐥 𝐚𝐬𝐤𝐢𝐧𝐠 𝐪𝐮𝐞𝐬𝐭𝐢𝐨𝐧𝐬 ❓ 𝐒𝐭𝐢𝐥𝐥 𝐜𝐨𝐧𝐧𝐞𝐜𝐭𝐢𝐧𝐠 𝐝𝐨𝐭𝐬 🧩 If you’re on this journey too, be 𝐩𝐚𝐭𝐢𝐞𝐧𝐭 𝐰𝐢𝐭𝐡 𝐲𝐨𝐮𝐫𝐬𝐞𝐥𝐟. Every concept takes time to settle. One day, it just clicks. #Python #LearningInPublic #SoftwareEngineering #TechJourney #Programming #CareerGrowth