CodSpeed的动态

?? Day 26 of #100DaysOfPython Today, I wrote a program using time module which greets user good morning, good afternoon, good evening and good night based on current time. #PythonProgramming #LearningJourney #100DaysOfCode #Day26 ????

Day 14 of #100DaysOfPython ?? Today, I dived into the power of the while loop! Loops like these bring flexibility to our programs, allowing us to solve interesting problems dynamically. Here's a program I wrote to calculate the sum of digits of any number entered by the user. What cool tasks have you used a while loop for? Share your thoughts!"

?? Got the 100 Days Leetcode Badge and Trapping some water! ?? #Day56 of #100DaysOfCoding Hello LinkedIn community! ?? Today, I worked through the Trapping Rain Water problem on LeetCode, exploring different strategies to solve it: ?? Brute Force (O(N^2)): Initially attempted a straightforward but inefficient solution by calculating water trapped for each pair. ?? Linear Time & Space (Prefix, Postfix Max): Moved on to a more optimized approach with linear time and space complexity using prefix and postfix maximums. ?? Two-Pointer Approach: Finally arrived at the most optimal solution, efficiently managing left and right pointers to calculate the trapped water in linear time and constant space. It was a challenging problem but super rewarding to see the progression in my problem-solving technique! ?? With this problem, i also got the 100 Days Badge from Leetcode for 2024! This is the total number of days i have coded in 2024 till today, this excludes my #100DaysOfCoding challenge. I'm still at day 56 in the challenge. #Python #Coding #LeetCode #Algorithms #ProblemSolving #LearningInPublic #TechLearningJourney

Getting my steam back with question 54. This one was a pretty easy binary search, which is good since I had a few hiccups in my Python syntax. Months using Go will do that! This solution was just a binary search, except that instead of matching a search term, we check the value against its neighbors in the array, looking for a peak or inflection point. YouTube video: https://lnkd.in/gQVJ9582 LeetCode solution: https://lnkd.in/gC4-6_Bf

?? Day 49/100: #100DaysOfCode Challenge ?? Today, I tackled the "Next Greater Element I" problem on LeetCode, leveraging the power of monotonic stacks to achieve an efficient solution! ?? ?? Problem Overview: Given two arrays, the goal was to find the "next greater element" for elements in nums1 from the corresponding indices in nums2. ?? Approach: Utilized a stack to traverse nums2 efficiently. Mapped elements from nums1 using a dictionary for quick lookups. Solved with a time complexity of O(n) — a significant improvement over brute force! ?? Key Learnings: 1?? Stacks are incredibly versatile for solving problems with "next greater" or similar patterns. 2?? Clean and efficient code can make a big difference in both understanding and execution. ? Result: Code accepted with a runtime of 4 ms! (Beats ~33% ??) Small wins pave the way for big achievements. ?? What are your thoughts on optimizing such problems? Share your tips below! ?? #Python #LeetCode #CodingChallenge #100DaysOfCode #Day49 #ProblemSolving

#Day71 Hamming distance is the number of characters that differ between two strings. #100DaysOfCode #PythonChallenge #Day71 #CodingJourney #PythonProgramming #CodeEveryday #LearningPython #DeveloperLife #TechChallenge #PythonDeveloper

?? LeetCode 75 (Day-14): A Daily Commitment to DSA Brilliance ?? ?? Challenge: Strengthen DSA fundamentals through consistent practice and problem-solving. ?? Today’s Focus: Find Pivot Index – balancing an array with finesse! ?? Key Takeaways: ?Practiced techniques for optimized solutions like prefix sums and dynamic adjustments. ?Improved problem-solving efficiency with Python3. ?Reinforced the importance of algorithmic thinking in real-world scenarios. #LeetCodeGoals #DSAJourney #CodeDaily #ProblemSolvingLife #CodingJourney #ContinuousImprovement #GrowthMindset #AlgorithmDesign #TechnicalSkills

#100DaysOfCode #100DaysOfPython Day-3 - done! Studying variables of the string type, I read about the garbage collector and the memory leak, which is a very important problem.

?? Day 37 - LEETCODE 100 DAYS CHALLENGE ?? Problem 448: Find All Numbers Disappeared in an Array Given an array nums of n integers where nums[i] is in the range [1, n], return an array of all integers in the range [1, n] that do not appear in nums. ? Examples: Example 1: Input: nums = [4,3,2,7,8,2,3,1] Output: [5,6] Example 2: Input: nums = [1,1] Output: [2] Constraints: n == nums.length 1 <= n <= 10^5 1 <= nums[i] <= n My Solution: class Solution(object): def findDisappearedNumbers(self, nums): """ :type nums: List[int] :rtype: List[int] """ numset = set(nums) l = [] for i in range(1, len(nums) + 1): if i not in numset: l.append(i) return l Explanation: By converting the array nums into a set, we efficiently check which numbers from 1 to n are missing by iterating and adding any absent numbers to a list. Time Complexity : O(n) #LeetCode #Python #Coding #Day37 #Algorithm #100DayChallenge

?? Day 25 - LeetCode 100-Day Challenge ?? Today, I tackled "Find Champion II" (Problem #2924), a challenging graph theory problem involving Directed Acyclic Graphs (DAGs)! ?? Key insights from this problem: A DAG guarantees no cycles, which simplifies reasoning about relationships. To identify the tournament "champion," I leveraged the concept of undefeated teams and efficient traversal. The core idea: If a node (team) has no incoming edges (i.e., no stronger teams), it might be the champion. But it must be unique to qualify! ?? This challenge honed my skills in edge case handling, graph traversal, and understanding the intricacies of tournaments represented as graphs. ?? Here's the Python solution I came up with! Would love to hear how others approached it. #LeetCode #GraphTheory #100DaysOfCode #ProblemSolving #DAG #CodingChallenge