#Day61.Today I solved: 3Sum Closest🔥. Given an array and a target, find a triplet whose sum is closest to the target. ✅Concepts used:.Two-pointer technique🧭.Sorting for optimization.Greedy tracking of closest sum. Clean code, strong logic. #100DaysOfCode #Java #LeetCode #DSA

#Day60.Solved: Fruits into Baskets-II.🟣Copied arrays into ArrayList the right way.🟡Fixed logic bug in fruit-basket matcher🍎🧺. 🔸Learned:.▪️Arrays.asList(int[]).▪️Manual loop for primitives.▪️Don’t modify list while iterating!. #100DaysOfCode #Java #DSA #LeetCode #Technology

#Day59.Java & DSA Progress🚀. Topic 1: Word Break Problem – DP🔄. ✅Learned how to use dp[i] to represent if s[0. i-1] is breakable.✅Used Set<String> for O(1) dictionary lookup.✅Time: O(n²), Space: O(n + dictSize).🧠Key: dp[i] = true if any dp[j] && s[j. i] in dict. #DSA #Java

#Day58.Solved: 🏔️ Find Peak Index in a Mountain Array. 💡 Approach: Binary Search.If arr[mid] < arr[mid+1] → move right⛰️.Else → move left or stay⬅️.Stop when start == end. 🧠Key Insight: No need to check mid-1 or mid+1 directly. #Java #DSA #LeetCode #100DaysOfLeetCode #Coding

#Day57.🧠Problem: Design a HashSet.💡Without using any built-in hash table libraries!. 👨‍💻Methods:.add(key) ➕.remove(key) ➖.contains(key) ❓. 📊 TC (Avg): O(1) for all ops.📊 TC (Worst): O(n).📦 SC: O(n). #Java #DSA #LeetCode #HashSet #Coding #SystemDesign #100DaysOfLeetCode

#Day56.👨‍💻Topic: Find Peak Element — Binary Search🔍. ✅Learned how to find a peak element in O(log n) using binary search. 💡Key Fact: No two adjacent elements are equal.🧠Insight: Binary search works here even without sorted array!.#Java #DSA #LeetCode #Coding #100DaysChallenge

#Day55.✅Learned about Amortized Time Complexity.✅Built a Sudoku Validator in Java that checks:.Rows.Cols.3×3 Sub-boxes. 📌Used HashSet for duplicate checking.📌Skipped empty cells.📌clean code. 🔥Solidified 2D array traversal!.#Java #LeetCode #100DaysOfCode #Sudoku #DSA #Coding

#Day54.✅ Solved: Path Sum in Binary Tree . 📌 Goal: Check if there's a root-to-leaf path with a given target sum.📚 Concepts: Binary Tree, Recursion, DFS.🧮 TC: O(N), SC: O(H). Learning trees one node at a time 🌱.#Java #DSA #LeetCode #100DaysChallenge #TechnologyCareers

#Day53.✅ Problem: Largest Triangle Area. 🔍 Brute-forced all 3-point combinations.📐 Used Shoelace formula to compute triangle area:.💪 Learned how to handle 2D point arrays and apply geometry in code. 🔄 Still going strong, 1 day at a time!. #100DaysOfCode #LeetCode #Java #DSA

#Day52.Exploring how to manipulate strings in Java today!.✅ Filtered lowercase letters.✅ Removed numbers & spaces.✅ Learned how to use HashSet & Hashtable.✅ Found the key with the highest value in a map. Consistency builds mastery. Let's keep going!. #Java #100DaysOfCode #DSA

#Day51.Today I solved the Count Hills and Valleys problem using an optimized approach in Java!.✅ Removed consecutive duplicates on the fly.✅ Achieved O(n) time & O(1) space.💡 Learned how to handle terrain-like patterns efficiently.#Java #DSA #LeetCode #Coding #100DaysChallenge

#Day50. ✅ Solved Find Shortest Subarray with Same Degree.✅ Found the most frequent element in an array. 📌Key Concepts:.Degree of an array.Tracking first & last occurrence.Optimal subarray identification. 📈Halfway there. Time to double down. #Java #DSA #LeetCode #CodingJourney

#Day49.✅Solved the Lemonade Change problem in java. 🔍Key insights:.Maintain only count of $5 & $10 bills.Always give back the highest denomination 1st. ⚡Learning: Sometimes a hashtable is overkill-a couple of counters do the job!. #Java #DSA #LeetCode #100DaysChallenge #Coding

#Day48.✅ Learned how to filter prime numbers using logic based on 2, 3, 5, 7.✅ Understood and implemented the Sieve of Eratosthenes.✅ Feeling sharper by thinking through logic before coding!.🔁 Slow and strong is the way. Every day adds up. #Java #DSA #CodingJourney #LeetCode

#Day47.Solved the Triangle Minimum Path Sum problem using Bottom-Up Dynamic Programming in Java!. ✨ Learned:.Why we can't cast List<List<Integer>> to int[][]. Importance of adjacent constraints in triangle path. Optimized DP using 1D array. #Java #DSA #CodeNewbie #LeetCode #tech

#Day46.✅Solved: “Form the Largest Number” from a list of integers.💡Key Trick: Sort numbers as strings using custom comparator:. (a, b) -> (b + a).compareTo(a + b). Why? Because "9"+"34" > "34"+"9" ⇒ "934" > "349".Result is a string, not int💥. #100DaysOfCode #Java #DSA #Coding

#Day45.✅ Solved Number of Islands. 🔍 Explored 3 approaches:.My Greedy Top-Left Count (O(1) space 💡). DFS Flood Fill (Robust 🔥). BFS to avoid stack overflow (Scalable 🚀). Every method has its place. Today, I coded smart and learned deep. 🔥.#LeetCode #Java #DSA #CodingJourney

#Day44.Count only the top-left cell of each battleship by skipping parts connected from above or left. No need to mutate the board or jump indexes!. ✅ Time: O(m×n).✅ Space: O(1).✅ Lesson: Let the structure guide your logic — don’t force it. #100DaysOfCode #Leetcode #Java #DSA

#day43.💻 Problem: Teemo Attacking. 🚀 Optimized the poison duration calculation.🔁 Replaced Math.min() with if-else — shaved off 1ms runtime!.📉 From O(n * duration) (HashSet) ➝ O(n) with O(1) space.📈 Progress = Patience + Precision. #100DaysOfCode #LeetCode #Java #Coding #DSA

#Day42.📌Topic: House Robber II-Dynamic Programming. 🔄 Key Insight: In a circular setup, you can't rob both first and last houses. 👉So, split into 2 cases:.1️⃣Rob from house 0 to n-2.2️⃣Rob from house 1 to n-1.return max(case1,case2). #Java #DSA #Leetcode #CodeNewbie #Technology