Solving Scramble String with Memoization in Python

🚀 LeetCode #3461 – Check If Digits Are Equal in String After Operations I Today’s challenge was all about pattern transformation using modulo logic! 🔢 We repeatedly take each pair of consecutive digits, find their sum modulo 10, and form a new sequence, until only two digits remain. If both digits are the same, return True; otherwise, return False. ✨ It’s a neat way to test your understanding of string manipulation, loops, and modular arithmetic. 📊 Complexity: Time – O(n²) Space – O(n) Sometimes even the simplest looking problems hide cool math logic behind them 😄 Have you tried this one yet? What was your approach? 👇 #LeetCode #Python #CodingChallenge #ProblemSolving #LogicBuilding #100DaysOfCode #DSA

Day 9 of #30DaysOfCode | LeetCode Problem 3. Longest Substring Without Repeating Characters Implemented an optimized Sliding Window approach to find the length of the longest substring without repeating characters. By maintaining a dynamic window using two pointers and a hash set, the algorithm achieves O(n) time complexity while efficiently managing unique character sequences. #Python #LeetCode #CodingChallenge #ProblemSolving #DataStructures #Algorithms #DSA

Day 6 of #100DaysOfLeetCode Problem: 3. Longest Substring Without Repeating Characters Category: Strings / Sliding Window Today’s problem was about finding the length of the longest substring without any repeating characters — a classic question that tests understanding of window management and string traversal. 🧠 Key Learnings: Used a sliding window technique to dynamically adjust the current substring when a duplicate character was found. Tracked characters in the current substring and shifted the start position upon repetition. Focused on maintaining both time efficiency and substring accuracy by managing indices smartly. 🎯 Takeaway: Sliding window techniques are powerful for handling substring and subarray problems efficiently — balance between expanding and shrinking the window is the key. #LeetCode #100DaysOfCode #ProblemSolving #CodingJourney #Strings #SlidingWindow #Python #AIEngineer #Consistency

🚀 Problem: Given an unsorted array of integers, find the length of the longest consecutive sequence — and do it in O(n) time. 💡 Challenge: Most solutions use sorting (O(n log n)), but the goal is linear time complexity. 🧠 Solution: I optimized the approach using a HashSet (Set in Python) — which allows O(1) lookups — and only starts counting when a number is the beginning of a sequence. This ensures every number is visited once. ✅ Result: Efficient O(n) solution with 0ms runtime on LeetCode. #Python #LeetCode #ProblemSolving #CodingJourney #DSA #Algorithms #DeveloperMindset

Day 11 of #100DaysOfLeetCode Problem: 14. Longest Common Prefix Category: Strings / Comparison / Iteration Today’s challenge focused on finding the longest common prefix among an array of strings. It’s a great problem that improves your understanding of string traversal, comparison, and boundary conditions. 🧠 Key Learnings: Iterated character by character through the first string and compared it with all other strings. Carefully handled edge cases where strings had different lengths or no common prefix. Reinforced the concept of early termination when a mismatch is found — improving efficiency. Strengthened skills in iterative string comparison and control flow logic. 🎯 Takeaway: Small details like string length and early exit conditions make a big difference in optimizing even the simplest problems. #LeetCode #100DaysOfCode #ProblemSolving #CodingJourney #Strings #Python #AIEngineer #Consistency

🚀 Day 74 of #100DaysOfDSA 🚀 Solved LeetCode 1901 — Find a Peak Element II 🔹 Problem: Find a peak element in a 2D grid — a cell strictly greater than its four neighbors. 🔹 Approach: Binary Search on Columns Perform binary search on the columns. For each middle column, find the maximum element in that column. Compare it with its left and right neighbors: If it's greater than both → it's a peak. Else, move toward the side with the larger neighbor. ✨ Key Insight: Even in 2D grids, binary search can efficiently locate a peak using greedy direction decisions per column. #LeetCode #DSA #BinarySearch #Matrix #Python #ProblemSolving #100DaysOfCode #CodingJourney 🚀

🔷 Day 25- 30DaysChallenge(Leetcode Problem): First Missing Positive 🌟 Problem: Given an unsorted integer array nums. Return the smallest positive integer that is not present in nums. You must implement an algorithm that runs in O(n) time and uses O(1) auxiliary space. 🧠Solution: class Solution:   def firstMissingPositive(self, nums: List[int]) -> int:     unique = set(nums)     i = 1     while i in unique:       i += 1     return i #DSA #Python #CodingChallenge #30dayschallenge #Leetcode

Day 4 of #100DaysOfLeetCode Problem: 219. Contains Duplicate II Category: Arrays / HashMap / Sliding Window Today’s challenge was about checking if an array contains duplicate elements within a specific index distance k. I solved this using a hashmap to track the most recent index of each element while iterating through the array. 🧠 Key Learnings: 1) Used a hashmap to perform quick lookups and avoid nested loops. 2) Checked if a duplicate element appeared again within k indices. 3) Optimized the approach to run in O(n) time and O(n) space. 🎯 Takeaway: Tracking element indices in a hashmap helps handle proximity-based duplicate problems efficiently. Staying consistent and learning something new every day! 💪 #LeetCode #100DaysOfCode #ProblemSolving #CodingJourney #HashMap #SlidingWindow #Python #AIEngineer #Consistency