Search results for #LeetCode75
Day 14 of #LeetCode75 🔹 Problem: 1732. Find the Highest Altitude Idea: Prefix sum (cumulative addition) Keeping track of maximum value while iterating #100DaysOfCode #LeetCode #DSA #ProblemSolving #Day13
Takeaway: - Two-pointer → optimal for problems requiring max/min over a range with linear movement - Classic #LeetCode75 pattern 💡 #LeetCode #Java #DSA #100DaysOfCode #ProblemSolving #CodingJourney #CodeNewbie #DevCommunity
🚀 LeetCode 75 – Day 3 Problem: 11. Container With Most Water Language: Java ☕ Given height[], find two lines forming a container that holds the most water. #LeetCode #LeetCode75 #100DaysOfCode #Java #DSA
That’s Day 3 of #LeetCode75 done ✅ Sliding Window is one of the most useful patterns you’ll see often. More problems coming tomorrow 🚀 #LeetCode #Java #DSA #100DaysOfCode #ProblemSolving #CodingJourney #CodeNewbie #DevCommunity
🚀 LeetCode 75 – Day 3 Problem: 643. Maximum Average Subarray I Language: Java ☕ We need to find the contiguous subarray of length k that has the maximum average. Brute force won’t work for large inputs. Let’s break it down 👇 #LeetCode #LeetCode75 #100DaysOfCode #DSA #Java
That’s Find the Highest Altitude ⛰️ from #LeetCode75. A simple prefix sum style problem that builds up nicely for later harder ones. Have you solved this one yet? #LeetCode #CodingJourney #DSA #Java #ProblemSolving #CodeNewbie #DevCommunity #ProgrammingTips
Day 3 of #LeetCode75 🚀 Today’s problem: Find the Highest Altitude (LC 1732) We simulate altitude changes from a gain[] array & return the max altitude reached. Let’s break it down 👇 #LeetCode #100DaysOfCode #Java #DSA
Day 13 of #LeetCode75 Solved 1493. Longest Subarray of 1's After Deleting One Element Approach: Sliding Window / 2 Pointers Track consecutive 1’s with at most one deletion Update max length as we move Time: O(n) Space: O(1) #100DaysOfCode #LeetCode #DSA #ProblemSolving
✅ Runs in O(n) time and O(1) space Pivot problems sharpen prefix-sum intuition 💡 Another neat one from #LeetCode75! #Java #DSA #CodingJourney #CodeNewbie #ProgrammingTips
🚀 Solved LeetCode #724: Find Pivot Index (#LeetCode75) Find the index where the sum of the left = sum of the right. Here’s my approach 👇 #Java #DSA #CodingJourney #100DaysOfCode #ProblemSolving
🚀 Solved LeetCode #392: Is Subsequence (#LeetCode75) Check if string s is a subsequence of string t. Here’s my approach 👇 #Java #DSA #CodingJourney #100DaysOfCode #ProblemSolving
✅ Efficient in-place, O(n) time, O(1) space solution Two-pointer techniques are super useful for array manipulation problems. #LeetCode75 #Java #DSA #CodingJourney #CodeNewbie #ProgrammingTips
🚀 Solved LeetCode #283: Move Zeroes (#LeetCode75) Move all zeros to the end of an array in-place while maintaining order. Here’s my approach 👇 #Java #DSA #CodingJourney #100DaysOfCode
✅ In-place compression with O(n) time and O(1) extra space Two-pointer technique makes this pattern reusable for similar array problems. #LeetCode75 #Java #DSA #CodingJourney #ProblemSolving #CodeNewbie
🚀 Solved LeetCode #443: String Compression! Compress a character array in-place by replacing consecutive duplicates with <char><count> format. Here’s my approach 👇 #LeetCode75 #Java #DSA #100DaysOfCode #ProblemSolving
Takeaway: 👉 Brute force helps build intuition 🔍 👉 Memoization/Dynamic Programming saves time #LeetCode #LeetCode75 #Java #DSA #ProblemSolving #DynamicProgramming #CodingJourney #100DaysOfCode #CodeNewbie #DevCommunity #ProgrammingTips
🌟 Today’s #LeetCode POTD: Minimum Score Triangulation of Polygon Started with recursion → got TLE → optimized with DP. Here’s how the code evolved 🧵👇 #LeetCode75 #DSA #Java #ProblemSolving
