Marvelous Ajuzie’s Post

Finished 145th today in LeetCode Weekly 389! Q4 was pretty hard today to implement. Somehow got it right 😅. Check out my solution for Q4: https://lnkd.in/d83FPree #leetcode #competitiveprogramming #algorithms #codingcontest

Today was #Day168 of #180DaysOfCodeChallengeLeetCode where I solved the question - Stone Game II 👨🏻💻🚀 #CodingChallenge #LeetCode #ContinuousLearning #Algorithm #DataStructures #CareerDevelopment

“Day 6 of the #60DaysOfCode and I’ve just cracked the ‘Contains Duplicates’ problem on LeetCode! 🎉👨💻 It’s not just about solving problems, it’s about growing stronger with each line of code. #CodingChallenge #DataStructures #Algorithms #LeetCode #ContinuousLearning”

🚀 Day 27 of #100DaysOfCode: Navigating the Unique in a Sorted Array! 🧩💻 Dove into the challenge of finding the single element in a sorted array. 🕵️♂️ Every element appears twice, except one. The twist? Solution in O(log n) time and O(1) space. 💡 Example: [1, 1, 2, 2, 3, 4, 4, 5, 5, 6, 6] ➡️ Output: 3 Massive shoutout to edSlash and LeetCode for the amazing guidance and challenges that make every day an adventure! 🙌 Let's keep the code efficient and elegant! 💪 #dsawithedslash #LeetCode #Algorithm #CodingChallenge

#100daysofcodingchallenge of solving problems. ✅Day - 4/100 🔍 1- Longest Sub-Array with Sum K: https://lnkd.in/gaXDJpcc 📘DSA Sheet: https://lnkd.in/de7CJR8Z (One-stop solution for Coders)  💪 Feel free to share your thoughts or any tips you have in the comments! #StriversA2Z #LeetCode #CodingJourney #DataStructures #Algorithms #ProblemSolving #100DaysOfCode #TechCommunity #LinkedInLearning

🚀 Day 46 of #100DaysOfCode 🚀 Problem: Remove Duplicate Letters Definition: Given a string s, remove duplicate letters so that every letter appears once and only once. You must make sure your result is the smallest in lexicographical order  among all possible results. Checkout - Github: https://lnkd.in/gKFHiiZa Leetcode: https://lnkd.in/g-hbEeXp #CodingJourney #LeetCode #CodeStudio #ProblemSolving #Algorithms #TechSkills #ContinuousLearning #DSAwithedSlash edSlash LeetCode

🌟 Day 59 of the 75-day LeetCoding Challenge! 🎉 🚀 Problem: 121. Best Time to Buy and Sell Stock 🔍 Level Description: Easy ⚡Link to Problem: https://lnkd.in/g_pKW7hE 💡Approach || 🕒O(n), || 💾O(1) --Algorithm: 1. We have two variables, m1 and m2. m1 will store the maximum profit, while m2 will store the minimum price encountered so far. 2. We iterate through each element of the prices array. 3. In each iteration, we check if the current price (prices[i]) is smaller than m2. If so, we update m2 because this might be a new minimum price. 4. Then, we calculate the profit that can be obtained by selling at the current price (prices[i]) minus the minimum price encountered so far (m2). We update m1 with the maximum of the current m1 and this new profit. 5. Finally, we return m1, which holds the maximum profit achievable. _________________________________________________ #75daysCodeChallenge #leetcode #algorithm #datastructures #codingjourney #linkedincodingcommunity #coding #codingchallenge

Today was #Day148 of #180DaysOfCodeChallengeLeetCode where I solved the question - Count Number of Teams 👨🏻💻🚀 #CodingChallenge #LeetCode #ContinuousLearning #Algorithm #DataStructures #CareerDevelopment

🌟 Day 25 of the 75-day LeetCoding Challenge! 🎉 🚀 Problem: 11. Container With Most Water 🔍 Level Description: Medium ⚡Link to Problem:https://lnkd.in/g_wFAwWa 💡Approach || 🕒 O(n) || 💾O(1) --Algorithm: 1. Initialization:   - Initialize `max_area` to store the maximum area found so far (set to 0).   - Initialize `area` to store the current area (set to 0).   - Initialize `i` to 0, pointing to the start of the input vector `height`.   - Initialize `j` to `n - 1`, pointing to the end of the input vector `height` (where `n` is the size of the vector). 2. Two Pointer Approach:   - While `i` is less than `j`:    - Calculate the minimum height between `height[i]` and `height[j]`: `min_height = min(height[i], height[j])`.    - Calculate the current area: `area = min_height * (j - i)`.    - Update `max_area`: `max_area = max(max_area, area)`.    - Move the pointer with the smaller height towards the other pointer:     - If `height[i] < height[j]`, increment `i` (move right).     - Otherwise, decrement `j` (move left). 3. Return Result:   - After iterating through all possible combinations, return `max_area`, the maximum area found in the histogram. __________________________________________________________________ 🤝Connect with me: https://lnkd.in/gkydBqEu #75daysCodeChalleng #leetcode #algorithm  #datastructures #codingjourney  #linkedincodingcommunity  #coding #codingchallenge 

Day: 26 👨💻 Today's DSA Challenge: Time Based Key-Value Store - https://lnkd.in/dz_TV5dt Here's my solution for today’s challenge on LeetCode! Check out the code and the output below. Let's solve and learn together! #Coding #DataStructures #Algorithms #LeetCode #DailyCoding