Solved Max Sum Divisible by Three today. Not gonna lie… this one wasn’t easy at all. Took me a long time and a few hints before the idea finally clicked. 😅 But feels good to get it done.

Took me a while to realize the key idea: we should pick numbers that other intervals can reuse — that’s how we keep the final set small 😅 But once it clicked, the problem was actually fun to solve. Even if it took me ~50 minutes, worth it! #LeetCode #Java #DSA

Solved LeetCode 778 – Swim in Rising Water 🏊‍♂️ Honestly, it felt quite easy after solving Path With Minimum Effort (1631) — same Dijkstra pattern, just a twist in the condition 😌 I know I’m posting after quite a while, but I’ll try to stay regular again! 💪 #LeetCode #Java

Solved LeetCode 1792 — Maximum Average Pass Ratio. Greedy + max-heap: store gain = (p+1)/(t+1)-p/t, pop max, add a student (p++,t++), recompute & push back; repeat extraStudents times, then avg ratios. Awesome greedy problem — love these. Also hit 365-day LeetCode badge! 🏅

Solved #LeetCode “Maximum 69 Number” with a simple greedy trick: scan the digits left-to-right and flip the first ‘6’ you see to ‘9’. Instant max value in O(n) time! 💡 But who made this question though? #Java #100DaysOfCode #CodingChallenge

Solving LeetCode #2438: Range Product Queries of Powers using bitwise & modular arithmetic. Fairly easy one, but great for practice! 🧩🔢 Check out the code here: https://t.co/gOoksglUMN

LeetCode 2106: Fruits Harvested! 🍎A great twist on the sliding window approach where you must also calculate the min travel distance for the range. Been a while, but I'm back to posting solutions regularly! Code: https://t.co/1n1td9EG1L #LeetCode #Java #ProblemSolving #Coding

Really enjoyed LeetCode 1233. A great problem to compare algorithms! My solution explores 3 approaches: >Brute-Force >A clever Sorting method >The optimal Trie Check out the Java code comparing all three: https://t.co/yFlQVGDNWL #LeetCode #Java #ProblemSolving #DataStructures

Finally cracked LeetCode 2163. This one looked deceptively simple but I got absolutely cooked. The two-pass Priority Queue solution took me a while to get right. 😅 My Java solution: https://t.co/AyKcEJgEUs #LeetCode #ProblemSolving #Java

🚀 Solved LeetCode 2410: Match Players & Trainers in Java! Used sorting + two‑pointer to maximize matches in O(n log n). Check out the concise code here: https://t.co/CKrJNnN5wv #LeetCode #Java #100DaysOfCode

Got cooked! 🧠 Solved LeetCode 1751 - Max Events That Can Be Attended II 🎯 Pick max value from up to k non-overlapping events ✅ Sort + Binary Search + DP + Memoization Code 🔽 🔗 https://t.co/oPrqHwe4ik #Java #leetcode #DynamicProgramming

Back after a month! 🧠 Solved LeetCode #1353 - Max Number of Events That Can Be Attended ⏰ 🟢 Sort by start day 🟢 Min-heap by end day 🟢 Greedily attend earliest-ending events each day Code ⬇️ 🔗 https://t.co/lcGvC1HU4d #leetcode #Java #Coding #100DaysOfCode

📢 Heads up! I’ll be inactive here for a while due to semester exams 📚 — at least for another 12 days. But the grind doesn’t stop 💪 I’m still solving and killing it on LeetCode daily behind the scenes! 🔥 #LeetCode #CodingJourney #StudentLife #100DaysOfCode #KeepGrinding

LeetCode 1061: Lexicographically Smallest Equivalent String • Given two strings s1 & s2 → define char equivalences • Build graph (or UF) & DFS/Find to map each baseStr char to its smallest equivalent 🔗 https://t.co/A2vOVeGez0 #LeetCode #Java #Strings #CodingChallenge

LeetCode 3403:Find the Lexicographically Largest String From the Box I • Given word & k friends→each takes a non-overlapping substring of length n−k+1 • Slide a window of size n−k+1, track max lex substring 🔗 https://t.co/WTzefCtXRX #LeetCode #Java #Strings #CodingChallenge

IPL ❌ Leetcode 💯 LeetCode 1298: Maximum Candies You Get from Boxes(easier one!) • Use BFS: start with opened boxes,collect candies • Track keys & contained boxes to open more • Continue until no new boxes can open 🔗 https://t.co/ZJQfYTmH0i #LeetCode #Java #BFS #EasyProblem

Night coding — just me and the errors. 📸 LeetCode 2929: Distribute Candies II 🧠 Logic: Count all (i, j) pairs where 0 ≤ i,j ≤limit and i + j ≤ n. Iterate i from max(0, n − 2·limit) to min(limit, n), and for each i, count valid j. #LeetCode #Java #NightCoding #ProblemSolving

LeetCode 909: Snakes and Ladders – BFS on a 1D board (handling zig-zag rows) to find min rolls 🔗 https://t.co/0F1eOONFNO #LeetCode #Java #BFS #CodingChallenge

Back from exams and back to coding! 🎓💻 LeetCode 2359: Closest Node to Two Nodes • DFS from both nodes to get distances • Find node with min of max(dist1[i], dist2[i]) 🔗 https://t.co/s0GpjDXFwZ #LeetCode #Java #Graphs #CodingJourney #BackToCoding

LeetCode 3068: Find the Maximum Sum of Node Values • Compute base sum of nums • For each num, diff = (num^k)−num; add positive diffs • If count of positive diffs is odd, subtract smallest |diff| Result = baseSum + adjustedDiff 🔗 https://t.co/rCO4e18Um3 #LeetCode #Java