Solved LeetCode 2011 with Python String Handling

Day 46/100 – #100DaysOfCode 🚀 Solved LeetCode #2733 – Neither Minimum nor Maximum (Python). Today I practiced sorting and simple array logic to find any element that is neither the minimum nor the maximum in the array. Approach: 1) Sort the array. 2) Check the length of the array. 3) If the size is less than or equal to 2, return -1 (no valid element exists). 4) Otherwise, return the second element as it will be neither min nor max. Time Complexity: O(n log n) Space Complexity: O(1) Understanding how sorting simplifies boundary-based problems 💪 #LeetCode #Python #DSA #Arrays #Sorting #ProblemSolving #100DaysOfCode

Day 39/100 – #100DaysOfCode 🚀 Solved LeetCode #2215 – Find the Difference of Two Arrays (Python). Today I practiced set operations to efficiently find distinct elements between two arrays. Approach: 1) Convert both arrays into sets to remove duplicates. 2) Find elements present in nums1 but not in nums2 using set difference. 3) Find elements present in nums2 but not in nums1. 4) Convert both results back to lists. 5) Return the final list of differences. Time Complexity: O(n + m) Space Complexity: O(n + m) Understanding how set operations simplify comparison problems 💪 #LeetCode #Python #DSA #Sets #Arrays #ProblemSolving #100DaysOfCode

Day 33/100 – #100DaysOfCode 🚀 Solved LeetCode #1480 – Running Sum of 1d Array (Python). Today I practiced prefix sum logic to compute the running sum of an array. Approach: 1) Initialize an empty list to store the running sum. 2) Maintain a variable sum = 0. 3) Traverse the array and keep adding each element to sum. 4) Append the updated sum to the result list. 5) Return the final running sum array. Time Complexity: O(n) Space Complexity: O(n) Understanding prefix sums helps solve many array problems efficiently 💪 #LeetCode #Python #DSA #Arrays #PrefixSum #ProblemSolving #100DaysOfCode

Day 50/100 – #100DaysOfCode 🚀 Solved LeetCode #28 – Find the Index of the First Occurrence in a String (Python). Today I practiced string matching using a brute-force approach to find the first occurrence of a substring. Approach: 1) Traverse the main string (haystack). 2) For each index, try to match the substring (needle). 3) Compare characters one by one. 4) If all characters match, return the starting index. 5) If mismatch occurs, break and move to the next index. 6) If no match is found, return -1. Time Complexity: O(n × m) Space Complexity: O(1) Understanding basic string matching techniques step by step 💪 #LeetCode #Python #DSA #Strings #ProblemSolving #100DaysOfCode

Day 42/100 – #100DaysOfCode 🚀 Solved LeetCode #2574 – Left and Right Sum Differences (Python). Today I practiced prefix sum logic to calculate the absolute difference between left and right sums for each index. Approach: 1) Calculate the total sum of the array. 2) Initialize leftSum = 0. 3) Traverse the array. 4) For each index, compute rightSum = total - leftSum - nums[i]. 5) Calculate the absolute difference and append it to the result. 6) Update leftSum by adding nums[i]. Time Complexity: O(n) Space Complexity: O(n) Understanding prefix sum helps solve problems efficiently 💪 #LeetCode #Python #DSA #Arrays #PrefixSum #ProblemSolving #100DaysOfCode

Generate a #Python #Pandas DatetimeIndex of datetime values, specifying the frequency, by passing freq and a code: pd.date_range(start='2026-03-01', end='2026-05-01', freq='8h') This returns a 184-element DatetimeIndex with evenly-spaced datetime values in that period.

Day 53/100 – #100DaysOfCode 🚀 Solved LeetCode #125 – Valid Palindrome (Python). Today I practiced string cleaning and validation to check whether a given string is a palindrome. Approach: 1) Traverse the string and keep only alphanumeric characters. 2) Convert all characters to lowercase. 3) Build a cleaned string. 4) Compare the string with its reverse. 5) If both are equal, return True; otherwise, return False. Time Complexity: O(n) Space Complexity: O(n) Learning how preprocessing simplifies string problems 💪 #LeetCode #Python #DSA #Strings #ProblemSolving #100DaysOfCode

Here's a Python dictionary merge challenge from @dontmisstmr — can you get it right without running the code? dict1 = {"name": "Alice", "age": 25} dict2 = {"city": "Noida", "age": 26} merged = dict1 | dict2 print(merged) The | operator was introduced in Python 3.9. When both dicts share a key, which value wins? Drop your answer in the comments! #Python #SoftwareDevelopment #CodingChallenge #ProgrammingTips #TechCommunity

Understanding closures and variable scoping is what separates a good Python developer from a great one. 💻 In this video, I break down the "Late Binding" behavior in Python lambdas. It’s a common pitfall when creating functions inside loops, leading to bugs that are incredibly hard to track down in large codebases. Key Takeaway: Default arguments are evaluated at definition time, but closures capture variables by reference. To fix this, we use the i=i trick to force early binding. Have you ever encountered this "Late Binding" bug in your production code? #PythonProgramming #SoftwareDevelopment #CleanCode #ComputerScience #TechEducation #BackendDeveloper

🚀 Day 13 of My Python + DSA Journey Today’s problem focused on frequency counting 👇 ✅ Majority Element (#169) 💡 Majority Element Find the element that appears more than n/2 times 🔍 Approach: Used hashmap → counted frequency and returned element exceeding n/2 ⏱ O(n) time | O(n) space 🔥 What I learned today: • Hashmaps make counting problems simple • Frequency-based logic is very common in arrays • Early exit improves efficiency Getting faster at recognizing patterns ⚡ #Day13 #LeetCode #Python #DSA #CodingJourney #100DaysOfCode