How to Merge Two Sorted Linked Lists in LeetCode

Day 62 Of #100DaysOfCode Problem #3354: Make Array Elements Equal to Zero Successfully solved today’s problem with an optimized solution achieving 93.09% runtime efficiency and 95.74% memory optimization! 🚀 🧩 Problem Insight: Given an integer array, the task is to determine the number of valid selections of a starting index and direction that reduce all array elements to zero by following specific movement and decrement rules. ⚙️ Approach: Used prefix/suffix summation logic to track balance between left and right movements. Calculated total sum and suffix sums efficiently to identify valid starting points. Achieved O(n) time complexity using cumulative tracking. 🧠 Language: Python ✅ Result: Accepted | Beats 93.09% in Runtime, 95.74% in Memory #LeetCode #Python #ProblemSolving #CodingChallenge #Mythyly #DailyPractice #DSA #ProgrammingJourney #WomenInTech

🚀 Daily LeetCode Challenge: Check If All 1’s Are at Least K Places Apart Today’s problem tested the importance of clean logic and careful return placement. The challenge: Given a binary array nums and an integer k, determine if all 1s are at least k indices apart. 🔎 Approach Track the index of the last seen 1. For each new 1, check the gap with the previous one. If the gap is smaller than k, return False. Otherwise, update the last index and continue. If no violations are found, return True. 🔗 https://lnkd.in/grFSDb3w #LeetCode #DailyCodingChallenge #Python #Algorithms #ProblemSolving #CodingJourney #100DaysOfCode #SoftwareEngineering

Day 57 of #100DaysOfCode Solved LeetCode Problem 3461: Check If Digits Are Equal in String After Operations I ✅ This problem involved iteratively performing modulo operations on consecutive digits of a string until only two digits remain and then checking if they are equal. It tested skills in: String manipulation Iterative logic Modulo arithmetic 💡 Key Takeaways: Reinforced understanding of working with string-to-integer conversions. Practiced efficient looping and array manipulation in Python. Strengthened problem-solving mindset for algorithmic challenges. ⏱ Performance: Runtime: 21 ms — beats 95% of submissions Memory: 17.73 MB — beats 71% of submissions #100DaysOfCode #LeetCode #Python #CodingChallenge #Algorithm #ProblemSolving #CompetitiveProgramming #TechSkills #SoftwareDevelopment #CodingJourney #CodeNewbie #PythonProgramming #DevCommunity #ProgrammingLife #LearnToCode #CodeDaily #TechLearning #PythonDeveloper #CodePractice #ProgrammingChallenge

Day 27 🚀 LeetCode Challenge: Contains Duplicates II https://lnkd.in/g_zweS_R Today’s problem was all about efficiently checking whether any duplicate elements exist within a given distance k in an array. 💡 Concepts used: HashMap / Sliding Window approach Efficient lookup using key-value pairs Understanding of array traversal and index tracking 🧠 Key takeaway: Instead of comparing every element (which takes more time), using a HashMap allows us to check duplicates in constant time — improving performance significantly. 💻 Learning: Optimizing code with the right data structure makes a huge difference in both speed and clarity. #Day27 #LeetCode #ProblemSolving #CodingChallenge #Java #Python #DataStructures #ContainsDuplicatesII

🔷 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

🚀 Level Up Your Trading Strategy! From Stock Data to Market Momentum with the RSI Indicator 🚀 The Relative Strength Index (RSI) is one of the most crucial tools for identifying overbought and oversold conditions. But understanding the theory is just the start—we need to code it. 🔥 In this NEW video, I break down: The Core Theory: What the RSI is and why it matters for momentum analysis. Coding from Scratch: A complete, step-by-step tutorial on implementing the RSI logic in Python. Visualization: Visualize RSI for powerful insights Ready to stop guessing and start calculating? Watch the full RSI Indicator tutorial here: 👉 https://lnkd.in/dAzc4H-P #QuantitativeFinance #Python #yfinance #StockMarketAnalysis #DataScience #TradingStrategy #FinancialModeling #LearnToCode #OpenSource #FinanceCommunity #RSI #RelativeStrengthIndex

LeetCode 90-Day Challenge – Day 71 Problem: LRU Cache Difficulty: Medium Problem: Design a data structure that follows the constraints of a Least Recently Used (LRU) cache. Implement the LRUCache class with two main functions: get(key) return the value if the key exists, otherwise return -1. put(key, value) insert or update a value, and if capacity is exceeded, remove the least recently used key. Both operations must run in O(1) time on average. Solution approach: I used Python’s OrderedDict to efficiently track the order of key usage. Each time a key is accessed or updated, it is moved to the end of the dictionary to mark it as recently used. When the cache exceeds its capacity, the first inserted key (the least recently used one) is removed. This approach keeps both get and put operations constant time and simple to understand. #LeetCode #100DaysOfCode #Python #LinkedInChallenge #CodingJourney #ProblemSolving #LeetCodeChallenge

🚀 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 🚀

Explored historical gold price data and built a predictive model using Random Forest Regression. The model shows a strong correlation between the features and GLD prices, with high accuracy in predictions. Find the full analysis and code in my Colab notebook! #PredictiveModeling #FinancialData #DataAnalysis #Python #Colab Check out the notebook to see how I did it! Find the code on GitHub:https://lnkd.in/dGZsRNVt

🚀 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