Solved #3354 with Python, achieved 93.09% runtime efficiency and 95.74% memory optimization

🚀 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

💡 LeetCode #21 — Merge Two Sorted Lists 📘 Problem: You are given the heads of two sorted linked lists list1 and list2. Merge them into one sorted linked list and return the head of the new list. 🧠 Approach: Use a dummy node to simplify the process. Compare nodes from both lists one by one. Attach the smaller node to the merged list. Once one list is empty, connect the remaining nodes from the other list. ⚙️ Complexity: ⏱ Time: O(m + n) — traverse both lists once 💾 Space: O(1) — uses constant extra space 💬 Takeaway: This is a great example of the two-pointer technique and dummy node pattern, useful in many linked list problems. #LeetCode #Python #DataStructures #LinkedLists #CodingInterview #DSA

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

🚀 Solved the 4Sum problem (LeetCode #18)! An interesting extension of the 2Sum and 3Sum problems — it really tests how well you can use the two-pointer technique and handle duplicates efficiently. 🧩 Problem: Find all unique quadruplets [a, b, c, d] in an array that sum up to a given target. ⚙️ Approach: Sort the array Fix two numbers using nested loops Use two pointers for the remaining two numbers Skip duplicates to ensure unique results 🧠 Key Takeaways: Extension of 3Sum → 4Sum Practiced sorting + two-pointer technique Strengthened understanding of duplicate handling and O(n³) complexity Every problem solved is one step closer to mastering DSA 💪 #LeetCode #DSA #Python #Coding #ProblemSolving #TwoPointers #LearningJourney

Day 44 of #100DaysOfCode, solving "Longest Common Subsequence (LCS)." This problem requires finding the longest sequence common to two strings, even if characters are separated. My solution uses Dynamic Programming (DP), which breaks the problem into smaller, overlapping subproblems. DP Table: I built a table (optimized to use only the previous row) to store the length of the LCS found so far. The Rule: If characters match, the LCS length increases by 1 (coming from the diagonal cell). If they don't match, the length is the maximum of the two adjacent cells. This systematic approach guarantees the optimal result, solving the problem in O(m * n) time complexity. #Python #DSA #Algorithms #DynamicProgramming #LCS #100DaysOfCode #ProblemSolving

Today's focus: 3024. Type of Triangle. The efficient solution required two key steps: Sorting to quickly check the triangle inequality theorem. Using conditional logic to determine if it's Equilateral, Isosceles, or Scalene. Result: 0 ms runtime, beating 100% of submissions. Simple logic, maximum efficiency! #LeetCode #Python #ProblemSolving #Algorithms #Logic

🚀 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