Converting Integers to Roman Numerals with LeetCode Challenge

🚀 LeetCode Day 23 – Question 1572 🧮 Matrix Diagonal Sum Today’s problem focuses on understanding matrix traversal and diagonal logic. 📌 Key Concepts 🔹 Primary Diagonal From top-left to bottom-right Condition: row index = column index 🔹 Secondary Diagonal From top-right to bottom-left Condition: row index + column index = n − 1 🧠 Core Insight For each row: Add the primary diagonal element Add the secondary diagonal element ⚠️ If the matrix size is odd, the center element lies on both diagonals — count it only once. ⏱ Complexity Time Complexity: O(n) Space Complexity: O(1) Clean logic. Simple traversal. Strong fundamentals. 💪 #LeetCode #CodingJourney #ProblemSolving #100DaysOfCode #Python

🚀 Day 10 of #100DaysOfLeetCode 📌 LeetCode 3010 – Divide an Array Into Subarrays With Minimum Cost I 🔍 Problem Insight We’re given an array and need to form subarrays of size 3. The cost of each subarray = sum of its elements, and the goal is to get the minimum possible total cost. 💡 Key Observation The first element is always included. To minimize cost, we just need to pick the two smallest elements from the remaining array and add them to the first element. 🧠 Approach Fix the first element Find the two smallest elements from the rest. Return their sum. ⏱ Time Complexity: O(n) 📦 Space Complexity: O(1) ✅ What I learned Many LeetCode problems look complex but reduce to a simple greedy observation. Always question: “What is actually fixed, and what can I optimize?” On to Day 11 tomorrow 💪 #LeetCode #DSA #ProblemSolving #Consistency #Python #CodingJourney

LeetCode | Intersection of Two Linked Lists 🔗 By switching heads, both pointers travel equal distance and meet at the intersection. 🔹 Approach: Two Pointer Switching 🔹 Key idea: Traverse both lists to align lengths 🔹 Time Complexity: O(n + m) 🔹 Space Complexity: O(1) Daily DSA practice to strengthen linked list skills 🚀 #LeetCode #DSA #LinkedList #TwoPointers #Python #CodingJourney #LearningInPublic 

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

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

LeetCode | Linked List Cycle II 🔗 Once fast and slow meet, resetting one pointer to head reveals the cycle entry point 🔹 Approach: Floyd’s Cycle Detection 🔹 Key idea: After collision, move one pointer to head to find cycle start 🔹 Time Complexity: O(n) 🔹 Space Complexity: O(1) Daily DSA practice to strengthen linked list skills 🚀 #LeetCode #DSA #LinkedList #TwoPointers #Python #CodingJourney #LearningInPublic 

🚀 Day 5/30 | LeetCode Problem: Repeated Substring Pattern (459) Problem: Given a string s, check if it can be constructed by repeating one of its substrings multiple times. Approach (Smart String Trick): Concatenate the string with itself → (s + s) Remove the first and last characters If the original string s exists inside this new string, then it is made of a repeating substring This works because repeating patterns always reappear in the middle of (s + s). Sometimes, clever observations can replace complex loops and conditions. 📌 Accepted ✅ | All test cases passed 🔖 Hashtags #LeetCode #30DaysOfLeetCode #Day5 #Python #Strings #Algorithms #ProblemSolving #CodingJourney #SoftwareEngineering #TechCommunity

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

🚀 LeetCode Progress | Problem 189 – Rotate Array Solved 189. Rotate Array by rotating the array in-place, without using extra space. 🔹 Key ideas: Leveraged Python’s negative indexing Inserted elements at the front Carefully deleted trailing elements to maintain in-place modification ⏱️ Time Complexity: O(n) 📦 Space Complexity: O(1) (no extra array used) my code at: https://lnkd.in/eTpkPiDS On to the next one 💪 #LeetCode #DSA #Python #ProblemSolving #CodingJourney #InterviewPrep #Consistency

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