LeetCode 3803: Efficient String Problem Solution

🚀 Day 6 of LeetCode | Integer to Roman Today’s challenge was Integer to Roman — converting a given integer into its Roman numeral representation. Approach: Use predefined integer values and their Roman symbols Apply a greedy strategy to subtract the largest possible value Handle subtractive cases like IV, IX, XL, XC Build the result step by step until the number becomes zero ⏱ Time Complexity: O(1) 📦 Space Complexity: O(1) #LeetCode#DSA #ProblemSolving #Python #CodingJourney

Day 41 – Counting Uppercase Letters in a String: Today’s task focused on identifying and counting uppercase letters in a user-provided string. By iterating through each character and applying conditional checks, the solution accurately detects uppercase characters. This exercise strengthened understanding of string traversal, built-in string methods, and logical conditions—key fundamentals for text analysis and data preprocessing. GitHub Code: https://lnkd.in/g5HQM5je #Day41 #100DaysOfCode #Python #StringManipulation #LogicBuilding #DailyCoding #Consistency

Day 11 of #100DaysOfLeetCode 🚀 Problem: LeetCode 43 – Multiply Strings Today’s challenge was interesting because direct integer multiplication is not allowed. We have to multiply two numbers given as strings and return the result as a string. 🧠 Key Learnings: You can’t convert strings to int (that’s the trap) Manual multiplication (just like school math) is the right approach Use an array to store intermediate results Handle carry properly Watch out for leading zeros 💡 Why this problem matters: Tests understanding of string manipulation Strengthens logic for large number handling ⏱️ Complexity: Time: O(n × m) Space: O(n + m) Slowly getting more comfortable with thinking beyond built-in shortcuts 💪 Consistency > Motivation. #LeetCode #Python #MultiplyStrings #DSA #CodingJourney #100DaysOfCode

Day 42 ✅ | Reverse Linked List Revisited one of the most important linked list problems today. The goal is to reverse the list in-place by carefully adjusting node pointers. Key ideas used: Maintain prev and curr pointers Temporarily store the next node Reverse links step by step while traversing the list This problem is a great reminder that mastering the basics makes harder problems much easier 💪 #Python #LeetCode #LinkedList #ReverseLinkedList #ProblemSolving #Day42 #CodingJourney #DSA #Algorithms #DataStructures

🚀 Day 2 of My LeetCode Journey 📌 Problem: Maximum Average Subarray I For this problem, I used the sliding window technique to efficiently calculate the maximum average of a subarray of size k. Approach: Calculated the sum of the first window of size k Slid the window by adding the next element and removing the previous one Updated the maximum sum at each step Returned the maximum sum divided by k to get the average ⏱ Time Complexity: O(n) 💾 Space Complexity: O(1) ✨ Key takeaway: Sliding window helps avoid recalculating sums and makes the solution more efficient. On to Day 3 🚀 #Day2 #100daysofLeetcode #ProblemSolving #SlidingWindow #DSA #Python #LearningInPublic

100 Days LeetCode Challenge - Day #9 Solved LeetCode 34: Find First and Last Position of Element in Sorted Array This problem is a great reminder that one binary search is sometimes not enough. The idea: Use binary search twice First to find the leftmost occurrence Second to find the rightmost occurrence Simple logic, but precision matters a lot here. Key Learnings: Binary search can be customized for boundaries Small mistakes in conditions can break everything Splitting a problem into smaller searches makes it cleaner Complexity: Time: O(log n) Space: 0(1) #100DaysOf Code #BinarySearch #Arrays #Python #Problem Solving

Day 7 of LeetCode 🚀 | 3Sum Closest Today’s problem was 3Sum Closest — finding three numbers whose sum is closest to a given target. Approach: Sort the array Fix one element and use the two-pointer technique Update the closest sum based on minimum difference Adjust pointers to move toward the target ⏱️ Time Complexity: O(n²) 📦 Space Complexity: O(1) #LeetCode #Day6 #DSA #ProblemSolving #TwoPointers #Python #CodingJourney

Day 45 – Splitting and Joining a String: Today’s task focused on splitting a string using a user-defined delimiter and then joining the parts back into a clean, readable format. This exercise strengthened understanding of string methods, input handling, and text restructuring, which are essential skills for data preprocessing and text manipulation in real-world applications. GitHub Code: https://lnkd.in/gznh5VpR #Day45 #100DaysOfCode #Python #StringManipulation #LogicBuilding #TextProcessing #DailyCoding #Consistency

Creating complex objects can get messy - constructors with too many params, tricky optional arguments, etc. Well, the builder pattern helps solve these issues by separating object construction from representation. In this guide, Bala shows you how the pattern works in Python with plenty of code examples. https://lnkd.in/g5ekziEC